Monochromatic Sums and Products of Polynomials
Discrete analysis (2024)
Cet article a éte moissonné depuis la source Scholastica
We show that the pattern $\{x,x+y,xy\}$ is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive bounds. This provides a new proof for the partition regularity of $\{x,x+y,xy\}$ over $\mathbb{N}$, which gives the first primitive recursive bound.
@article{DAS_2024_a16,
author = {Ryan Alweiss},
title = {Monochromatic {Sums} and {Products} of {Polynomials}},
journal = {Discrete analysis},
year = {2024},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DAS_2024_a16/}
}
Ryan Alweiss. Monochromatic Sums and Products of Polynomials. Discrete analysis (2024). http://geodesic.mathdoc.fr/item/DAS_2024_a16/