报告人：刘鸿 教授（Institute for Basic Science, Republic of Korea）

时间：2026年4月10日 09:00-

地点：理科楼LA103

摘要：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.

邀请人：傅士硕

欢迎广大师生积极参与！