Related papers: Experimenting with symplectic hypergeometric monod…
We give a sufficient condition on a pair of (primitive) integral polynomials that the associated hypergeometric group (monodromy group of the corresponding hypergeometric differential equation) is an arithmetic subgroup of the integral…
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…
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…
We formulate the Asymptotic Length-Saturation Conjecture on the length sets of closed geodesics on hyperbolic manifolds whose fundamental groups are subarithmetic, that is, contained in an arithmetic group. We prove the first instance of…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
We obtain an infinite family of orthogonal hypergeometric groups, which are higher rank arithmetic groups. We also list cases of arithmetic hypergeometric groups whose real Zariski closure is O(2,3).
Based on a result of Singh--Venkataramana, Bajpai--Dona--Singh--Singh gave a criterion for a discrete Zariski-dense subgroup of Sp(2n,Z) to be a lattice. We adapt this criterion so that it can be used in some situations that were previously…
We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if…
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…
We compute invariants of quadratic forms associated to orthogonal hypergeometric groups of degree five. This allows us to determine some commensurabilities between these groups, as well as to say when some thin groups cannot be conjugate to…
The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…
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…
The article demonstrates the procedure how to compute the Zariski closure of an orbit by an algebraic action of finitely generated group on the affine plane. First half of the algorithm is about deciding whether given finitely generated…
Exploiting recent results on the ample cone of irreducible symplectic manifolds, we provide a different point of view for the computation of their monodromy groups. In particular, we give the final step in the computation of the monodromy…
We use algebraic arc complexes to prove a homological stability result for symplectic groups with slope 2/3 for rings with finite unitary stable rank. Symplectic groups are here interpreted as the automorphism groups of formed spaces with…
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…
We generalize our methodology for computing with Zariski dense subgroups of $\mathrm{SL}(n, \mathbb{Z})$ and $\mathrm{Sp}(n, \mathbb{Z})$, to accommodate input dense subgroups $H$ of $\mathrm{SL}(n, \mathbb{Q})$ and $\mathrm{Sp}(n,…
We study the examples mentioned in [2,Tables A & C] and establish the arithmeticity of four examples of symplectic hypergeometric groups of degree six. Following [2] we know that there are 458 inequivalent symplectic hypergeometric groups…
We discuss some examples in which symplectic monodromy (provably or conjecturally) splits off the symplectic mapping class group, hoping to illustrate different techniques and inputs to the arguments. Along the way we formulate several open…