Related papers: On the growth of multi-recurrences
Reconstructing a parsimonious phylogenetic network that displays multiple phylogenetic trees is an important problem in theory of phylogenetics, where the complexity of the inferred networks is measured by reticulation numbers. The…
We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
In our previous work, we defined a prime walk (PW) on a square grid and presented several intriguing numerical results. Here, we demonstrate the main conjecture presented there, namely, that the area covered by the prime walk is unbounded.…
Shalom and Tao showed that a polynomial upper bound on the size of a single, large enough ball in a Cayley graph implies that the underlying group has a nilpotent subgroup with index and degree of polynomial growth both bounded effectively.…
We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.
This paper contributes to the solution of the Poincare problem, which is to bound the degree of a (generalized algebraic) leaf of a (singular algebraic) foliation of the complex projective plane. The first theorem gives a new sort of bound,…
Sharir and Welzl [1] derived a bound on crossing-free matchings primarily based on solving a recurrence based on the size of the matchings. We show that the recurrence given in Lemma 2.3 in Sharir and Welzl can be improve to…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
We give effective bounds on the generation of pushforwards of log-pluricanonical bundles twisted by ample line bundles. This gives a partial answer to a conjecture proposed by Popa and Schnell. We prove two types of statements: first, more…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We build, for real quadratic fields, infinitely many periodic continuous fractions uniformly bounded, with a seemingly better bound than the known ones. We do that using continuous fraction expansions with the same shape as those of real…
In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…
Klarner and Rivest showed that the growth of the number of polyominoes, also known as Klarner's constant, is at most $2+2\sqrt{2}<4.83$ by viewing polyominoes as a sequence of twigs with appropriate weights given to each twig and studying…