报告题目：Blocking sets

报 告 人：上官冲 教授（山东大学）

报告时间：2026年5月7日（星期四）10:00—11:00

报告地点：见好就收才是赢太阳9728111-A      

校内联系人：陈曦 副教授         联系方式：84708351-8504

报告摘要：Blocking sets are classical objects in finite geometry that capture the minimal structure required to intersect all subspaces of a given codimension. An affine s-blocking set is a subset of F_q^k that intersects every affine subspace of codimension s. In the projective setting, a strong s-blocking set is a subset of PG(k−1,q) that meets every projective subspace of codimension s in a spanning set. Blocking sets are closely related to several well-studied notions in discrete mathematics, theoretical computer science, and coding theory. In this talk, we will explain some of these connections and discuss problems and results concerning bounds and explicit constructions of blocking sets.

报告人简介：上官冲，山东大学数学与交叉科学研究中心教授、博导，主要从事组合图论与信息科学交叉领域的研究。主持基金委青年、面上、海外优青项目，获国际组合数学及应用协会2020年Kirkman 奖。论文发表于Peking Math. J.、J. Combin. Theory Ser. A、J. Combin. Theory Ser. B、STOC、FOCS、SIAM J. Comput.、IEEE Trans. Inform. Theory等相关领域权威刊物。