Algorithms for arithmetic groups with the congruence subgroup property.
algorithmssubgroups of finite indexarithmetic groupscongruence subgroupscomputational group theoryfinitely generated matrix groupsGAPTodd-Coxeter algorithm
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 global fields and their integers (20G30) Structure of modular groups and generalizations; arithmetic groups (11F06) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05)
- scientific article; zbMATH DE number 3977253 (Why is no real title available?)
- scientific article; zbMATH DE number 44097 (Why is no real title available?)
- scientific article; zbMATH DE number 3496414 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- scientific article; zbMATH DE number 1406263 (Why is no real title available?)
- scientific article; zbMATH DE number 3375759 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- A data structure for a uniform approach to computations with finite groups
- Algorithms for linear groups of finite rank.
- Algorithms for the Tits alternative and related problems.
- Arithmetic groups
- Computing conjugacy classes of elements in matrix groups.
- Computing with matrix groups over infinite fields.
- Decision problems concerning S-arithmetic groups
- Finite factor groups of the unimodular group
- Generations for arithmetic groups.
- Generators For All Principal Congruence Subgroups of SL(n, Z) with n ≥3
- Integrality and arithmeticity of solvable linear groups.
- Introduction to Algebraic K-Theory. (AM-72)
- Notes on thin matrix groups
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- Recognizing finite matrix groups over infinite fields.
- Small subgroups of SL\((3,\mathbb Z)\)
- Solution of the congruence subgroup problem for \(\text{SL}_ n\) \((n\geq 3)\) and \(\text{Sp}_{2n}\) \((n\geq 2)\)
- Some general algorithms. I: Arithmetic groups
- Sous-groupes d'indice fini dans $SL\left( {n,Z} \right)$
- Subgroup growth.
- The Orbit-Stabilizer Problem for Linear Groups
- The congruence subgroup problem.
- The linear homogeneous group. III
- Freeness and 𝑆-arithmeticity of rational Möbius groups
- Algorithms for Experimenting with Zariski Dense Subgroups
- Experimenting with Symplectic Hypergeometric Monodromy Groups
- Zariski density and computing in arithmetic groups
- Proving infinite index for a subgroup of matrices
- Integrality and arithmeticity of solvable linear groups.
- Linear groups and computation
- The strong approximation theorem and computing with linear groups
- Zariski density and computing with \(S\)-integral groups
This page was built for publication: Algorithms for arithmetic groups with the congruence subgroup property.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468700)