Zariski density and computing in arithmetic groups

DOI10.1090/mcom/3236zbMath1432.20035arXiv1611.05921OpenAlexW2555509933MaRDI QIDQ4600718

Alexander Hulpke, Alla S. Detinko, Dane L. Flannery

Publication date: 12 January 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05) Computational methods for problems pertaining to group theory (20-08)

Related Items (10)

Freeness and 𝑆-arithmeticity of rational Möbius groups ⋮ Proving infinite index for a subgroup of matrices ⋮ The strong approximation theorem and computing with linear groups ⋮ Experimenting with Symplectic Hypergeometric Monodromy Groups ⋮ An arithmetic Kontsevich-Zorich monodromy of a symmetric origami in genus 4 ⋮ A cyclotomic family of thin hypergeometric monodromy groups in \({\mathrm{Sp}}_4({\mathbb{R}})\) ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Zariski density and computing with \(S\)-integral groups ⋮ Linear groups and computation ⋮ Algorithms for Experimenting with Zariski Dense Subgroups

Uses Software

• GAP
• recog
• matgrp

Cites Work

• Generating pairs for finite index subgroups of \(\mathrm{SL}(n,\mathbb{Z})\)
• Algorithms for arithmetic groups with the congruence subgroup property.
• Algorithms for the Tits alternative and related problems.
• On the maximal subgroups of the finite classical groups
• Free subgroups of \(SL(n,Z),\) \(n>2\), generated by transvections
• Monodromy for the hypergeometric function \(_ nF_{n-1}\)
• Arithmetic groups
• Some general algorithms. I: Arithmetic groups
• On the minimal degrees of projective representations of the finite Chevalley groups
• Die Automorphismengruppen homozyklischer p-Gruppen
• Zariski dense subgroups of arithmetic groups
• Subgroup growth.
• Recognizing finite matrix groups over infinite fields.
• Computing generators of groups preserving a bilinear form over residue class rings.
• Finitely generated profinitely dense free groups in higher rank semi-simple groups
• Arithmeticity of certain symplectic hypergeometric groups
• Quantum automata and algebraic groups
• Solution of the congruence subgroup problem for \(\text{SL}_ n\) \((n\geq 3)\) and \(\text{Sp}_{2n}\) \((n\geq 2)\)
• Notes on Thin Matrix Groups
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• Approximate subgroups and super-strong approximation
• Zariski Density and Genericity
• Arithmeticity of Four Hypergeometric Monodromy Groups Associated to Calabi–Yau Threefolds: Table 1.
• Congruence Properties of Zariski-Dense Subgroups I
• Monodromy of Picard-Fuchs differential equations for Calabi-Yau threefolds
• Generating random elements of a finite group
• Small Subgroups of
• Sieve methods in group theory I: Powers in linear groups
• Thin monodromy in Sp(4)
• SOME MONODROMY GROUPS OF FINITE INDEX IN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Zariski density and computing in arithmetic groups