Related papers: Algorithms for experimenting with Zariski dense ma…

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…

Let $\Gamma$ be a Zariski-dense subgroup of a reductive group $\mathbf{G}$ defined over a field $F$. Given a finite collection of finite subgroups $H_i$ ($i \in I$) of $\mathbf{G}(F)$ avoiding the center, we establish a criterion to ensure…

We give necessary and sufficient conditions for a linear reflection group in the sense of Vinberg to be Zariski-dense in the ambient projective general linear group. As an application, we show that every irreducible right-angled Coxeter…

Let $G$ be a connected, absolutely almost simple, algebraic group defined over a finitely generated, infinite field $K$, and let $\Gamma$ be a Zariski dense subgroup of $G(K)$. We show, apart from some few exceptions, that the…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

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…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We prove the Zariski dense orbit conjecture in positive characteristic for endomorphisms of $\mathbb{G}_a^N$ defined over $\overline{\mathbb{F}_p}$.

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

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

We develop the affine sieve in the context of orbits of congruence subgroups of semi-simple groups acting linearly on affine space. In particular we give effective bounds for the saturation numbers for points on such orbits at which the…

We investigate for which linear-algebraic groups (over the complex numbers or any local field) there exists subgroups which are dense in the Zariski topology, but discrete in the Hausdorff topology. For instance, such subgroups exist for…

Surveying some of the recent developments on approximate subgroups and super-strong approximation for thin groups, we describe the Bourgain-Gamburd method for establishing spectral gaps for finite groups and the proof of the classification…

We prove in a large number of cases, that a Zariski dense discrete subgroup of a simple real algebraic group $G$ which contains a higher rank lattice is a lattice in the group $G$. For example, we show that a Zariski dense subgroup of…

Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…

We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}^d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

We construct generating pairs of simple Lie algebras in characteristic zero. We apply this construction to exhibit infinite series of 2-generator Zariski dense subgroups that are free of rank 2 of the simple algebraic groups SL(n, C), Sp(n,…