SearcharxivSearch

arXiv · 2003.10191

Symplectic Hypergeometric Groups of Degree Six

Abstract

Our computations show that there is a total of $40$ pairs of degree six coprime polynomials $f,g$ where $f(x)=(x-1)^6$, $g$ is a product of cyclotomic polynomials, $g(0)=1$ and $f,g$ form a primitive pair. The aim of this article is to determine whether the corresponding $40$ symplectic hypergeometric groups with a maximally unipotent monodromy follow the same dichotomy between arithmeticity and thinness that holds for the $14$ symplectic hypergeometric groups corresponding to the pairs of degree four polynomials $f,g$ where $f(x)=(x-1)^4$ and $g$ is as described above. As a result we prove that at least $18$ of these $40$ groups are arithmetic in $\mathrm{Sp}(6)$. In addition, we extend our search to all degree six symplectic hypergeometric groups. We find that there is a total of $458$ pairs of polynomials (up to scalar shifts) corresponding to such groups. For $211$ of them, the absolute values of the leading coefficients of the difference polynomials $f-g$ are at most $2$ and the arithmeticity of the corresponding groups follows from Singh and Venkataramana, while the arithmeticity of one more hypergeometric group follows from Detinko, Flannery and Hulpke. In this article, we show the arithmeticity of $160$ of the remaining $246$ hypergeometric groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Jitendra Bajpai, Daniele Dona, Sandip Singh, Shashank Vikram Singh. 2020-03-23. Symplectic Hypergeometric Groups of Degree Six. https://doi.org/10.1016/j.jalgebra.2021.02.010

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