SearcharxivSearch

arXiv · 1502.07529

Arithmeticity of Some Hypergeometric Monodromy Groups in Sp(4)

Abstract

The article [14] gives a list of 51 symplectic hypergeometric monodromy groups corresponding to primitive pairs of degree four polynomials, which are products of cyclotomic polynomials, and for which, the absolute value of the leading coefficient of the difference polynomial is greater than 2. It follows from [12] and [14] that 12 of the 51 monodromy groups are arithmetic (cf. Table 1); and the thinness of 13 of the remaining 39 monodromy groups follows from [3] (cf. Table 2). In this article, we show that 15 of the remaining 26 monodromy groups are arithmetic (cf. Table 3).

Explore related subjects

Keep this discovery

BibTeXRIS

Sandip Singh. 2015-02-26. Arithmeticity of Some Hypergeometric Monodromy Groups in Sp(4). https://arxiv.org/abs/1502.07529

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