Algorithms for the Tits alternative and related problems.

DOI10.1016/J.JALGEBRA.2011.06.036zbMATH Open1245.20062arXiv1905.05234OpenAlexW2006270068MaRDI QIDQ765725FDOQ765725

Authors: E. A. O'Brien, A. S. Detinko, D. L. Flannery 

Publication date: 22 March 2012

Published in: Journal of Algebra (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1905.05234

Recommendations

• Linear groups and computation
• Improved algorithms for the Tits alternative
• Algorithms for matrix groups and the Tits alternative
• Deciding finiteness of matrix groups in positive characteristic.
• scientific article; zbMATH DE number 1004942

zbMATH Keywords

algorithmsdecision problemsTits alternativesolvable-by-finite groupsfinitely generated linear groups

Mathematics Subject Classification ID

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)

Cites Work

• The Magma algebra system. I: The user language
• Algorithms for computing with nilpotent matrix groups over infinite domains.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing polycyclic presentations for polycyclic rational matrix groups.
• Free subgroups in linear groups
• Testing polycyclicity of finitely generated rational matrix groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• The probability of generating the symmetric group
• The algorithmic theory of polycyclic-by-finite groups
• On Jordan's theorem for complex linear groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing with matrix groups over infinite fields.
• The Orbit-Stabilizer Problem for Linear Groups
• Computing in Nilpotent Matrix Groups
• Practical algorithms for polycyclic matrix groups
• On deciding finiteness of matrix groups.
• Algorithms for matrix groups and the Tits alternative
• Deciding finiteness of matrix groups in positive characteristic.
• Improved algorithms for the Tits alternative
• Title not available (Why is that?)
• Conditions for linear groups to have unipotent derived subgroups.

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.
• Algorithms for Experimenting with Zariski Dense Subgroups
• Decision problems concerning S-arithmetic groups
• 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

Uses Software

• Magma
• Nilmat
• Polenta

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)