Analysing Finitely Presented Groups by Constructing Representations
β Scribed by W. PLESKEN; B. SOUVIGNIER
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 476 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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 complicated cases we show how finite epimorphic images and their modular representation theory can be used to find good candidates for representations over a finite field that can be lifted to a local field.
Finally, we apply lattice reduction methods to representations over local fields and obtain representations over algebraic number fields resp. rational function fields. Reducing modulo prime ideals thus gives infinitely many images of the finitely presented group.
π SIMILAR VOLUMES
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
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.
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