相关论文: Lower Bounds on the Growth of Grigorchuk's Torsion…

In 1980 Rostislav Grigorchuk constructed a group $G$ of intermediate growth, and later obtained the following estimates on its growth function: $$e^{\sqrt{n}}\precsim\gamma(n)\precsim e^{n^\beta},$$ where $\beta=\log_{32}(31)\approx0.991$.…

Grigorchuk's Overgroup $\tilde{\mathcal{G}}$, is a branch group of intermediate growth. It contains the first Grigorchuk's torsion group $\mathcal{G}$ of intermediate growth constructed in 1980, but also has elements of infinite order. It's…

On torsion Grigorchuk groups we construct random walks of finite entropy and power-law tail decay with non-trivial Poisson boundary. Such random walks provide near optimal volume lower estimates for these groups. In particular, for the…

We construct an uncountable family of finitely generated groups of intermediate growth, with growth functions of new type. These functions can have large oscillations between lower and upper bounds, both of which come from a wide class of…

We show that every Grigorchuk group $G_\omega$ embeds in (the commutator subgroup of) the topological full group of a minimal subshift. In particular, the topological full group of a Cantor minimal system can have subgroups of intermediate…

Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G.…

We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…

It is shown that FC-central extensions retain sub-exponential volume growth. A large collection of FC-central extensions of the first Grigorchuk group is provided by the constructions in the works of Erschler and Kassabov-Pak. We show that…

We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…

We study the LEF growth function of a finitely generated LEF group $\Gamma$, which measures the orders of finite groups admitting local embeddings of balls in a word metric on $\Gamma$. We prove that any sufficiently smooth increasing…

We introduce a new method of proving upper estimates of growth of finitely generated groups and constructing groups of intermediate growth using graphs of their actions. These estimates are of the form $\exp(n^\alpha)$ for some $\alpha<1$,…

We introduce a technique for proving lower bounds on the essential dimension of split reductive groups. As an application, we strengthen the best previously known lower bounds for various split simple algebraic groups, most notably for the…

Recently, Ma, Shen and Xie broke the Erd\H{o}s barrier for off-diagonal Ramsey numbers $R(\ell,C\ell)$, achieving the first exponential improvement over the classical lower bound for every $C>1$ and sufficiently large $\ell$. Hunter,…

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

We give a subexponential upper bound and a superpolynomial lower bound on the growth function of the Fabrykowski-Gupta group. As a consequence, we answer negatively a question by Longobardi, Maj and Rhemtulla about characterizing groups…

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…

An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In…

The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of…

We construct $n$-node graphs on which any $O(n)$-size spanner has additive error at least $+\Omega(n^{3/17})$, improving on the previous best lower bound of $\Omega(n^{1/7})$ [Bodwin-Hoppenworth FOCS '22]. Our construction completes the…