Codes and supersymmetry in one dimension
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.
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.
Abstract
Adinkras are diagrams that describe many useful supermultiplets in 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 , and for minimal supermultiplets, up to .
Project Euclid以上显示的是最相近的搜索结果。 查看全部搜索结果