English
Related papers

Related papers: Growth in linear algebraic groups and permutation …

200 papers

Suppose $G$ is a free product $G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups $A_i$ is torsion-free and $F_N$ is a free group of rank $N$. Let $\mathcal{O}$ be the deformation space associated to this free product…

Group Theory · Mathematics 2025-05-02 Matt Clay , Caglar Uyanik

We develop a new criterion to tell if a group $G$ has the maximal gap of $1/2$ in stable commutator length (scl). For amalgamated free products $G = A \star_C B$ we show that every element $g$ in the commutator subgroup of $G$ which does…

Geometric Topology · Mathematics 2018-09-17 Nicolaus Heuer

We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which…

Combinatorics · Mathematics 2020-02-27 Daniel El-Baz , Carlo Pagano

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

Combinatorics · Mathematics 2023-09-19 Jason Bell , Haggai Liu , Marni Mishna

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

Group Theory · Mathematics 2014-09-16 T. R. Riley , A. W. Sale

We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors. Inspired by the classical theory of…

Group Theory · Mathematics 2025-12-30 Sahana Balasubramanya , Talia Fernos

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Group Theory · Mathematics 2024-03-19 Romain Tessera , Matthew Tointon

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…

Group Theory · Mathematics 2021-06-28 Luca Sabatini

We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower…

Group Theory · Mathematics 2014-02-26 Marc Lackenby

The deep theory of approximate subgroups establishes 3-step product growth for subsets of finite simple groups $G$ of Lie type of bounded rank. In this paper we obtain 2-step growth results for representations of such groups $G$ (including…

Representation Theory · Mathematics 2021-04-26 Michael Larsen , Aner Shalev , Pham Huu Tiep

We study product set growth in groups with acylindrical actions on quasi-trees and, more generally, hyperbolic spaces. As a consequence, we show that for every surface $S$ of finite type, there exist $\alpha,\beta>0$ such that for any…

Group Theory · Mathematics 2025-09-24 Alice Kerr

Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…

Group Theory · Mathematics 2019-01-18 Motiejus Valiunas

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

Combinatorics · Mathematics 2021-02-18 Zdeněk Dvořák , Tony Huynh , Gwenaël Joret , Chun-Hung Liu , David R. Wood

We study the representations of non-commutative universal lattices and use them to compute lower bounds for the \TauC for the commutative universal lattices $G_{d,k}= \SL_d(\Z[x_1,...,x_k])$ with respect to several generating sets. As an…

Group Theory · Mathematics 2007-05-23 Martin Kassabov

We prove strong and explicit diameter bounds for finite simple Lie algebras, which parallel Babai's conjecture for finite simple groups. Specifically, we show that any nonabelian finite simple Lie algebra $\mathfrak{g}$ over $\mathbf{F}_p$…

Rings and Algebras · Mathematics 2025-09-30 Marco Barbieri , Urban Jezernik , Matevž Miščič

In the present paper, we develop geometric analytic techniques on Cayley graphs of finitely generated abelian groups to study the polynomial growth harmonic functions. We develop a geometric analytic proof of the classical Heilbronn theorem…

Metric Geometry · Mathematics 2013-05-02 Bobo Hua , Juergen Jost , Xianqing Li-Jost

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…

Group Theory · Mathematics 2019-12-02 Martin W. Liebeck , Aner Shalev , Pham Huu Tiep

We introduce a method for analyzing the convex hull of a set in non-positively curved piecewise Euclidean polygonal complexes and we apply this method to prove that, with the usual action of Fm x Zn on the metric product of the Cayley graph…

Group Theory · Mathematics 2025-12-08 Jordan A. Sahattchieve

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein