報(bào)告題目：Covering points with planes
報(bào)告人：Ben Lund
照片：
邀請(qǐng)人：徐川東
報(bào)告時(shí)間：2025年4月28日 (星期一) 16:00-17:30
報(bào)告地點(diǎn)：南校區(qū)行政輔樓119會(huì)議室
報(bào)告人簡(jiǎn)介：
Ben Lund, 主要研究興趣為離散幾何與組合幾何, 尤其是實(shí)空間和離散空間中的關(guān)聯(lián)性問題. 于2017年獲得美國(guó)羅格斯大學(xué)博士學(xué)位，隨后在佐治亞大學(xué)和普林斯頓大學(xué)從事博士后研究工作。目前任韓國(guó)基礎(chǔ)科學(xué)研究所高級(jí)研究員。
報(bào)告摘要：
Suppose that each proper subset S of a vector space is contained in a union of planes of specified dimensions, but S itself is not contained in any such union. How large can |S| be? Hailong Dao asked on Math Overflow whether such a bound always exists.
I will give a general upper bound on |S|, which is tight in some cases. In addition, I will discuss variants of this question for matroids and for subsets of (Z/p^kZ)^2.
This is joint work with Hailong Dao, Manik Dhar, and Izabella ?aba.
