Linear groups and computation
From MaRDI portal
Publication:2292421
DOI10.1016/j.exmath.2018.07.002zbMath1444.20030arXiv1805.05984MaRDI QIDQ2292421
Dane L. Flannery, Alla S. Detinko
Publication date: 3 February 2020
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.05984
MAGMA; arithmetic groups; Tits alternative; linear groups; GAP; recognition algorithm; computational group theory
20G15: Linear algebraic groups over arbitrary fields
20H20: Other matrix groups over fields
20-08: Computational methods for problems pertaining to group theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic Tits alternative and probabilistic identities
- Generating pairs for finite index subgroups of \(\mathrm{SL}(n,\mathbb{Z})\)
- Algorithms for arithmetic groups with the congruence subgroup property.
- A practical model for computation with matrix groups.
- Integrality and arithmeticity of solvable linear groups.
- Zariski dense surface subgroups in \(\mathrm{SL}(3,\mathbb Z)\).
- Random subgroups of linear groups are free.
- Algorithms for the Tits alternative and related problems.
- On the maximal subgroups of the finite classical groups
- Conditions for linear groups to have unipotent derived subgroups.
- On deciding finiteness of matrix groups.
- Constructing algebraic groups from their Lie algebras.
- Free subgroups of \(SL(n,Z),\) \(n>2\), generated by transvections
- Arithmetic groups
- Some general algorithms. I: Arithmetic groups
- Some general algorithms. II: Nilpotent groups
- The algorithmic theory of polycyclic-by-finite groups
- Algorithms for matrix groups and the Tits alternative
- Deciding finiteness for matrix groups over function fields
- The Magma algebra system. I: The user language
- The congruence subgroup problem.
- Subgroup growth.
- Recognizing finite matrix groups over infinite fields.
- Strongly dense free subgroups of semisimple algebraic groups.
- Practical algorithms for polycyclic matrix groups
- A practical algorithm for finding matrix representations for polycyclic groups
- Constructing arithmetic subgroups of unipotent groups.
- Deciding finiteness of matrix groups in positive characteristic.
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing generators of the unit group of an integral Abelian group ring.
- Algorithms for linear groups of finite rank.
- Arithmeticity of certain symplectic hypergeometric groups
- Quantum automata and algebraic groups
- Computing polycyclic presentations for polycyclic rational matrix groups.
- A topological Tits alternative.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Matrix representations for torsion-free nilpotent groups by Deep Thought.
- Finite factor groups of the unimodular group
- Solution of the congruence subgroup problem for \(\text{SL}_ n\) \((n\geq 3)\) and \(\text{Sp}_{2n}\) \((n\geq 2)\)
- Almost all subgroups of a Lie group are free
- Free subgroups in linear groups
- How to pick a random integer matrix? (and other questions)
- On strong approximation for algebraic groups
- Notes on Thin Matrix Groups
- A data structure for a uniform approach to computations with finite groups
- Zariski Density and Genericity
- Computing in Unipotent and Reductive Algebraic Groups
- The Orbit-Stabilizer Problem for Linear Groups
- Computing in Nilpotent Matrix Groups
- Testing polycyclicity of finitely generated rational matrix groups
- Monodromy of Picard-Fuchs differential equations for Calabi-Yau threefolds
- Decision problems concerning S-arithmetic groups
- Pell's Equation and Two Generator Free Möbius Groups
- Generators For All Principal Congruence Subgroups of SL(n, Z) with n ≥3
- Zariski density and computing in arithmetic groups
- On computing a separating transcendence basis
- On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic
- Finite rational matrix groups
- Block Systems of a Galois Group
- Small Subgroups of
- Polynomial-time theory of matrix groups
- Zariski Dense Surface Subgroups in SL(4, )
- Thin monodromy in Sp(4)
- Linear groups
- Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals
