We continue the development of a theory of off-shell supersymmetric representations analogous to that of compact Lie algebras such as SU(3). For off-shell 4D, N = 1 systems, quark-like representations have been identified [1] in terms of cis-Adinkras and trans-Adinkras and it has been conjectured that arbitrary representations are composites of $n_c$-cis and $n_t$-trans representations. Analyzing the real scalar and complex linear superfield multiplets, these "chemical enantiomer" numbers are found to be $n_c$ = $n_t$ = 1 and $n_c$ = 1, $n_t$ = 2, respectively.
The off-shell representation theory of 4D, $\mathcal{N}=1$ supermultiplets can be categorized in terms of distinct irreducible graphical representations called adinkras as part of a larger effort we call supersymmetry `genomics.' Recent evidence has emerged pointing to the existence of three such fundamental adinkras associated with distinct equivalence classes of a Coxeter group. A partial description of these adinkras is given in terms of two types, termed cis-and trans-adinkras (the latter being a degenerate doublet) in analogy to cis/trans isomers in chemistry. Through a new and simple pro…
Evidence is presented in some examples that an adinkra quantum number, $χ_{\rm o}$ (arXiv:\ 0902.3830 [hep-th]), seems to play a role with regard to off-shell 4D, $\cal N$ = 2 SUSY similar to the role of color in QCD. The vanishing of this adinkra quantum number appears to be a condition required for when two off-shell 4D, $\cal N$ = 1 supermultiplets form an off-shell 4D, $\cal N$ = 2 supermultiplet. We also explicitly comment on a deformation of the Lie bracket and anti-commutator operators that has been extensively and implicitly used in our work on "Garden Algebras" adinkras, and codes.
Adinkras are graphs that encode a supersymmetric representation's transformation laws that have been reduced to one dimension, that of time. A goal of the supersymmetry ``genomics'' project is to classify all 4D, $\mathcal{N}=1$ off-shell supermultiplets in terms of their adinkras. In~previous works, the genomics project uncovered two fundamental isomer adinkras, the cis- and trans-adinkras, into which all multiplets investigated to date can be decomposed. The number of cis- and trans-adinkras describing a given multiplet define the isomer-equivalence class to which the multiplet belongs. A fu…
An Adinkra is a graph from the study of supersymmetry in particle physics, but it can be adapted to study Clifford algebra representations. The graph in this context is called a Cliffordinkra, and puts some standard ideas in Clifford algebra representations in a geometric and visual context. In the past few years there have been developments in Adinkras that have shown how they are connected to error correcting codes, algebraic topology, algebraic geometry, and combinatorics. These connections also arise for Cliffordinkras. This paper introduces Cliffordinkras and describes the relationship to…
Presented in this paper the nature of the supersymmetrical representation theory behind 4D, N = 1 theories, as described by component fields, is investigated using the tools of Adinkras and Garden Algebras. A survey of familiar matter multiplets using these techniques reveals they are described by two fundamental valise Adinkras that are given the names of the cis-Valise (c-V) and the trans-Valise (t-V). A conjecture is made that all off-shell 4D, N = 1 component descriptions of supermultiplets are associated with two integers - the numbers of c-V and t-V Adinkras that occur in the representat…
An Adinkra is a class of graphs with certain signs marking its vertices and edges, which encodes off-shell representations of the super Poincaré algebra. The markings on the vertices and edges of an Adinkra are cochains for cubical cohomology. This article explores the cubical cohomology of Adinkras, treating these markings analogously to characteristic classes on smooth manifolds.
Adinkras are combinatorial objects developed to study 1-dimensional supersymmetry representations. Recently, 2-d Adinkras have been developed to study 2-dimensional supersymmetry. In this paper, we classify all 2-d Adinkras, confirming a conjecture of T. Hübsch. Along the way, we obtain other structural results, including a simple characterization of Hübsch's even-split doubly even code.
In this paper we discuss off-shell representations of N-extended supersymmetry in one dimension, ie, N-extended supersymmetric quantum mechanics, and following earlier work on the subject codify them in terms of certain graphs, called Adinkras. This framework provides a method of generating all Adinkras with the same topology, and so also all the corresponding irreducible supersymmetric multiplets. We develop some graph theoretic techniques to understand these diagrams in terms of a relatively small amount of information, namely, at what heights various vertices of the graph should be "hung". …
Adinkras are a graphical depiction of representations of the N-extended supersymmetry algebra in one dimension, on the worldline. These diagrams represent the component fields in a supermultiplet as vertices, and the action of the supersymmetry generators as edges. In a previous work, we showed that the chromotopology (topology with colors) of an Adinkra must come from a doubly even binary linear code. Herein, we relate Adinkras to Clifford algebras, and use this to construct, for every such code, a supermultiplet corresponding to that code. In this way, we correlate the well-known classificat…
We present further progress toward a complete classification scheme for describing supermultiplets of N-extended worldline supersymmetry, which relies on graph-theoretic topological invariants. In particular, we demonstrate a relationship between Adinkra diagrams and quotients of N-dimensional cubes, where the quotient groups are subgroups of $(Z_2)^N$. We explain how these quotient groups correspond precisely to doubly even binary linear error-correcting codes, so that the classification of such codes provides a means for describing equivalence classes of Adinkras and therefore supermultiplet…
We present a symbolic method for organizing the representation theory of one-dimensional superalgebras. This relies on special objects, which we have called adinkra symbols, which supply tangible geometric forms to the still-emerging mathematical basis underlying supersymmetry.
Adinkras are graphical tools created for the study of representations in supersymmetry. Besides having inherent interest for physicists, adinkras offer many easy-to-state and accessible mathematical problems of algebraic, combinatorial, and computational nature. We use a more mathematically natural language to survey these topics, suggest new definitions, and present original results.
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.
Recent efforts to classify representations of supersymmetry with no central charge have focused on supermultiplets that are aptly depicted by Adinkras, wherein every supersymmetry generator transforms each component field into precisely one other component field or its derivative. Herein, we study gauge-quotients of direct sums of Adinkras by a supersymmetric image of another Adinkra and thus solve a puzzle from Ref.[2]: The so-defined supermultiplets do not produce Adinkras but more general types of supermultiplets, each depicted as a connected network of Adinkras. Iterating this gauge-quotie…
In the study of supersymmetry in one dimension, various works enumerate sets of generators of garden algebras $GR(d,N)$ (and equivalently, valise Adinkras) for special cases $N = d = 4$ and $N = d = 8$, using group-theoretic methods and computer computation. We complement this work by enumerating the objects for arbitrary $N$ and $d$ via a formula in a streamlined manner.
Every finite-dimensional unitary representation of the N-extended worldline supersymmetry without central charges may be obtained by a sequence of differential transformations from a direct sum of minimal Adinkras, simple supermultiplets that are identifiable with representations of the Clifford algebra. The data specifying this procedure is a sequence of subspaces of the direct sum of Adinkras, which then opens an avenue for classification of the continuum of so constructed off-shell supermultiplets.
Recent work on classicication of off-shell representations of N-extended worldline supersymmetry without central charges has uncovered an unexpectedly vast number--trillions of even just (chromo)topology types--of so called adinkraic supermultiplets. Herein, we show by explicit analysis that a long-known but rarely used representation, the complex linear supermultiplet, is not adinkraic, cannot be decomposed locally, but may be reduced by means of a Wess-Zumino type gauge. This then indicates that the already unexpectedly vast number of adinkraic off-shell supersymmetry representations is but …
Adinkras are combinatorial objects developed to study supersymmetry representations. Gates et al. introduced the "gadget" as a function of pairs of adinkras, obtaining some mysterious results for $(n=4, k=1)$ adinkras with computer-aided computation. Specifically, very few values of the gadget actually appear, suggesting a great deal of symmetry in these objects. In this paper, we compute gadgets symbolically and explain some of these observed phenomena with group theory and combinatorics. Guided by this work, we give some suggestions for generalizations of the gadget to other values of the $n…
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.
The problem of classifying off-shell representations of the $N$-extended one-dimensional super Poincaré algebra is closely related to the study of a class of decorated $N$-regular, $N$-edge colored bipartite graphs known as {\em Adinkras}. In this paper we {\em canonically} realize these graphs as Grothendieck ``dessins d'enfants,'' or Belyi curves uniformized by certain normal torsion-free subgroups of the $(N,N,2)$-triangle group. We exhibit an explicit algebraic model over $\mathbb{Q}(ζ_{2N})$, as a complete intersection of quadrics in projective space, and use Galois descent to prove that …
A minimal representation of the N = 8 extended worldline supersymmetry, known as the `ultra-multiplet', is closely related to a family of supermultiplets with the same, E(8) chromotopology. We catalogue their effective symmetries and find a Spin(4) x Z(2) subgroup common to them all, which explains the particular basis used in the original construction. We specify a constrained superfield representation of the supermultiplets in the ultra-multiplet family, and show that such a superfield representation in fact exists for all adinkraic supermultiplets. We also exhibit the correspondences betwee…
Using a Mathematica code, we present a straightforward numerical analysis of the 384-dimensional solution space of signed permutation 4x4 matrices, which in sets of four provide representations of the GR(4,4) algebra, closely related to the N=1 (simple) supersymmetry algebra in 4-dimensional spacetime. Following after ideas discussed in previous papers about automorphisms and classification of adinkras and corresponding supermultiplets, we make a new and alternative proposal to use equivalence classes of the (unsigned) permutation group S4 to define distinct representations of higher dimension…
Starting with valise supermultiplets obtained from 0-branes plus field redefinitions, valise adinkra networks, and the "Garden Algebra," we discuss an architecture for algorithms that (starting from on-shell theories and, through a well-defined computation procedure), search for off-shell completions. We show in one dimension how to directly attack the notorious "off-shell auxiliary field" problem of supersymmetry with algorithms in the adinkra network-world formulation.
There exist myriads of off-shell worldline supermultiplets for (N{\leq}32)-extended supersymmetry in which every supercharge maps a component field to precisely one other component field or its derivative. A subset of these extends to off-shell worldsheet (p,q)-supersymmetry and is characterized by the twin theorems 2.1 and 2.2 in this note. The evasion of the obstruction defined in these theorems is conjectured to be sufficient for a worldline supermultiplet to extend to worldsheet supersymmetry; it is also a necessary filter for dimensional extension to higher-dimensional spacetime. We show …
We continue the search for rules that govern when off-shell 4D, $\cal N$ = 1 supermultiplets can be combined to form off-shell 4D, $\cal N$ = 2 supermultiplets. We study the ${\mathbb S}_8$ permutations and Height Yielding Matrix Numbers (HYMN) embedded within the adinkras that correspond to these putative 4D, $\cal N$ = 2 supermultiplets off-shell supermultiplets. Even though the HYMN definition was designed to distinguish between the raising and lowering of nodes in one dimensional valises supermultiplets, they are shown to accurately select out which combinations of off-shell 4D, $\cal N$ =…
A conjecture is made that the weight space for 4D, $\cal N$-extended supersymmetrical representations is embedded within the permutahedra associated with permutation groups ${\mathbb{S}}{}_{d}$. Adinkras and Coxeter Groups associated with minimal representations of 4D, $\cal N$ = 1 supersymmetry provide evidence supporting this conjecture. It is shown the appearance of the mathematics of 4D, $\cal N$ = 1 minimal off-shell supersymmetry representations is equivalent to solving a four color problem on the truncated octahedron. This observation suggest an entirely new way to approach the off-shel…
We present an adinkra-based computer algorithm implemented in a Mathematica code and use it in a limited demonstration of how to engineer off-shell, arbitrary N-extended world-sheet supermultiplets. Using one of the outputs from this algorithm, we present evidence for the unexpected discovery of a previously unknown 8 - 8 representation of N = 2 world sheet supersymmetry. As well, we uncover a menagerie of (p, q) = (3, 1) world sheet supermultiplets.
