Monochromatic sumsets

DOI10.1016/0097-3165(89)90011-3MaRDI QIDQ1116969zbMATH OpenOpenAlexWikidataFDO

Authors Joel Spencer, P. Erdős

Publication date 1989

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(89)90011-3

Mathematics Subject Classification ID

Extremal set theory (05D05) Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75)

Review text

The sumset \(P(S)\) is defined to be the set of all finite sums of distinct elements in \(S\subset\mathbb N\). The number \(F(k)\) is defined to be the least \(n\) such that if \(\{1,\ldots,n\}\) is two coloured then there is a \(k\)-set \(S\) with \(P(S)\subset \{1,\ldots,n\}\) and \(P(S)\) monochromatic. A short proof that \(F(k)>2^{ck^2/\log k}\) is given, and a conjecture related to removing the logarithmic term is posed.

Recommendations

• Sure monochromatic subset sums
• Monochromatic sums of squares
• Some new results on subset sums
• On the maximum number of integer colourings with forbidden monochromatic sums
• Monochromatic sums equal to products in N

Cites work

• Bounds for the disjoint unions theorem
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)

Cited in

(7)

• Monochromatic infinite sumsets
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• Monochromatic Hilbert cubes and arithmetic progressions
• Monovex sets
• Sure monochromatic subset sums
• Fast Monotone Summation over Disjoint Sets
• Extremal problems in hypergraph colourings

This page was built for publication: Monochromatic sumsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116969)