Speaker
Xiaoyu He (Princeton)
Date
Thu, May 30 2024, 3:00pm
Location
384H
Let S be a subset of the Boolean hypercube {0,1}^n that is both an antichain and a distance-r code. How large can S be? I will discuss the solution to this problem and its connections with combinatorial proofs of results in Littlewood-Offord theory.
Based on joint work with Benjamin Gunby, Bhargav Narayanan, and Sam Spiro.