• Ting-Wei Chao, The Oddtown Problem Modulo a Composite Number

    Room B332 IBS (기초과학연구원)

    A family of sets in $$ is called an $\ell$-Oddtown if the sizes of all sets are not divisible by $\ell$, but the sizes of pairwise intersections are divisible by $\ell$. The problem was completely solved when $\ell$ is a prime via an elegant linear algebraic method, showing that the family has size at most

  • Yaobin Chen, Maximum in-general-position set in a random subset of $\mathbb{F}^d_q$

    Room B332 IBS (기초과학연구원)

    Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^{d},p)$ up to a polylogarithmic factor by proving the balanced supersaturation conjecture of Balogh and Luo. Our result also resolves a conjecture implicitly posed by the first author,

  • Meike Hatzel, TBA

    Room B332 IBS (기초과학연구원)