Algorithms for the Tits alternative and related problems.

DOI10.1016/j.jalgebra.2011.06.036zbMath1245.20062arXiv1905.05234OpenAlexW2006270068MaRDI 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

zbMATH Keywords

algorithmsdecision problemsTits alternativesolvable-by-finite groupsfinitely generated linear groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over arbitrary fields (20G15) Subgroup theorems; subgroup growth (20E07) 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 (12)

Freeness and 𝑆-arithmeticity of rational Möbius groups ⋮ The automorphism group of a finitely generated virtually abelian group. ⋮ The strong approximation theorem and computing with linear groups ⋮ Zariski density and computing in arithmetic groups ⋮ Algorithms for linear groups of finite rank. ⋮ Algorithms for arithmetic groups with the congruence subgroup property. ⋮ A practical model for computation with matrix groups. ⋮ Integrality and arithmeticity of solvable linear groups. ⋮ 2-generation of simple Lie algebras and free dense subgroups of algebraic groups ⋮ Linear groups and computation ⋮ Algorithms for Experimenting with Zariski Dense Subgroups ⋮ The constructive membership problem for discrete free subgroups of rank 2 of

Uses Software

• Magma
• Nilmat
• Polenta

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Algorithms for the Tits alternative and related problems.