COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## The number of maximal sum-free subsets of integersAdd to your list(s) Download to your calendar using vCal - Andrew Treglown (University of Birmingham)
- Thursday 27 November 2014, 14:30-15:30
- MR12.
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 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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsZoology Department - Tea Talks Science non-Fiction & the Bottom Billion: Evolving Frameworks for a fairer Future Cambridge Network events## Other talksSeminar – Why do policymakers seem to ignore your evidence? Aromatic foldamers: mastering molecular shape Britain, Jamaica and the modern global financial order, 1800-50 How archaeologists resolve the inductive risk argument How to lead a happy life in the midst of uncertainty The microenvironment in the myeloid malignancies |