Skip to main content

Sumset Configurations in Sets of Positive Density

  • Chapter
  • First Online:
Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 2239))

  • 1071 Accesses

Abstract

In this section, we discuss a conjecture of Erdős, which states that a set of natural numbers of positive lower density contains the sum of two infinite sets. We begin with the history of the conjecture and discuss its nonstandard reformulation. We then present a proof of the conjecture in the “high density” case, which follows from a “1-shift” version of the conjecture in the general case. We conclude with a discussion of how these techniques yield a weak density version of Folkman’s theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    It still seems to be open whether or not a set of positive density (of any kind) must contain a translate of \(\operatorname {PS}(B)\) for some infinite B.

  2. 2.

    Indeed, if A is piecewise syndetic, then A + [0, k] is thick for some \(k\in \mathbb {N}\). Thick sets are easily seen to contain FS-sets, whence, by the Strong version of Hindman’s theorem (Corollary 8.7), A + i contains an FS-set for some i ∈ [0, k]. It follows immediately that A has the sumset property.

  3. 3.

    Notice that at this point we have another proof of Nathanson’s Theorem 13.4: if we set B := {d n, d n+1, …} and C := {l 1, …, l n}, then B + C ⊆ A.

References

  1. M. Di Nasso, I. Goldbring, R. Jin, S. Leth, M. Lupini, K. Mahlburg, On a sumset conjecture of Erdös. Can. J. Math. 67(4), 795–809 (2015)

    Article  Google Scholar 

  2. P. Erdős, A survey of problems in combinatorial number theory. Ann. Discrete Math. 6, 89–115 (1980)

    Google Scholar 

  3. P. Erdős, R.L. Graham, Old and New Problems and Results in Combinatorial Number Theory. Monographies de L’Enseignement Mathématique, vol. 28 (Université de Genève, L’Enseignement Mathématique, Geneva, 1980)

    Google Scholar 

  4. J. Moreira, F.K. Richter, D. Robertson, A proof of the Erdős sumset conjecture. arXiv:1803.00498 (2018)

    Google Scholar 

  5. M.B. Nathanson, Sumsets contained in infinite sets of integers. J. Comb. Theory Ser. A 28(2), 150–155 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Nasso, M.D., Goldbring, I., Lupini, M. (2019). Sumset Configurations in Sets of Positive Density. In: Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory. Lecture Notes in Mathematics, vol 2239. Springer, Cham. https://doi.org/10.1007/978-3-030-17956-4_13

Download citation

Publish with us

Policies and ethics