English
Related papers

Related papers: A Canonical Polynomial Van der Waerden's Theorem

200 papers

The canonical van der Waerden theorem asserts that, for sufficiently large $n$, every colouring of $[n]$ contains either a monochromatic or a rainbow arithmetic progression of length $k$ ($k$-AP, for short). In this paper, we determine the…

Combinatorics · Mathematics 2026-04-28 José D. Alvarado , Yoshiharu Kohayakawa , Patrick Morris , Guilherme O. Mota , Miquel Ortega

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

Combinatorics · Mathematics 2020-05-11 Jacob Fox , Yuval Wigderson , Yufei Zhao

In this article, we investigate polynomial generalizations of the van der Waerden theorem with a focus on largeness properties of recurrence patterns. We prove an $IP_r^\star$-strengthened version of the polynomial van der Waerden theorem,…

Combinatorics · Mathematics 2025-07-31 Sayan Goswami

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…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

Combinatorics · Mathematics 2007-05-23 Bruce Landman , Aaron Robertson

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…

Combinatorics · Mathematics 2020-01-17 Mauro Di Nasso

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…

Combinatorics · Mathematics 2025-10-23 Javad Jafari , Mohammad Akbari Tootkaboni

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

Combinatorics · Mathematics 2025-08-13 Ghadir Ghadimi , Mohammad Akbari Tootkaboni

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.

Combinatorics · Mathematics 2016-07-12 João Guerreiro , Imre Z. Ruzsa , Manuel Silva

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) :…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits

We prove a version of van der Corput's Lemma for polynomials over the p-adic numbers.

Classical Analysis and ODEs · Mathematics 2007-05-23 Keith Rogers

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…

Combinatorics · Mathematics 2026-02-03 Panna Gehér , Arsenii Sagdeev , Géza Tóth

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.…

Functional Analysis · Mathematics 2012-06-06 Heinrich-Gregor Zirnstein

Van der Waerden's theorem states that for any positive integers $k$ and $r$, there exists a smallest value $n = w(k,r)$, called the van der Waerden number, such that every $r$-coloring of $\{1,\dots,n\}$ contains a monochromatic $k$-term…

Combinatorics · Mathematics 2025-09-05 William J. Wesley

Here we show that by expressing a van der Waerden number $W(r, k)$ by its radix polynomial representation, it not only is possible to locate each proper subset on $\mathbb{R}$ in which the van der Waerden number lies, but also to show that…

Discrete Mathematics · Computer Science 2016-05-10 Robert J Betts

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…

Combinatorics · Mathematics 2007-05-23 Rudi Hirschfeld

Let $k,a\in \mathbb{N}$ and let $p_1,\cdots,p_k\in \mathbb{Q}[n]$ with zero constant term. We show that for any finite coloring of $\mathbb{Q}$, there are non-zero $x,y\in \mathbb{Q}$ such that there exists a color which contains a set of…

Combinatorics · Mathematics 2023-12-27 Rongzhong Xiao

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…

Condensed Matter · Physics 2007-05-23 Debashis Gangopadhyay , Ranjan Chaudhury

The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…

Number Theory · Mathematics 2022-12-23 Ilaria Viglino

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

Combinatorics · Mathematics 2011-06-02 Jiří Matoušek , Martin Tancer , Uli Wagner
‹ Prev 1 2 3 10 Next ›