Algorithms for the Tits alternative and related problems.
DOI10.1016/j.jalgebra.2011.06.036zbMath1245.20062arXiv1905.05234MaRDI QIDQ765725
E. A. O'Brien, Alla S. Detinko, Dane L. Flannery
Publication date: 22 March 2012
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05234
algorithms; decision problems; Tits alternative; solvable-by-finite groups; finitely generated linear groups
68W30: Symbolic computation and algebraic computation
20G15: Linear algebraic groups over arbitrary fields
20E07: Subgroup theorems; subgroup growth
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20-04: Software, source code, etc. for problems pertaining to group theory
Related Items
Uses Software
Cites Work
- Conditions for linear groups to have unipotent derived subgroups.
- On deciding finiteness of matrix groups.
- The algorithmic theory of polycyclic-by-finite groups
- Algorithms for matrix groups and the Tits alternative
- The Magma algebra system. I: The user language
- Practical algorithms for polycyclic matrix groups
- Deciding finiteness of matrix groups in positive characteristic.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Free subgroups in linear groups
- The Orbit-Stabilizer Problem for Linear Groups
- Computing in Nilpotent Matrix Groups
- Testing polycyclicity of finitely generated rational matrix groups
- On Jordan's theorem for complex linear groups
- The probability of generating the symmetric group
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item