English
Related papers

Related papers: Balls in groups: volume, structure and growth

200 papers

Given an inverse semigroup $G_0$ of bounded type, we show, along with some other assumptions, that if the set of incompressible elements of $G_0$ is finite, then any finitely generated subgroup $G$ of the topological full group…

Group Theory · Mathematics 2025-05-30 Zheng Kuang

Let G denote a closed, connected, self adjoint, noncompact subgroup of GL(n,R), and let d_{R} denote the canonical right invariant Riemannian metric on G. For v in R^{n} let G_{v} = {g in G : g(v) = v}. We obtain algebraically defined upper…

Differential Geometry · Mathematics 2010-12-15 Patrick Eberlein

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to…

Combinatorics · Mathematics 2024-11-05 Gwenaël Joret , Clément Rambaud

We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…

Group Theory · Mathematics 2024-06-19 Saveliy V. Skresanov

Let $G= (V,E)$ be a finite graph. For $d_0>0$ we say that $G$ is $d_0$-regular, if every $v\in V$ has degree $d_0$. We say that $G$ is $(d_0, d_1)$-regular, for $0<d_1<d_0$, if $G$ is $d_0$ regular and for every $v\in V$, the subgraph…

Combinatorics · Mathematics 2023-08-28 Ehud Friedgut , Yonatan Iluz

In this note, we prove that for every integer $d\geq 2$ which is not a prime power, there exists a finite solvable group $G$ such that $d\mid |G|$, $\pi(G)=\pi(d)$ and $G$ has no subgroup of order $d$. We also introduce the CLT-degree of a…

Group Theory · Mathematics 2024-03-12 Marius Tărnăuceanu

We investigate the conjugacy growth of finitely generated linear groups. We show that finitely generated non-virtually-solvable subgroups of GL_d have uniform exponential conjugacy growth and in fact that the number of distinct polynomials…

Group Theory · Mathematics 2013-10-17 Emmanuel Breuillard , Yves de Cornulier , Alexander Lubotzky , Chen Meiri

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…

Combinatorics · Mathematics 2010-05-11 Jacob Fox , Mikhail Gromov , Vincent Lafforgue , Assaf Naor , Janos Pach

Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \leqslant (3.61)^{n}$,…

Combinatorics · Mathematics 2018-05-16 Fedor Petrov , Cosmin Pohoata

Building on work of Wilson, we show that if $G$ is a finitely generated residually soluble group whose growth function $\gamma$ satisfies $(\log \gamma(n))/ n^{1/4} \to 0$ as $n \to \infty$ then $G$ is virtually nilpotent. This shows that…

Group Theory · Mathematics 2025-11-11 Sean Eberhard , Elena Maini

Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$. Erd\H{o}s proved that when $n \geq 6d$, each nonhamiltonian graph $G$ on $n$ vertices with minimum degree…

Combinatorics · Mathematics 2017-04-07 Zoltán Füredi , Alexandr Kostochka , Ruth Luo

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

Number Theory · Mathematics 2024-12-31 Lior Bary-Soroker , Noam Goldgraber

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

Group Theory · Mathematics 2019-07-08 Eloisa Detomi , Guram Donadze , Marta Morigi , Pavel Shumyatsky

For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…

Group Theory · Mathematics 2026-04-14 Henry Bradford , Jacob Willis

We show that every non-elementary group $G$ acting properly and cocompactly by isometries on a proper geodesic Gromov hyperbolic space $X$ is growth tight. In other words, the exponential growth rate of $G$ for the geometric…

Group Theory · Mathematics 2013-01-01 Stephane Sabourau

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

Group Theory · Mathematics 2007-05-23 Oren Dinai

A set $S\subseteq V$ of vertices of a graph $G$ is a $c$-clustered set if it induces a subgraph with components of order at most $c$ each, and $\alpha_c(G)$ denotes the size of a largest $c$-clustered set. For any graph $G$ on $n$ vertices…

Combinatorics · Mathematics 2026-05-21 Kolja Knauer , Torsten Ueckerdt

By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…

Group Theory · Mathematics 2018-11-22 Harald A. Helfgott

Let $X$ be an $n$-dimensional simply connected manifold of pinched sectional curvature $-a^2 \leq K \leq -1$. There exist a positive constant $C(n,a)$ such that for any finitely generated discrete group $\Gamma$ acting on $X$, then either…

Differential Geometry · Mathematics 2008-10-20 Gérard Besson , Gilles Courtois , Sylvain Gallot

We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…

Group Theory · Mathematics 2008-10-03 Alireza Abdollahi , A. Mohammadi Hassanabadi
‹ Prev 1 3 4 5 6 7 10 Next ›