Related papers: Groups of intermediate growth

We compute the rate of exponential growth of the free inverse monoid of rank $r$ (and hence an upper bound on the corresponding rate for all $r$-generated inverse monoids and semigroups). This turns out to be an algebraic number strictly…

This paper explores the nature of the solution sets of systems of equations in virtually abelian groups. We view this question from two angles. From a formal language perspective, we prove that the set of solutions to a system of equations…

The subgroup induction property is a property of self-similar groups acting on rooted trees introduced by Grigorchuk and Wilson in 2003 that appears to have strong implications on the structure of the groups possessing it. It was for…

We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…

We study the distribution of normal subgroups in non-torsion, regular branch multi-EGS groups and show that the congruence completions of such groups have bounded finite central width. In particular, we show that the profinite completion of…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

We construct an example of a subperiodic tree whose intermediate branching number is strictly less than the lower intermediate growth rate. This answers a question of Amir and Yang (2022) in the negative.

In this work we analyze bucket increasing tree families. We introduce two simple stochastic growth processes, generating random bucket increasing trees of size $n$, complementing the earlier result of Mahmoud and Smythe for bucket recursive…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…

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…

We study combinatorial properties of the subshift induced by the substitution that describes Lysenok's presentation of Grigorchuk's group of intermediate growth by generators and relators. This subshift has recently appeared in two…

We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a…

In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxx^R was intermediate between polynomial and exponential. We now show that the same holds for the growth of the number of…

In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…

In this paper, we establish the growth tightness of the quotient by confined subgroups in groups admitting the statistically convex-cocompact action with contracting elements. The result is sharp in the sense that the actions could not be…

The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular…

A profinite group equipped with an expansive endomorphism is equivalent to a one-sided group shift. We show that these groups have a very restricted structure. More precisely, we show that any such group can be decomposed into a finite…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…