Download as iCal file

Discrete Math

Antichain Codes

Benjamin Gunby , Rutgers University

Location:  Hill 705
Date & time: Monday, 27 March 2023 at 2:00PM - 3:00PM

Abstract: 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.