Be the first to like this
Previous work  has shown that the classication of indecomposable o-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 mech-
anism 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.