相关论文: On Polynomial Extensions of van der Waerden's Theo…

We prove a canonical polynomial Van der Waerden's Theorem. More precisely, we show the following. Let $\{p_1(x),\ldots,p_k(x)\}$ be a set of polynomials such that $p_i(x)\in \mathbb{Z}[x]$ and $p_i(0)=0$, for every $i\in \{1,\ldots,k\}$.…

We present a self-contained proof of a strong version of van der Waerden's Theorem. By using translation invariant filters that are maximal with respect to inclusion, a simple inductive argument shows the existence of "piecewise…

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

We present a new short proof of Van der Waerden's Theorem about the existence of arbitrarily long monochromatic arithmetic progressions. The proof uses algebra in the compact space of ultrafilters $\beta\N$, but contrarily to the other…

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…

Recall that van der Waerden's theorem states that any finite coloring of the naturals has arbitrarily long monochromatic arithmetic sequences. We explore questions about the set of differences of those sequences.

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…

We explore recurrence properties arising from dynamical approach to combinatorial problems like the van der Waerden Theorem. We describe relations between these properties, study their consequences for dynamics, and demonstrate connections…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Every positive integer greater than a positive integer $r$ can be written as an integer that is the sum of powers of $r$. Here we use this to prove the conjecture posed by Ronald Graham, B. Rothschild and Joel Spencer back in the nineteen…

In this paper, we provide versions of Van der Waerden's theorem and Rado's theorem for finite colorings of IP-sets and k-IP-sets. Here, by an IP-set we mean a set of integers that contains all finite sums of an infinite subset of N, and we…

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

Let $P=\{p_{1},\ld,p_{r}\}\subset\Q[n_{1},\ld,n_{m}]$ be a family of polynomials such that $p_{i}(\Z^{m})\sle\Z$, $i=1,\ld,r$. We say that the family $P$ has {\it PSZ property} if for any set $E\sle\Z$ with…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girao [arXiv:2004.07766].

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

We give a purely combinatorial proof for the infinitary van der Waerden's theorem.