Related papers: The growth of torus link groups

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

We study growth and complexity of \'etale groupoids in relation to growth of their convolution algebras. As an application, we construct simple finitely generated algebras of arbitrary Gelfand-Kirillov dimension $\ge 2$ and simple finitely…

We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

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…

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

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…

For positive integers $n\ge s> r$, the Tur\'an function $T(n,s,r)$ is the smallest size of an r-graph with n vertices such that every set of s vertices contains at least one edge. Also, define the Tur\'an density $t(s,r)$ as the limit of…

For every $\alpha \leq \beta$ in a left neighborhood $[\alpha_0,1]$ of 1, a group $G(\alpha,\beta)$ is constructed, the growth function of which satisfies $\limsup \frac{\log \log b_{G(\alpha,\beta)}(r)}{\log r}=\alpha$ and $\liminf…

We calculate asymptotic estimates for the conjugacy growth function of finitely generated class 2 nilpotent groups whose derived subgroup is infinite cyclic, including the so-called higher Heisenberg groups. We prove that these asymptotics…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

Using integral methods we recover and generalize some results by F\'{e}lix, Halperin and Thomas on the growth of the rational homology groups of free loop spaces, and obtain a new family of spaces whose $p$-torsion in homotopy groups grows…

We give a method for effectively generating generalised loxodromics in subgroups of graph products, using positive words. This has several consequences for the growth of subsets of these groups. In particular, we show that graph products of…

In [B] Bowen defined the growth rate of an endomorphism of a finitely generated group and related it to the entropy of a map $f:M \mapsto M$ on a compact manifold. In this note we study the purely group theoretic aspects of the growth rate…

Let $r$ and $q$ be positive integers and $n=qr+1.$ Let $G = SL(n, \mathbb{C})$ and $T$ be a maximal torus of $G.$ Let $P^{\alpha_r}$ be the maximal parabolic subgroup of $G$ corresponding to the simple root $\alpha_r.$ Let $\omega_r$ be the…

For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…

We investigate how the behavior of the function d_A(n) that gives the size of a least size generating set for A^n, influences the structure of a finite solvable algebra A.

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…

We prove that a finitely generated soluble residually finite group has polynomial index growth if and only if it is a minimax group. We also show that if a finitely generated group with PIG is residually finite-soluble then it is a linear…

For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…