相关论文: Numerical upper bounds on growth of automata group…

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 define the class of groups of bounded type from tile inflations. These tile inflations also determine some automata describing the groups. In the case when the automata are stationary, we show that if the set of incompressible elements…

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

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.

We give two new examples of groups of intermediate growth, by a method that was first used by Bux and P\'erez. Our examples are the groups generated by the automata with the kneading sequences 11(0) and 0(011). By results of Nekrashevych,…

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…

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…

We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.

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 investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group…

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

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

The maximal normal subgroup growth type of a finitely generated group is $n^{\log n}$. Very little is known about groups with this type of growth. In particular, the following is a long standing problem: Let $\Gamma$ be a group and $\Delta$…

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

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…

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.

The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…