Partition regularity of polynomial equations over Z is undecidable if Hilbert's tenth problem over Q is undecidable, and over function fields it is unconditionally Pi_2^0-complete.
Revisiting the nilpotent polynomial Hales-Jewett theorem
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Answering a question posed by Bergelson and Leibman in [6], we establish a nilpotent version of the polynomial Hales-Jewett theorem that contains the main theorem in [6] as a special case. Important to the formulation and the proof of our main theorem is the notion of a relative syndetic set (relative with respect to a closed non-empty subsets of $\beta\mathbf{G}$) [25]. As a corollary of our main theorem we prove an extension of the restricted van der Waerden Theorem to nilpotent groups, which involves nilprogressions.
citation-role summary
citation-polarity summary
fields
math.LO 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Undecidability in the Ramsey theory of polynomial equations and Hilbert's tenth problem
Partition regularity of polynomial equations over Z is undecidable if Hilbert's tenth problem over Q is undecidable, and over function fields it is unconditionally Pi_2^0-complete.