Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry
High Energy Physics - Theory
2008-06-17 v1 Mathematical Physics
Combinatorics
math.MP
Abstract
Previous work has shown that the classification of indecomposable off-shell representations of N-supersymmetry, depicted as Adinkras, may be factored into specifying the topologies available to Adinkras, and then the height-assignments for each topological type. The latter problem being solved by a recursive mechanism that generates all height-assignments within a topology, it remains to classify the former. Herein we show that this problem is equivalent to classifying certain (1) graphs and (2) error-correcting codes.
Cite
@article{arxiv.0806.0051,
title = {Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry},
author = {C. F. Doran and M. G. Faux and S. J. Gates and T. Hubsch and K. M. Iga and G. D. Landweber},
journal= {arXiv preprint arXiv:0806.0051},
year = {2008}
}
Comments
19 pages