Richard P. Stanley Seminar in Combinatorics: Antichain Codes
SEMINARS, HARVARD-MIT COMBINATORICS
May 17, 2023 3:00 pm - 4:00 pm
MIT, Room 2-139
Benjamin Gunby - Rutgers University
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.
For more info, see https://math.mit.edu/combin/