Benjamin Gunby, Rutgers University

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.

See: https://sites.google.com/view/rutgersdmseminar