
Be the first to like this
Published on
Previous work [1] has shown that the classication of indecomposable oshell
representations of Nsupersymmetry, depicted as Adinkras, may be factored into
specifying the topologies available to Adinkras, and then the heightassignments
for each topological type. The latter problem being solved by a recursive mech
anism that generates all heightassignments within a topology [1], it remains to
classify the former. Herein we show that this problem is equivalent to classifying
certain (1) graphs and (2) errorcorrecting codes.
Be the first to like this
Be the first to comment