✦ LIBER ✦

Constructing matrix representations of finitely presented groups

✍ Scribed by S.A. Linton

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 777 KB
Volume: 12
Category: Article
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80095-8

No coin nor oath required. For personal study only.

✦ Synopsis

The Todd-Coxeter coset enumeration algorithm is one of the most important tools of computational group theory. It may be viewed as a means of constructing permutation representations of finitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over various fields. In fact the algorithm is more general than this, and can be used to construct matrix representations of finitely generated algebras. The algorithm (with some restrictions) has been implemented as a C program and some results obtained with this implementation are described.

📜 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 Representations of Finite G

Constructing Representations of Finite Groups and Applications to Finitely Presented Groups

✍ W Plesken; B Souvignier 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 180 KB

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

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 Permutation Representations

Constructing Permutation Representations for Matrix Groups

✍ GENE COOPERMAN; LARRY FINKELSTEIN; MICHAEL TSELMAN; BRYANT YORK 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 465 KB

New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutat

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