Pith. sign in

REVIEW 1 cited by

Revisiting the nilpotent polynomial Hales-Jewett theorem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1607.05320 v3 pith:R5HDZI5O submitted 2016-07-18 math.CO

classification math.CO
keywords theoremmainnilpotenthales-jewettpolynomialrelativeansweringbergelson
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Undecidability in the Ramsey theory of polynomial equations and Hilbert's tenth problem

    math.LO 2024-12 accept novelty 8.0 of 10

    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.

Pith tools