Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry

Simple item page
dc.creatorDoran, C. F.
dc.creatorFaux, M. G.
dc.creatorGates Jr, S. J.
dc.creatorHubsch, T.
dc.creatorIga, K. M.
dc.creatorLandweber, G. D.
dc.date2008-05-31
dc.date.accessioned2026-07-07T09:44:39Z
dc.date.available2026-07-07T09:44:39Z
dc.descriptionPrevious 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.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/0806.0051
dc.identifierhttp://arxiv.org/abs/0806.0051
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162951
dc.subjectHigh Energy Physics - Theory
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.titleRelating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry
dc.typetext

Files

Collections

arXiv