Abstract
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups defined by a so-called finite L-presentation. This type of presentation incorporates all finite presentations as well as certain infinite presentations. The algorithm allows a variety of polycyclic quotients ranging from maximal nilpotent quotients of a given class to the maximal solvable quotients of a given derived length. The algorithm uses Groebner bases over integral group rings of polycyclic groups as main means of its computation.
Keywords
- Polycyclic quotient
- nilpotent quotient
- finitely presented group
- L-presented group
- Groebner bases
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bartholdi, L., Eick, B., Hartung, R.: A nilpotent quotient algorithm for certain infinitely presented groups and its applications. Internat. J. Algebra Comput. 18(8), 1321–1344 (2008)
Bartholdi, L., Virág, B.: Amenability via random walks. Duke Math. J. 130(1), 39–56 (2005)
Grigorchuk, R., Zuk, A.: On a torsion-free weakly branch group defined by a three state automaton. Internat. J. Algebra Comput. 12(1-2), 223–246 (2002)
Grigorchuk, R.I.: Just infinite branch groups. In: New horizons in pro-p groups. Progr. Math., vol. 184, pp. 121–179. Birkhäuser, Boston (2000)
Gupta, N.D., Sidki, S.N.: Some infinite p-groups. Algebra i Logika 22(5), 584–589 (1983)
Lo, E.H.: A polycyclic quotient algorithm. J. Symb. Comput. 25, 61–97 (1998)
Nickel, W.: Computing nilpotent quotients of finitely presented groups. In: Geometric and computational perspectives on infinite groups. Amer. Math. Soc. DIMACS Series, pp. 175–191 (1996)
Sims, C.C.: Computation with finitely presented groups. Cambridge University Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eick, B., Horn, M. (2010). Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15581-9
Online ISBN: 978-3-642-15582-6
eBook Packages: Computer ScienceComputer Science (R0)
