Related papers: Quantitative growth of multi-recurrence sequences

We study growth rates for strongly continuous semigroups. We prove that a growth rate for the resolvent on imaginary lines implies a corresponding growth rate for the semigroup if either the underlying space is a Hilbert space, or the…

A fundamental challenge within the metric theory of continued fractions involves quantifying sets of real numbers, when represented using continued fractions, exhibit partial quotients that grow at specific rates. For any positive function…

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

Given a bi-Lipschitz measure-preserving homeomorphism of a compact metric measure space of finite dimension, consider the sequence formed by the Lipschitz norms of its iterations. We obtain lower bounds on the growth rate of this sequence…

We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models - non-attacking kings and read-write isolated memory. We use an assortment of techniques…

In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to…

In 1993, Robert Strichartz proved a characterization for the bounded eigenfunctions of Laplacian $\Delta=-\sum_{j=1}^d \frac{\partial^2}{\partial x_j^2} $ on $\mathbb{R}^d$: If $\left\{f_k \right\}_{k\in \mathbb{Z}}$ be a doubly infinite…

Gijswijt's sequence consists almost entirely of small positive integers. However, it is known that every positive integer eventually appears in the sequence. In this paper we determine its growth rate. Specifically, we prove that for…

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

In general the multiplicity one theorem fails for Fourier-Jacobi models over finite fields. In this paper we prove that there is an upper bound for the multiplicities of Fourier-Jacobi models which is independent of $q$. As a consequence,…

The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…

We show that the $n$-point, genus-$g$ correlation functions of topological recursion on any regular spectral curve with simple ramifications grow at most like $(2g - 2 + n)!$ as $g \rightarrow \infty$, which is the expected growth rate.…

There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions…

Let $[a_1(x), a_2(x), \ldots, a_n(x), \ldots]$ be the continued fraction expansion of an irrational number $x\in (0,1)$. We study the growth rate of the maximal product of consecutive partial quotients among the first $n$ terms, defined by…

We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources…

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

We exhibit proofs of two ergodic-theoretic results in the study of multiple recurrence using an analog of the density-increment argument of Roth and Gowers: Furstenberg's Multiple Recurrence Theorem (which implies Szemer\'edi's Theorem),…

Although known lower bounds for the growth rate $\lambda$ of polyominoes, or Klarner's constant, are already close to the empirically estimated value $4.06$, almost no conceptual progress on upper bounds has occurred since the seminal work…