Papers › Zariski density and computing with S-integral groups
Zariski density and computing with S-integral groups
A. S. Detinko, D. L. Flannery, A. Hulpke
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We generalize our methodology for computing with Zariski dense subgroups of SL(n, ℤ) and Sp(n, ℤ), to accommodate input dense subgroups H of SL(n, ℚ) and Sp(n, ℚ). A key task, backgrounded by the Strong Approximation theorem, is computing a minimal congruence overgroup of H. Once we have this overgroup, we may describe all congruence quotients of H. The case n=2 receives particular attention.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections