Related papers: Groups of small period growth
The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…
Let $F_m$ be a free group with $m$ generators and let $R$ be its normal subgroup such that $F_m/R$ projects onto $\zz$. We give a lower bound for the growth rate of the group $F_m/R'$ (where $R'$ is the derived subgroup of $R$) in terms of…
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…
In a recent paper, Henry Bradford showed that all sufficiently fast growing functions appear as the residual finiteness growth function of some group. In this paper we show that the groups there constructed are conjugacy separable and that…
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…
A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
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 study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…
Given an inverse semigroup $G_0$ of bounded type, we show, along with some other assumptions, that if the set of incompressible elements of $G_0$ is finite, then any finitely generated subgroup $G$ of the topological full group…
Let Mod(S) denote the mapping class group of a compact, orientable surface S. We prove that finitely generated subgroups of Mod(S) which are not virtually abelian have uniform exponential growth with minimal growth rate bounded below by a…
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…
We establish growth tightness for a class of groups acting geometrically on a geodesic metric space and containing a contracting element. As a consequence, any group with nontrivial Floyd boundary are proven to be growth tight with respect…
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 show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…
Every countable group that does not contain a finitely generated subgroup of exponential growth imbeds in a finitely generated group of subexponential growth. This produces in particular the first examples of groups of subexponential growth…
Full residual finiteness growth of a finitely generated group $G$ measures how efficiently word metric $n$-balls of $G$ inject into finite quotients of $G$. We initiate a study of this growth over the class of nilpotent groups. When the…
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…