Algorithms for arithmetic groups with the congruence subgroup property.

DOI10.1016/J.JALGEBRA.2014.08.027zbMATH Open1319.20040arXiv1906.10423OpenAlexW2143030879MaRDI QIDQ468700FDOQ468700

Authors: A. S. Detinko, D. L. Flannery, A. Hulpke 

Publication date: 7 November 2014

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

Abstract: We develop practical techniques to compute with arithmetic groups $HleqmathrmSL(n,mathbbQ)$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$, analyzing the subnormal structure of $H$, and the orbit-stabilizer problem for $H$. Effective computation with subgroups of $mathrmGL(n,mathbb{Z}_m)$ is vital to this work. All algorithms have been implemented in GAP.

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

Recommendations

• Zariski density and computing in arithmetic groups
• Integrality and arithmeticity of solvable linear groups.
• Algorithms for matrix groups and the Tits alternative
• Computing with subgroups of the modular group.
• scientific article; zbMATH DE number 1004928

zbMATH Keywords

algorithmssubgroups of finite indexarithmetic groupscongruence subgroupscomputational group theoryfinitely generated matrix groupsGAPTodd-Coxeter algorithm

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 global fields and their integers (20G30) Structure of modular groups and generalizations; arithmetic groups (11F06) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05)

Cites Work

• 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)\)
• Title not available (Why is that?)
• Sous-groupes d'indice fini dans $SL\left( {n,Z} \right)$
• Introduction to Algebraic K-Theory. (AM-72)
• Some general algorithms. I: Arithmetic groups
• Title not available (Why is that?)
• Algorithms for the Tits alternative and related problems.
• Subgroup growth.
• Generations for arithmetic groups.
• Notes on thin matrix groups
• Title not available (Why is that?)
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• Small subgroups of SL\((3,\mathbb Z)\)
• Title not available (Why is that?)
• The linear homogeneous group. III
• Title not available (Why is that?)
• Arithmetic groups
• Recognizing finite matrix groups over infinite fields.
• Algorithms for linear groups of finite rank.
• Computing conjugacy classes of elements in matrix groups.
• A data structure for a uniform approach to computations with finite groups
• The congruence subgroup problem.
• Computing with matrix groups over infinite fields.
• The Orbit-Stabilizer Problem for Linear Groups
• Decision problems concerning S-arithmetic groups
• Title not available (Why is that?)
• Generators For All Principal Congruence Subgroups of SL(n, Z) with n ≥3
• Integrality and arithmeticity of solvable linear groups.
• Title not available (Why is that?)

Cited In (9)

• 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

Uses Software

• GAP

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)