Related papers: Groups of small period growth
Let F be the (Thompson's) group < x_0, x_1 | [x_0x_1^-1, x_0^-ix_1 x_0^i], i=1,2 >. We study the structure of F-limit groups. Let G_n= < y_1,..., y_m, x_0,x_1 | [x_0x_1^-1,x_0^-1x_1x_0],[x_0x_1^-1,x_0^-2x_1x_0^2], y_j^-1g_j,n(x_0,x_1),…
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. First, by strengthening results of Bou-Rabee and Seward and also…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
Let $G$ be an acylindrically hyperbolic group on a $\delta$-hyperbolic space $X$. Assume there exists $M$ such that for any finite generating set $S$ of $G$, the set $S^M$ contains a hyperbolic element on $X$. Suppose that $G$ is…
We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…
A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…
If a finitely generated torsion free group K has the property that all finitely generated subgroups S of K are either small or have growth constant bounded uniformly away from 1 then a non proper HNN extension G of K, that is a semidirect…
We prove the existence of a limit shape and give its explicit description for certain probability distribution on signatures (or highest weights for unitary groups). The distributions have representation theoretic origin-they encode…
Given a finitely generated residually finite group $G$, the residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ bounds the size of a finite group $Q$ needed to detect an element of norm at most $r$. More specifically, if…
Let $G$ be a finitely generated group with a finite generating set $S$. For $g\in G$, let $l_S(g)$ be the length of the shortest word over $S$ representing $g$. The growth series of $G$ with respect to $S$ is the series $A(t) =…
We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…
We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…
We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…
In this short article, we study the extremal behavior $F_\Gamma(n)$ of divisibility functions $D_\Gamma$ introduced by the first author for finitely generated groups $\Gamma$. We show finitely generated subgroups of $\GL(m,K)$ for an…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
In this work, we solve an open problem mentioned in Xiao (2010) and provide sharp bounds on the rate of growth of maximal moments for stationary symmetric stable random fields using structure theorem of finitely generated abelian groups and…
Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…
We provide the first example of a finitely presented, and the first example of a simple, group of non-uniform exponential growth. The example is given by Thompson's group V.