Related papers: On the Word and Period Growth of some Groups of Tr…

We investigate the question of which growth rates are possible for the number of periodic points of a compact group automorphism. Our arguments involve a modification of Linnik's Theorem, concerning small prime numbers in arithmetic…

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.…

We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups…

We study Sushchansky p-groups. We recall the original definition and translate it into the language of automata groups. The original actions of Sushchansky groups on p-ary tree are not level-transitive and we describe their orbit trees.…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

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…

We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…

Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…

We study period growth in co-context-free groups, giving general results and looking at specific examples such as Thompson groups $T$ and $V$ and the Houghton groups $H_m$. Along the way, we give a refined upper bound on the word metric in…

We address a question of Grigorchuk by providing both a system of recursive formulas and an asymptotic result for the portrait growth of the first Grigorchuk group. The results are obtained through analysis of some features of the branching…

I describe a class of groups acting on rooted trees. The original claim was that all have intermediate word growth between polynomial and exponential. The argument constructs a functional equation on the growth formal power series, and…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

We consider the growth of an infinite family of finite groups. We are motivated by the remarkable contribution of Bass, Wolf, Milnor, Gromov, Grigorchuk on the word growth and structure of infinite groups, and the results of Black on the…

We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this…

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 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 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…

Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.

In this paper we revisit the description of all verbal subgroups of the group of automorphisms of a regular rooted tree $\mathcal{T}_d$, for $d>2$ and odd.