|
Search: id:A140427
|
|
|
| A140427 |
|
Arises in relating doubly-even error-correcting codes, graphs and irreducible representations of N-extended supersymmetry. |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 1, 2, 3, 4, 4, 4, 4, 5, 5, 6, 7, 8, 8, 8, 8, 9, 9, 10, 11, 12, 12
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
Formula (13) on p. 6. Abstract: 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.
|
|
LINKS
|
C. F. Doran, M. G. Faux, S. J. Gates Jr, T. Hubsch, K. M. Iga and G. D. Landweber, Relating Doubly-Even Error-Correcting Codes, Graphs and Irreducible Representations of N-Extended Supersymmetry
|
|
FORMULA
|
a(n) = 0 for 0 <= n < 4, floor((n-4)^2)/4)+1 for n = 4, 5, 6, 7, a(n-8) for n>7.
|
|
CROSSREFS
|
Sequence in context: A029117 A087848 A087844 this_sequence A072229 A120509 A029106
Adjacent sequences: A140424 A140425 A140426 this_sequence A140428 A140429 A140430
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 18 2008
|
|
|
Search completed in 0.002 seconds
|
