Pith. sign in

REVIEW 1 cited by

Monochromatic products and sums in $2$-colorings of $\mathbb{N}$

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 2205.12921 v1 pith:GLDQW3EF submitted 2022-05-25 math.CO

classification math.CO
keywords monochromaticmathbbcoloringformproductssetssumstheorem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along the way we prove a monochromatic products of sums theorem that extends Hindman's theorem and a colorful variant of this result that holds in any 'balanced' coloring.

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