Testing polycyclicity of finitely generated rational matrix groups

DOI10.1090/S0025-5718-07-01979-5zbMath1118.20046OpenAlexW1985762646MaRDI QIDQ3433778

Björn Assmann, Bettina Eick

Publication date: 2 May 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-07-01979-5

zbMATH Keywords

algorithmsgeneral linear groupsfinitely generated groupsTits alternativenilpotencypolycyclicity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Linear algebraic groups over the reals, the complexes, the quaternions (20G20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

The automorphism group of a finitely generated virtually abelian group. ⋮ Integrality and arithmeticity of solvable linear groups. ⋮ Algorithms for computing with nilpotent matrix groups over infinite domains. ⋮ Linear groups and computation ⋮ Algorithms for the Tits alternative and related problems.

Uses Software

• GAP
• Polenta

Cites Work

• The algorithmic theory of polycyclic-by-finite groups
• Practical algorithms for polycyclic matrix groups
• Computing polycyclic presentations for polycyclic rational matrix groups.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item