Search arXivSearch

arXiv · 2609.27701

Some Infinite Families of Arithmetic Symplectic Hypergeometric Groups

Abstract

Using the idea of Venkataramana's construction of infinite families of arithmetic orthogonal hypergeometric groups, we construct some of the very first examples of infinite families of arithmetic symplectic hypergeometric groups that do NOT satisfy the arithmeticity criterion of Singh and Venkataramana. For example, we show that the hypergeometric groups associated to the pairs of polynomials $(x-1)^4P_m(x^{9})$ and $(x^4+x^3+2x^2+x+1)Q_m(x^{9})$, where $P_m$ and $Q_m$ are integral polynomials of degree $2m$ such that the corresponding pair determines a Zariski dense symplectic hypergeometric group, are arithmetic in $\operatorname{Sp}(18m+4)$ for any integer $m\in\mathbb{N}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lal Bahadur Sahu. 2026-09-23. Some Infinite Families of Arithmetic Symplectic Hypergeometric Groups. https://arxiv.org/abs/2609.27701

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

KEEP EXPLORING

Related papers

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR