Ìý´¡²Ô³Ù¾±³¦³ó²¹¾±²ÔÌý°ä´Ç»å±ð²õ
Ìý´¡²Ô³Ù¾±³¦³ó²¹¾±²ÔÌý°ä´Ç»å±ð²õ
-
Ben Gunby, Rutgers University
In-Person TalkÌý
Let S be a subset of the Boolean cube 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 anticoncentration theorems.
Based on joint work with Xiaoyu He, Bhargav Narayanan, and Sam Spiro.