C. F. Doran, M. G. Faux, S. J. Gates, T. Hübsch, K. M. Iga, G. D. Landweber, R. L. Miller
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Adinkras are diagrams that describe many useful supermultiplets in D=1 dimensions. We show that the topology of the Adinkra is uniquely determined by a doubly even code. Conversely, every doubly even code produces a possible topology of an Adinkra. A computation of doubly even codes results in an enumeration of these Adinkra topologies up to N=28, and for minimal supermultiplets, up to N=32.
arXiv comments
48 pages, a new version that combines arXiv:0811.3410 and parts of arXiv:0806.0050, for submission for publication
It's not quite as spectacular as it sounds[1]. I've not read the paper, but it seems as if they've just found a convenient way to describe supermultiplets in 1D using doubly even codes[2]. [1] http://arxiv.org/abs/1108.4124 [2] http://planetmath.org/evencode
It's not quite as spectacular as it sounds[1]. I've not read the paper, but it seems as if they've just found a convenient way to describe supermultiplets in 1D using doubly even codes[2]. [1] http://arxiv.org/abs/1108.4124 [2] http://planetmath.org/evencode
kdavisView on HNParent context