Papers › Arithmetic Monodromy in Sp(2n)
Arithmetic Monodromy in Sp(2n)
Jitendra Bajpai, Daniele Dona, Martin Nitsche
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.
Based on a result of Singh--Venkataramana, Bajpai--Dona--Singh--Singh gave a criterion for a discrete Zariski-dense subgroup of Sp(2n,Z) to be a lattice. We adapt this criterion so that it can be used in some situations that were previously excluded. We apply the adapted method to subgroups of Sp(6,Z) and Sp(4,Z) that arise as the monodromy groups of hypergeometric differential equations. In particular, we show that out of the 40 maximally unipotent Sp(6) hypergeometric groups more than half are arithmetic, answering a question of Katz in the negative.
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