Testing polycyclicity of finitely generated rational matrix groups

DOI10.1090/S0025-5718-07-01979-5MaRDI QIDQ3433778zbMATH OpenOpenAlexFDO

Authors Björn Assmann, B. 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

algorithmsfinitely generated groupsgeneral linear groupsnilpotencyTits alternativepolycyclicity

Mathematics Subject Classification ID

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

Recommendations

• Computing polycyclic presentations for polycyclic rational matrix groups.
• scientific article; zbMATH DE number 1187238
• Matrix representability of finitely generated groups.
• Irreducibility testing of finite nilpotent linear groups.
• scientific article; zbMATH DE number 1004942
• On deciding finiteness of matrix groups.
• scientific article; zbMATH DE number 1263310
• On the test rank of free polynilpotent groups.
• Deciding finiteness of matrix groups in positive characteristic.
• Constructive membership tests in some infinite matrix groups

Cites work

• scientific article; zbMATH DE number 3815938 (Why is no real title available?)
• scientific article; zbMATH DE number 1263310 (Why is no real title available?)
• scientific article; zbMATH DE number 1120361 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 3380828 (Why is no real title available?)
• Computing polycyclic presentations for polycyclic rational matrix groups.
• Computing with infinite polycyclic groups
• Improved algorithms for the Tits alternative
• Practical algorithms for polycyclic matrix groups
• The algorithmic theory of polycyclic-by-finite groups

Cited in

(7)

• Algorithms for computing with nilpotent matrix groups over infinite domains.
• The automorphism group of a finitely generated virtually abelian group.
• Algorithms for the Tits alternative and related problems.
• Integrality and arithmeticity of solvable linear groups.
• Irreducibility testing of finite nilpotent linear groups.
• Linear groups and computation
• Computing polycyclic presentations for polycyclic rational matrix groups.

Describes a project that uses

Uses Software

• Polenta
• GAP

This page was built for publication: Testing polycyclicity of finitely generated rational matrix groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3433778)