Related papers: On the growth of multi-recurrences
We obtain upper bounds on the cardinality of Hilbert cubes in finite fields, which avoid large product sets and reciprocals of sum sets. In particular, our results replace recent estimates of N. Hegyv\'ari and P. P. Pach (2020), which…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
Residual finiteness growth gives an invariant that indicates how well-approximated a finitely generated group is by its finite quotients. We briefly survey the state of the subject. We then improve on the best known upper and lower bounds…
We study residually transcendental extensions of a valuation $v$ on a field $E$ to function fields of hyperelliptic curves over $E$. We show that $v$ has at most finitely many extensions to the function field of a hyperelliptic curve over…
In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…
About 35 years ago Dennis Sullivan proved a precompactness property ("complex bounds") for infinitely renormalizable real quadratic polynomials with bounded combinatorics. We present a simple "soft" proof of this remarkable result.
Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the…
In the 1960s, the technique of using cluster expansion bounds in order to achieve bounds on the virial expansion was developed by Lebowitz and Penrose (1964) and Ruelle (1969). This technique is generalised to more recent cluster expansion…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…
We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…
The present note is devoted to an amendment to a recent paper of Ellenberg, Lawrence and Venkatesh. Roughly speaking, the main result here states the subpolynomial growth of the number of integral points with bounded height of a variety…
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).
We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…
We continue and generalise our earlier investigations of the number of squares in binary recurrence sequences. Here we consider sequences, $\left( y_{k} \right)_{k=-\infty}^{\infty}$, arising from the solutions of generalised negative Pell…