✦ LIBER ✦

Constructing Representations of Finite Groups and Applications to Finitely Presented Groups

✍ Scribed by W Plesken; B Souvignier

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 180 KB
Volume: 202
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.7281

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysing Finitely Presented Groups by C

Analysing Finitely Presented Groups by Constructing Representations

✍ W. PLESKEN; B. SOUVIGNIER 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 476 KB

We present methods to construct representations of finitely presented groups. In wellconditioned examples it is possible to use Gröbner base and resultant methods to solve the system of algebraic equations obtained by evaluating the relations on matrices with indeterminates as entries. For more comp

Constructing Finitely Presented Simple G

Constructing Finitely Presented Simple Groups That Contain Grigorchuk Groups

✍ Claas E. Röver 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 188 KB

We construct infinite finitely presented simple groups that have subgroups isomorphic to Grigorchuk groups. We also prove that up to one possible exception all previously known finitely presented simple groups are torsion locally finite.

Constructing Faithful Representations of

Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent Groups

✍ Willem A. de Graaf; Werner Nickel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 257 KB

We formulate an algorithm for calculating a representation by unipotent matrices over the integers of a finitely-generated torsion-free nilpotent group given by a polycyclic presentation. The algorithm works along a polycyclic series of the group, each step extending a representation of an element o

Constructing Irreducible Representations

Constructing Irreducible Representations of Finitely Presented Algebras

✍ Edward S. Letzter 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 245 KB

We describe an algorithmic test, using the "standard polynomial identity" (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When n-dimensional irreducible representations do exi

Supercuspidal Representations of Finite

Supercuspidal Representations of Finite Reductive Groups

✍ Gerhard Hiss 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Finite-Rank Free Metabelian Subgroups of

Finite-Rank Free Metabelian Subgroups of Finitely Presented Metabelian Groups

✍ Ada Peluso 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A sufficient condition is obtained for the residual torsion-free nilpotence of certain finitely presented metabelian groups that arise from a matrix representa-Ž . tion developed by Magnus 1939, Ann. of Math. 40, 764᎐768 for metabelian Ž groups. Using this condition and a construction due to Baumsla