Combinatorics seminar -- Counting independent sets in Z_3^n

Time and Location:

Nov. 19, 2026 at 2PM; Warren Weaver Hall, Room 1314

Speaker:

Robert Krueger, Carnegie Mellon University

Abstract:

One of the first uses of Sapozhenko's "graph container method" was to count independent sets in the hypercube, or equivalently, distance 2 binary codes; in fact, he gave a precise description of the structure of a typical independent set. We generalize this to distance 2 *ternary* codes, that is, independent sets in Z_3^n. I will discuss the proof, which involves both a novel isoperimetric statement and a novel graph container argument.