ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT denote the polynomial setting used in the paper, and let N\mathbb{N} denote the positive integers. A polynomial pattern F\mathcal{F} is partition regular over a domain if every finite coloring of that domain contains a monochromatic realization of F\mathcal{F}. Polynomial–integer equivalence conjecture. A polynomial pattern F\mathcal{F} is partition regular over TT if and only if it is partition regular over N\mathbb{N}. The paper has already shown that partition regularity over TT implies partition regularity over N\mathbb{N} with primitive recursive bounds, while the converse is posed as an open conjectural strengthening.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.