Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases

DOI10.1007/978-3-642-15582-6_10zbMath1198.20029OpenAlexW1778829186MaRDI QIDQ5747857

Bettina Eick, Max Horn

Publication date: 14 September 2010

Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15582-6_10

zbMATH Keywords

algorithmsGröbner basespolycyclic presentationsfinitely presented groupsnilpotent quotientspolycyclic quotients\(L\)-presented groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (1)

Computing stable epimorphisms onto finite groups

Uses Software

• GAP
• PCQL

This page was built for publication: Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases