Equivalence of partition regularity over polynomial and integer patterns
Statement
Let denote the polynomial setting used in the paper, and let denote the positive integers. A polynomial pattern is partition regular over a domain if every finite coloring of that domain contains a monochromatic realization of . Polynomial–integer equivalence conjecture. A polynomial pattern is partition regular over if and only if it is partition regular over . The paper has already shown that partition regularity over implies partition regularity over 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.