Related papers: A strong height gap theorem for $PGL_2$

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

In this article we prove a conjecture of A. Lubotzky: let G = G_0(K), where K is a local field of characteristic p>5, G_0 is a simply connected, absolutely almost simple K-group of K-rank at least 2. We give the rate of growth of r_x(G)…

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

A theorem of Dolfi, Herzog, Kaplan, and Lev \cite[Thm.~C]{DHKL} asserts that in a finite group with trivial Fitting subgroup, the size of the soluble residual of the group is bounded from below by a certain power of the group order, and…

Let $k$ be a field of characteristic $p>0$. Denote by $W_r(k)$ the ring of truntacted Witt vectors of length $r \geq 2$, built out of $k$. In this text, we consider the following question, depending on a given profinite group $G$. $Q(G)$:…

For $\Gamma$ a cofinite Kleinian group acting on $\mathbb{H}^3$, we study the Prime Geodesic Theorem on $M=\Gamma \backslash \mathbb{H}^3$, which asks about the asymptotic behaviour of lengths of primitive closed geodesics (prime geodesics)…

We leverage recent advances in high-dimensional statistics to derive new L2 estimation upper bounds for Lasso and Group Lasso in high-dimensions. For Lasso, our bounds scale as $(k^*/n) \log(p/k^*)$---$n\times p$ is the size of the design…

Given $0\leq\alpha<1$, we define \[\begin{array}{lr} \mathbf{M}_\alpha f(u,v,t) = \sup_{ \mathbf{R} \ni (0,0,0)} {\rm vol} \{\mathbf{R}\}^{\alpha-1} \iiint_\mathbf{R}\left|f [(u,v,t)\odot(\xi,\eta,\tau)^{-1}]\right|d\xi d\eta d\tau…

Let $p$ be a prime number and $F$ a totally real number field unramified at places above $p$. Let $\bar{r}:\operatorname{Gal}(\bar F/F)\rightarrow\operatorname{GL}_2(\bar{\mathbb{F}_p})$ be a modular Galois representation which satisfies…

Let us recall the well-known Shirshov's Height Theorem. "Let A be a finitely generated algebra of degree d. Then there exists a finite set Y which is the subset of A that A has and an integer h' = h(A) such that A has Shirshov's height h'…

A group has normal rank (or weight) greater than one if no single element normally generates the group. The Wiegold problem from 1976 asks about the existence of a finitely generated perfect group of normal rank greater than one. We show…

Let $\Gamma$ be a finitely generated discrete group satisfying the rapid decay condition. We give a new proof of the higher Atiyah-Patodi-Singer theorem on a Galois $\Gamma$-coverings, thus providing an explicit formula for the higher index…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

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…

This paper is concerned with the diameter of certain word norms on S-arithmetic split Chevalley groups. Such groups are well known to be boundedly generated by root elements. We prove that word metrics given by conjugacy classes on…

The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

Levels and sublevels in arrangements -- and, dually, $k$-sets and $(\leq k)$-sets -- are fundamental notions in discrete and computational geometry and natural generalizations of convex polytopes, which correspond to the $0$-level. A…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…