Related papers: The minimal growth of a $k$-regular sequence
We study the asymptotic growth of coefficients of Mahler power series with algebraic coefficients, as measured by their logarithmic Weil height. We show that there are five different growth behaviors, all of which being reached. Thus, there…
We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application…
Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…
Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…
Let $f_n(k)$ be the number of subrings of index $k$ in $\mathbb{Z}^n$. We show that results of Brakenhoff imply a lower bound for the asymptotic growth of subrings in $\mathbb{Z}^n$, improving upon lower bounds given by Kaplan, Marcinek,…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
For a periodic function $f$ with bounded variation and integral zero on its period interval, we show that $\sum_{k=1}^\infty c_k^2 (\log\log k)^\gamma <\infty$, $\gamma>4$ implies the almost everywhere convergence of $\sum_{k=1}^\infty c_k…
In this paper we shall consider the growth at infinity of a sequence $(P_n)$ of entire functions of bounded orders. Our results extend the results in \cite{trong-tuyen2} for the growth of entire functions of genus zero. Given a sequence of…
It is shown that the order and the lower order of growth are equal for all non-trivial solutions of $f^{(k)}+A f=0$ if and only if the coefficient $A$ is analytic in the unit disc and $\log^+ M(r,A)/\log(1-r)$ tends to a finite limit as…
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…
When $k$ is a constant at least $3$, a sequence $S$ of positive integers is called $k$-GP-free if it contains no nontrivial $k$-term geometric progressions. Beiglb\"ok, Bergelson, Hindman and Strauss first studied the existence of a $…
Given an orientation-preserving diffeomorphism of the interval [0;1], consider the uniform norm of the differential of its n-th iteration. We get a function of n called the growth sequence. Its asymptotic behaviour is an interesting…
For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…
The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…
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…
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…
For a sequence $W$ we count the number $O_W(n)$ of minimal forbidden words no longer then $n$ and prove that $$\overline{\lim_{n \to \infty}} \frac{O_W(n)}{\log_3n} \geq 1.$$
Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…
We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.
Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. Denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…