Related papers: Quantitative growth of linear recurrences

Let p_n denote the persistence probability that the first n iterated partial sums of integrable, zero-mean, i.i.d. random variables X_k, are negative. We show that p_n is bounded above up to universal constant by the square root of the…

Let $up(r, t) = (a_1 a_2 \dots a_r)^t$. We investigate the problem of determining the maximum possible integer $n(r, t)$ for which there exist $2t-1$ permutations $\pi_1, \pi_2, \dots, \pi_{2t-1}$ of $1, 2, \dots, n(r, t)$ such that the…

We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…

Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…

In the paper we provide measure estimates for the set of numbers whose sequence of products of continued fraction partial quotients $M_n = a_1 \ldots a_n$ has exponential growth with rate close to the one predicted by Khintchine's theorem,…

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…

For non-uniformly hyperbolic dynamical systems we consider the time series of maxima along typical orbits. Using ideas based upon quantitative recurrence time statistics we prove convergence of the maxima (under suitable normalization) to…

We establish that \[\sum_{m=1}^\infty \sum_{n=1}^\infty a_m \overline{a_n} \frac{mn}{(\max(m,n))^3} \leq \frac{4}{3}\sum_{m=1}^\infty |a_m|^2\] holds for every square-summable sequence of complex numbers $a = (a_1,a_2,\ldots)$ and that the…

The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…

We study the asymptotic expansion for the Landau constants $G_n$, \begin{equation*} \pi G_{n}\sim \ln(16N)+\gamma+\sum^{\infty}_{k=1}\frac{\alpha_k}{N^k} ~~\mbox{as} ~ n\rightarrow\infty, \end{equation*} where $N=n+1$, and $\gamma$ is…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Let m be a probability measure supported on some infinite and compact set K in the complex plane and let p_n(z) be the corresponding degree n orthonormal polynomial with positive leading coefficient. Let v_n be the normalized zero counting…

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…

Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…

We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d.…

Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that \[r_5(N)\ll \frac{N}{\exp((\log\log N)^{c})}.\] Our work…

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…