Related papers: The strong approximation theorem and computing wit…

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…

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 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…

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 introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

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…

Take $S \subset \mathrm{SL}_2(\mathbb{Z}) \times \mathrm{SL}_2(\mathbb{Z})\times \mathrm{SL}_2(\mathbb{Z})$ be finite symmetric and assume $S$ generates a group $G$ which is Zariski-dense in $\mathrm{SL}_2 \times \mathrm{SL}_2\times…

Given a number field $K$, we show that certain $K$-integral representations of closed surface groups can be deformed to being Zariski dense while preserving many useful properties of the original representation. This generalizes a method…

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

Our main result is that the image of the quantum representation of a central extension of the mapping class group of the genus $g\geq 3$ closed orientable surface at a prime $p\geq 5$ is a Zariski dense discrete subgroup of some higher rank…

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

We prove that generic Hitchin representations are strongly dense: every pair of non commuting elements in their image generate a Zariski-dense subgroup of SL_n(R). The proof uses a theorem of Rapinchuk, Benyash-Krivetz and Chernousov, to…

Let $S\subset \text{SL}_2(\mathbb Z)\times \text{SL}_2(\mathbb Z)$ or $\text{SL}_2(\mathbb Z)\ltimes \mathbb Z^2$ be finite symmetric and assume $S$ generates a group $G$ which is a Zariski-dense subgroup $\text{SL}_2(\mathbb Z)\times…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

In this article, we establish results concerning the cohomology of Zariski dense subgroups of solvable linear algebraic groups. We show that for an irreducible solvable $\mathbb{Q}$-defined linear algebraic group $\mathbf{G}$, there exists…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…