Research- Counting sum-free sets

Research

All

Counting sum-free sets

Speaker: Hong Liu（Institute for Basic Science, Daejeon, Korea）
Time: Mar 24, 2026, 10:00-11:00
Location: M1001, College of Science Building，Tencent Meeting ID: 689 341 002

Abstract

Enumeration problems occupy a central place in Extremal Combinatorics. In this talk, I will survey classical results of this sort and go over some recent developments. In particular, I will discuss the problem of estimating the number of maximal sum-free sets in both integers {1,..,n} and finite abelian groups. Here, a set is called sum-free if it does not contain any solution to the equation x+y=z.