|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Counting problems in additive combinatorics
If you have a question about this talk, please contact Andrew Thomason.
In 1990 and 1999, Cameron and Erdos proposed several problems in additive combi natorics. They asked about the number of sum-free sets, number of maximal sum-free sets, number of Sidon sets in [n]. Additionally they asked the number of sets in [n] containing no k-term arithmetic progression. In the talk we survey the recent progress on these questions. One of the major tool in the proof is the recently developed container lemma. The talk is based on joint results with Hong Liu, Robert Morris, Wojciech Samotij, Maryam Sharifzadeh and and Andrew Treglown.
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 listsFrontiers in Artificial Intelligence Series Cambridge University Biological Society Islamic Society
Other talksDe-identified electronic mental health records for research and recruitment Myelination in development and learning CT assessment of block recession trochleoplasty and partial patellectomy in cats Sustainability and health – what are the issues History of Migration Law Recent advances in the molecular diagnosis of canine and feline lymphoma