Related papers: Asymptotic Burnside laws

We say that a subset $X$ quasi-isometrically boundedly generates a finitely generated group $\Gamma$ if each element $\gamma$ of a finite-index subgroup of $\Gamma$ can be written as a product $\gamma = x_1 x_2 \cdots x_r$ of a bounded…

We produce new short laws in two variables valid in finite groups of Lie type. Our result improves upon results of Kozma and the second named author, and is sharp up to logarithmic factors, for all families except possibly the Suzuki…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

We study the convergence of probability measures in terms of moments by applying operators to their Bessel generating functions. We consider a general setting of applying operators such as the Dunkl operator to formal power series that are…

We construct a new large family of finitely generated groups with continuum many values of the following monotone parameters: spectral radius, critical percolation, and asymptotic entropy. We also present several open problems on other…

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…

We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of…

For every $3/4\le \delta, \beta< 1$ satisfying $\delta\leq \beta < \frac{1+\delta}{2}$ we construct a finitely generated group $\Gamma$ and a (symmetric, finitely supported) random walk $X_n$ on $\Gamma$ so that its expected distance from…

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

Let F be the (Thompson's) group < x_0, x_1 | [x_0x_1^-1, x_0^-ix_1 x_0^i], i=1,2 >. We study the structure of F-limit groups. Let G_n= < y_1,..., y_m, x_0,x_1 | [x_0x_1^-1,x_0^-1x_1x_0],[x_0x_1^-1,x_0^-2x_1x_0^2], y_j^-1g_j,n(x_0,x_1),…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…