Adinkras, Codes, and Cubes
MATH TABLE
When: September 16, 2026
5:00 pm - 6:00 pm
Where: Science Center 507
Address:
1 Oxford Street, Cambridge, MA 02138, United States
Speaker: Vincent Costa - Harvard
Adinkras are edge-colored graphs equipped with additional combinatorial structure motivated by supersymmetry in particle physics. In this talk, we will state and sketch the proof of the main classification theorem for their underlying graphs: every connected Adinkra is isomorphic as an edge-colored graph to the quotient of an N-cube by a doubly even code.
Learn more at the Math Table website.