Related papers: Groups of small period growth

Let $G$ be a toral relatively hyperbolic group, and let $\varphi\in\mathrm{Aut}(G)$. We prove that, under iteration of $\varphi$, the conjugacy length $||\varphi^n(g)||$ of every element $g\in G$ grows like $n^d\lambda^n$ for some…

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble…

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…

We prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language. We also study the cohomology of the…

This paper studies the locally uniform exponential growth and product set growth for a finitely generated group $G$ acting properly on a finite product of hyperbolic spaces. Under the assumption of coarsely dense orbits or shadowing…

Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…

We study the Poisson-Furstenberg boundary of random walks on permutational wreath products. We give a sufficient condition for a group to admit a symmetric measure of finite first moment with non-trivial boundary, and show that this…

We construct finitely generated Engel branch groups, answering a question of Fern\'andez-Alcober, Noce and Tracey on the existence of such objects. In particular, the groups constructed are not nilpotent, yielding the second known class of…

Progression, the task of updating a knowledge base to reflect action effects, generally requires second-order logic. Identifying first-order special cases, by restricting either the knowledge base or action effects, has long been a central…

In this paper, the author (1) compares subnormal closures of finite sets in free groups; (2) proves that the exponential growth rate (e.g.r.), i.e., the limit of the n-th roots of g(n), where g(n) is the growth function of a subgroup H with…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the virtually free groups, i.e. finite groups, and…

We prove new vanishing results on the growth of higher torsion homologies for suitable arithmetic lattices, Artin groups and mapping class groups. The growth is understood along Farber sequences, in particular, along residual chains. For…