Catherine Babecki, University of Washington
-
via Zoom
Note: This talk begins with a pre-seminar (aimed at graduate students) at 3:30–4:00. The main talk starts at 4:10.
Join Zoom Meeting: https://washington.zoom.us/j/
Meeting ID: 915 4733 5974
Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that even in highly structured graphs, graphical designs are distinct from the related concepts of extremal designs, maximum stable sets in distance graphs, and \$t\$-designs on association schemes.