Algorithms for the Tits alternative and related problems.
From MaRDI portal
algorithmsdecision problemsTits alternativesolvable-by-finite groupsfinitely generated linear groups
Symbolic computation and algebraic computation (68W30) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Linear algebraic groups over arbitrary fields (20G15) Software, source code, etc. for problems pertaining to group theory (20-04)
Abstract: We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotent-by-finite, abelian-by-finite, or central-by-finite. Our algorithms have been implemented in MAGMA and are publicly available.
Recommendations
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 3815938 (Why is no real title available?)
- scientific article; zbMATH DE number 3781457 (Why is no real title available?)
- scientific article; zbMATH DE number 3496414 (Why is no real title available?)
- scientific article; zbMATH DE number 1489555 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 3397780 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Algorithms for matrix groups and the Tits alternative
- Computing in Nilpotent Matrix Groups
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Computing with matrix groups over infinite fields.
- Conditions for linear groups to have unipotent derived subgroups.
- Deciding finiteness of matrix groups in positive characteristic.
- Free subgroups in linear groups
- Improved algorithms for the Tits alternative
- On Jordan's theorem for complex linear groups
- On deciding finiteness of matrix groups.
- Practical algorithms for polycyclic matrix groups
- Testing polycyclicity of finitely generated rational matrix groups
- The Magma algebra system. I: The user language
- The Orbit-Stabilizer Problem for Linear Groups
- The algorithmic theory of polycyclic-by-finite groups
- The probability of generating the symmetric group
Cited in
(16)- Algorithms for linear groups of finite rank.
- Freeness and 𝑆-arithmeticity of rational Möbius groups
- Improved algorithms for the Tits alternative
- The automorphism group of a finitely generated virtually abelian group.
- Decision problems concerning S-arithmetic groups
- Algorithms for Experimenting with Zariski Dense Subgroups
- A practical model for computation with matrix groups.
- Zariski density and computing in arithmetic groups
- Algorithms determining finite simple images of finitely presented groups
- The constructive membership problem for discrete free subgroups of rank 2 of \(\mathrm{SL}_2(\mathbb R)\).
- Algorithms for arithmetic groups with the congruence subgroup property.
- Integrality and arithmeticity of solvable linear groups.
- Linear groups and computation
- The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm.
- 2-generation of simple Lie algebras and free dense subgroups of algebraic groups
- The strong approximation theorem and computing with linear groups
This page was built for publication: Algorithms for the Tits alternative and related problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765725)
