arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0806.0051hep-thmath-phmath.COmath.MP
收藏

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

C. F. Doran, M. G. Faux, S. J. Gates, T. Hubsch, K. M. Iga, G. D. Landweber

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑