Related papers: Growth degree classification for finitely generate…

We develop the theory of the additive dimension ${\rm dim} (A)$, i.e. the size of a maximal dissociated subset of a set $A$. It was shown that the additive dimension is closely connected with the growth of higher sumsets $nA$ of our set…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

Let $\Gamma$ be a finitely generated group and $N$ be a normal subgroup of $\Gamma$. The fiber product of $\Gamma$ with respect to $N$ is the subgroup $\Gamma \times_N \Gamma=\{(\gamma, \gamma w): \gamma \in \Gamma, w \in N\}$ of the direct…

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…

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Recent work on mutation-selection models has revealed that, under specific assumptions on the fitness function and the mutation rates, asymptotic estimates for the leading eigenvalue of the mutation-reproduction matrix may be obtained…

Consider a critical Galton-Watson process Z={Z_n: n=0,1,...} of index 1+alpha, alpha in (0,1]. Let S_k(j) denote the sum of the Z_n with n in the window [k,...,k+j), and M_m(j) the maximum of the S_k with k moving in [0,m-j]. We describe…

Julius Whiston calculated the maximum size of an irredundant generating set for $S_n$ and $A_n$ by examination of maximal subgroups. Using analogous considerations, we will compute upper bounds to this value for the first two Mathieu…

We adapt Safin's result on powers of sets in free groups to obtain Helfgott type growth in free products: if A is any finite subset of a free product of two arbitrary groups then either A is conjugate into one of the factors, or the size of…

The height gap theorem states that the finite subsets $F$ of matrices generating non-virtually solvable groups have normalized height $\widehat{h}(F)$ bounded below by a constant. It was first proved by Breuillard and another proof was…

We prove that the degrees of the iterates ${\rm deg}(f^n)$ of a birational map satisfy $\liminf({\rm deg}(f^n))<+\infty$ if and only if the sequence ${\rm deg}(f^n)$ is bounded, and that the growth of ${\rm deg}(f^n)$ can not be arbitrarily…

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…

Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…

We study rates of growth of $\|AT(t)\|$ as $t \downarrow 0$ for an immediately differentiable $C_0$-semigroup $(T(t))_{t \geq 0}$ with generator $A$. We assume that the resolvent of the semigroup generator decays on the imaginary axis at…

In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any…

Let G denote a closed, connected, self adjoint, noncompact subgroup of GL(n,R), and let d_{R} denote the canonical right invariant Riemannian metric on G. For v in R^{n} let G_{v} = {g in G : g(v) = v}. We obtain algebraically defined upper…

The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…

In this paper, we show that a locally graded group with a finite number m of non-(nilpotent of class at most n) subgroups is (soluble of class at most [log2(n)] + m + 3)-by-(finite of order $\le$ m!). Also we show that the derived length of…