Algorithms for Experimenting with Zariski Dense Subgroups
From MaRDI portal
Publication:5857576
DOI10.1080/10586458.2018.1466217OpenAlexW2767915949MaRDI QIDQ5857576
Alexander Hulpke, Alla S. Detinko, Dane L. Flannery
Publication date: 1 April 2021
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.02147
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over arbitrary fields (20G15) Other matrix groups over rings (20H25) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Proving infinite index for a subgroup of matrices ⋮ Experimenting with Symplectic Hypergeometric Monodromy Groups ⋮ Zariski density and computing with \(S\)-integral groups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for arithmetic groups with the congruence subgroup property.
- 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
- Subgroup growth.
- Recognizing finite matrix groups over infinite fields.
- Small-dimensional projective representations of symmetric and alternating groups.
- Generic Phenomena in Groups -- Some Answers and Many Questions
- Notes on Thin Matrix Groups
- The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
- Approximate subgroups and super-strong approximation
- The Steinberg representation
- Zariski Density and Genericity
- On the minimal dimensions of irreducible representations of symmetric groups
- Zariski density and computing in arithmetic groups
- Generic Thinness in Finitely Generated Subgroups of SL$_n(\mathbb Z)$
- Small Subgroups of
- Zariski Dense Surface Subgroups in SL(4, )
- Prime power degree representations of quasi-simple groups
This page was built for publication: Algorithms for Experimenting with Zariski Dense Subgroups