University of Cambridge > Talks.cam > Combinatorics Seminar > The number of maximal sum-free subsets of integers

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The number of maximal sum-free subsets of integers

Download to your calendar using vCal

  • UserAndrew Treglown (University of Birmingham)
  • ClockThursday 27 November 2014, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

A set S of integers is sum-free if x+y is not in S for every x,y in S. Green and independently Sapozhenko proved that there are O(2) sum-free sets in {1,...,n}, thereby resolving a conjecture of Cameron and Erdős.

Cameron and Erdős also raised the question of how many maximal sum-free sets there are in {1,...,n}, giving a lower bound of 2{n/4}. In this talk we prove that there are in fact at most 2^{(1/4+o(1))n} maximal sum-free sets in {1,...,n}. Our proof makes use of container and removal lemmas of Green as well as a result of Deshouillers, Freiman, Sós and Temkin on the structure of sum-free sets. This is joint work with József Balogh, Hong Liu and Maryam Sharifzadeh.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Newnham Terrace Seminar Room, Darwin W2.02, Cambridge Judge Business School Cambridge India Talk Series

Other talks

Morning Tea and Coffee TBC Title to be confirmed Rothschild Public Lecture: Forty years of causal inference: Report of a great-grandfather An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Morning Tea and Coffee
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity