***********************************
* Princeton Discrete Math Seminar *
***********************************
Speaker: Ben Gunby (Rutgers)
Thursday 20th April, 3:00 in Fine Hall 224.
Title: Antichain codes
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.
----------------------------------
Anyone wishing to be added to or removed from the mailing list should
contact Paul Seymour (pds@math.princeton.edu)