SearcharxivSearch

arXiv · 1706.08791

On Orthogonal Hypergeometric Groups of Degree Five

Abstract

A computation shows that there are 77 (up to scalar shifts) possible pairs of integer coefficient polynomials of degree five, having roots of unity as their roots, and satisfying the conditions of Beukers and Heckman [1], so that the Zariski closures of the associated monodromy groups are either finite or the orthogonal groups of non-degenerate and non-positive quadratic forms. Following the criterion of Beukers and Heckman [1], it is easy to check that only 4 of these pairs correspond to finite monodromy groups and only 17 pairs correspond to monodromy groups, for which, the Zariski closures have real rank one. There are remaining 56 pairs, for which, the Zariski closures of the associated monodromy groups have real rank two. It follows from Venkataramana [16] that 11 of these 56 pairs correspond to arithmetic monodromy groups and the arithmeticity of 2 other cases follows from Singh [11]. In this article, we show that 23 of the remaining 43 rank two cases correspond to arithmetic groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jitendra Bajpai, Sandip Singh. 2018-11-26. On Orthogonal Hypergeometric Groups of Degree Five. https://doi.org/10.1090/tran%2F7677

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