Set-polynomials and polynomial extension of the Hales-Jewett Theorem
Vitaly Bergelson, Alexander Leibman
Abstract
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 ∈ . There exists N ∈ such that for any r-coloring of the set of subsets of V=1,...,Nd x 1,...,q there exist a set a ⊂ V and a nonempty set γ⊂eq 1,...,N such that a (γd x 1,...,q) = , and the subsets a, a (γd x 1), a (γd x 2), ..., a (γd x q) are all of the same color. This ``polynomial'' Hales-Jewett theorem contains refinements of many combinatorial facts as special cases. The proof is achieved by introducing and developing the apparatus of set-polynomials (polynomials whose coefficients are finite sets) and applying the methods of topological dynamics.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.