Related papers: Superstrong approximation for monodromy groups

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

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 investigate properties of closed approximate subgroups of locally compact groups, with a particular interest for approximate lattices i.e. those approximate subgroups that are discrete and have finite co-volume. We prove an approximate…

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…

We show that pairs of generators for the family Sz(q) of Suzuki groups may be selected so that the corresponding Cayley graphs are expanders. By combining this with several deep works of Kassabov, Lubotzky and Nikolov, this establishes that…

Given a number field $F$, a finite group $G$ and an indeterminate $T$, {\it{a $G$-parametric extension over $F$}} is a finite Galois extension $E/F(T)$ with Galois group $G$ and $E/F$ regular that has all the Galois extensions of $F$ with…

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

We propose a new approach to superrigidity phenomena and implement it for lattice representations and measurable cocycles with homeomorphisms of the circle as the target group. We are motivated by Ghys' theorem stating that any…

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More…

In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…

Suppose $\rho_1, \rho_2$ are two $\ell$-adic Galois representations of the absolute Galois group of a number field, such that the algebraic monodromy group of one of the representations is connected and the representations are locally…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

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 give a criterion which ensures that a group generated by Cartan involutions in the automorph group of a rational quadratic form of signature (n-1,1) is "thin", namely it is of infinite index in the latter. It is based on a graph defined…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

The complete algebraic structure of semisimple finite group algebra of a generalized strongly monomial group is provided. This work extends the work of Broche and del R{\'{\i}}o on strongly monomial groups. The theory is complimented by an…

We investigate extensions of S. Solecki's theorem on closing off finite partial isometries of metric spaces \cite{solecki1} and obtain the following exact equivalence: any action of a discrete group $\Gamma$ by isometries of a metric space…

We introduce a criterion on the presentation of finitely presented pro-$p$ groups which allows us to compute their cohomology groups and infer quotients of mild groups of cohomological dimension strictly larger than two, from (non-free)…