arXiv · 0806.0051
Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry
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.
Explore related subjects
Keep this discovery
C. F. Doran, M. G. Faux, S. J. Gates Jr, T. Hubsch, K. M. Iga, G. D. Landweber. 2008-05-31. Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry. https://arxiv.org/abs/0806.0051
Cite the original work for its findings. Save a collection to share your selection of sources.