SearcharxivSearch

arXiv · 2112.12111

Thin monodromy in $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$

Abstract

We explore the thinness of hypergeometric groups of type $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$ by applying a new approach of computer-assisted ping pong. We prove the thinness of $17$ hypergeometric groups with maximally unipotent monodromy in $\mathrm{Sp}(6)$, completing the classification of all $40$ such groups into arithmetic and thin cases. In addition, we establish the thinness of further $46$ hypergeometric groups in $\mathrm{Sp}(6)$, and of $3$ hypergeometric groups in $\mathrm{Sp}(4)$, completing the classification of all $\mathrm{Sp}(4)$ hypergeometric groups. To the best of our knowledge, this article produces the first $63$ examples in the cyclotomic family of Zariski dense non-arithmetic hypergeometric monodromy groups of real rank three.

Explore related subjects

Keep this discovery

BibTeXRIS

Jitendra Bajpai, Daniele Dona, Martin Nitsche. 2021-12-22. Thin monodromy in $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$. https://doi.org/10.1016/j.jalgebra.2024.09.022

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR