Related papers: Growth of groups with linear Schreier graphs
We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…
In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…
Every self-similar group acts on the space $X^\omega$ of infinite words over some alphabet $X$. We study the Schreier graphs $\Gamma_w$ for $w\in X^\omega$ of the action of self-similar groups generated by bounded automata on the space…
We provide the first example of a finitely presented, and the first example of a simple, group of non-uniform exponential growth. The example is given by Thompson's group V.
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 propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to…
In the present paper we study two sequences of real numbers associated to a symplectic diffeomorphism: the uniform norm of the differential of its n-th iteration and the word length of its n-th iteration. In the latter case we assume that…
We calculate asymptotic estimates for the conjugacy growth function of finitely generated class 2 nilpotent groups whose derived subgroup is infinite cyclic, including the so-called higher Heisenberg groups. We prove that these asymptotics…
We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…
We give a method for effectively generating generalised loxodromics in subgroups of graph products, using positive words. This has several consequences for the growth of subsets of these groups. In particular, we show that graph products of…
In this paper, we study the growth of confined subgroups through boundary actions of groups with contracting elements. We establish that the growth rate of a confined subgroup is strictly greater than half of the ambient growth rate in…
Generalizing classical extension theory, we solve a Schreier-type extension problem for polygroups by groups. As a consequence, we obtain a method for computing a presentation for a group from its action on a set. The usefulness of this…
The Grigorchuk and Gupta-Sidki groups are natural examples of self-similar finitely generated periodic groups. The author constructed their analogue in case of restricted Lie algebras of characteristic 2, Shestakov and Zelmanov extended…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants,…
Let $G$ be a free group of rank $n$ and $H\subset G$ its subgroup of finite index. Then $H$ is also a free group and the rank $m$ of $H$ is determined by Schreier's formula $m-1=(n-1)\cdot|G:H|.$ Any subalgebra of a free Lie algebra is also…