Automorphism Properties and Classification of Adinkras

Adinkras are graphical tools for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set of local parameters. Using this, we classify Adinkras according to their equivalence and isomorphism classes. We extend previous results dealing with characterization of Adinkra degeneracy via matrix products and present algorithms for calculating the automorphism groups of Adinkras and partitioning Adinkras into their isomorphism classes.


Introduction
Several recent studies [1][2][3][4][5][6][7][8][9][10] have introduced and developed a novel approach to the off-shell problem of supersymmetry.In particular, a graph theoretic tool has emerged to tackle this problem by encoding representations of supersymmetry into a family of graphs termed Adinkras.This graphical encoding has the advantage of allowing convenient manipulation of these objects, with the goal of achieving a deeper understanding of the underlying representations.
The classification of Adinkras is a natural goal of this work, and various aspects of this have been dealt with extensively in previous studies [2,4,8,11], in which many of the properties of Adinkra graphs have been ascertained.The works of [2,3] relate topological properties of Adinkras to doubly even codes and Clifford algebras.The work in [11] is particularly striking as apparently Betti numbers and functions similar to those of catastrophe theory seem on the horizon.However, we will not direct our current effort toward these observations.
The GAAC (Garden Algebra/Adinkra/Codes) Program began [12][13][14][15] with a series of observations of what appeared to be universal matrix algebra structures that seem to occur in all off-shell supersymmetrical theories.Two unexpected transformations have occurred since this start.First, there emerged Adinkras providing a graphical technology to represent these matrix algebras and second the connection of Adinkras to codes.As the ultimate goal of this program is to provide a definitive classification of all off-shell supersymmetrical theories, the appearance of these new unexpected discoveries continues to be encouraging that the goal can be reached despite the pessimism surrounding this over thirtyyear-old unsolved problem.
The goal of this paper is to present a method of efficiently distinguishing Adinkras, in other words, a way of efficiently solving the graph isomorphism problem, restricted to this particular class of graphs.This is achieved via a classification of their automorphism group, together with an efficient algorithm for computing this automorphism group for any given Adinkra.In particular, we specify the automorphism group of an Adinkra in terms of its associated doubly even code.These codes are characterized in terms of local properties of Adinkras, such that the codes, and hence the associated equivalence and isomorphism classes of these graphs, can be efficiently computed.
The structure of the paper is as follows: Section 2 provides a formal graph theoretic definition of Adinkras, introducing some graph theoretic terms related to their study and discussing some basic properties that are derived from the definition.Section 3 defines the notions of equivalence and isomorphism on the class of Adinkras.We relate Adinkra graphs to doubly even codes, citing a result from [2] that all Adinkras have an associated code.The work of [3] relating properties of Adinkras to Clifford algebras is also discussed, 2 Advances in Mathematical Physics and we define a standard form for Adinkras, used in the proof of later results.Section 4 establishes the main result of this work, classifying the automorphism group of valise Adinkras in terms of the related doubly even code.In Section 5 these results are used to generalize some results of [5] and provide a polynomial that partitions Adinkras into their equivalence classes.In Section 6 this is extended to isomorphism classes of nonvalise Adinkras, and we provide an associated algorithm that accomplishes this partitioning.Section 7 details some of the associated numerical methods and results and provides some additional examples.

Adinkra Graphs
2.1.Graph-Theoretic Notation.The Adinkra graphs dealt with in this work are simple, undirected, bipartite, edge-N-partite, and edge-and vertex-colored graphs.Note that in previous work [1][2][3] Adinkras are considered to be directed graphs.However, as this information is naturally encoded into the height assignment component of the vertex coloring, we remove the edge directions here to simplify the analysis.
We define a few of the graph theoretic terms below.For a more complete treatment, see [16].
A simple, undirected graph  = (, ) consists of a vertex set  together with an edge set  ⊆  ×  of unordered pairs of .
A graph is bipartite if its vertex set can be partitioned into two disjoint sets such that no edges lie wholly within either set.Equivalently, this is a graph containing no odd-length cycles.
A graph  = (, ) is edge-N-partite if its edge set  can be partitioned into  disjoint sets, such that every vertex V ∈  is incident with exactly one edge from each of these  sets.In other words, a graph is edge--partite if it has a 1-factorisation.
Finally, a coloring of the edge or vertex set of a graph is a partitioning of these sets into different colour classes.Formally, this restricts the automorphism group of the graph to the subset that setwise stabilises these colour classes, the subset that does not map vertices (resp., edges) in one colour class to vertices (resp., edges) in another.

Definition and Properties.
Adinkra graphs were introduced in [1] to study off-shell representations of supersymmetry.Thorough definitions are provided in [2,3,8], although, as mentioned above, they vary slightly from the definition presented here in that for the purposes of this study we will consider them to be undirected graphs.The most current and complete definition of Adinkras can be found in Definition 3.2 in the work of [2].With that in mind, we use the following definition of Adinkras for the remainder of this work.
Each vertex in  is coloured in two ways: (i) a colouring  :  → Z 2 corresponding naturally to the bipartition (labelled as bosons and fermions); (ii) each vertex being given a height assignment, hgt:  → Z such that adjacent vertices are at adjacent heights.
The edges are also coloured in two ways: (i) a partition into  colour classes corresponding to an edge--partition of the graph; (ii) an edge parity assignment  :  → Z 2 ; we term these two edge types dashed and solid.
Finally, the connections in the graph are essentially binary in the following manner.Every path of length two having edge colours (, ) defines a unique 4-cycle with edge colours (, , , ).That is to say, of all 4-cycles including these two edges, only one has the edge colours (, , , ).Such 4-cycles all have an odd number of dashed edges.
We refer to the valence of an Adinkra as its dimension.Hence an Adinkra with  edge colours (not counting edge parity) is an -dimensional Adinkra.There will generally be an assumed ordering of the edge colours from 1 to , with the term 'th edges or 'th edge dimension referring to all edges of the 'th colour.The edge parity is often referred to as dashedness (see, e.g., [5]).In this work we also refer to it as the switching state of an edge or set of edges, motivated by a forthcoming analogy to switching and two graphs.Relative to the edge-colour ordering, the switching state of an edge  = (, V) of colour  will be denoted alternately by   (),   (V), or () (referring to the 'th edge of the vertex  or V or simply the edge ).
The above conditions imply several additional properties.The edge--partite restriction requires equal numbers of bosons and fermions; hence the bipartition must consist of two sets of equal size.Moreover, we have the following important property.

Lemma 2. The number of vertices of any Adinkra is a power of two.
Proof.Since the Adinkra is -regular and edge--partite and satisfies the 4-cycle property, there exists some  ∈ Z + ,  ≤ , such that, for any -length subset of the edge colours (i.e., removing all of the edges whose colour does not lie within this subset), the Adinkra is simply an dimensional hypercube or -cube.Hence we have that the number of vertices is equal to 2  .Note that if  = , then ignoring edge and vertex colouring the resulting graph is simply the -cube.Hence we term the corresponding Adinkra the -cube Adinkra (in Section 4 we show that this is unique to ).Where  ̸ = , we denote the corresponding Adinkra to be an (, ) Adinkra, where  =  − .
When drawing Adinkra graphs, we represent the bipartition by black and white vertices.As in previous work by Doran et al. [3], the height assignments will be represented by arranging the vertices in rows, incrementally, according to height.or fermions) must be at the same height of modulo 2 and that every 4-cycle containing only two edge colours has an odd number of dashed/solid edges.In case (i), this is simply every 4-cycle; however case (ii) also contains 4-cycles with four edge colours.
It is also worth mentioning at this point that the questions of whether dashed edges correspond to even or odd parity, and which of the black or white node sets correspond to bosons or fermions, have been left ambiguous, as they do not impact on the following analysis and often represent a symmetry in the system.Also note that the absolute height values of height assignments are also currently ambiguous, as only relative values of height will be relevant to the following work.Finally, we note that since this work is concerned only with questions of equivalence and isomorphism of Adinkras, the assumption of connectedness will be made throughout to simplify the analysis, without loss of generality.

Models of Adinkras
There are other particularly useful ways of defining and modelling Adinkras.Before describing these it will be appropriate to introduce some more terminology, specifically relating to linear codes and Clifford algebras.We must also consider how to define notions of equivalence and isomorphism between Adinkras.

Equivalence and Isomorphism Definitions
Definition 4. Given an Adinkra (, , hgt, , ), the topology of the Adinkra is defined as (, ), thus giving the underlying vertex and edge sets with all the colourings (including edge parity and height assignments) removed.When only the colourings associated with edge parity and height assignments are removed, the resulting graph (, , ) is termed the chromotopology of the original Adinkra.
Two operations relative to a definition of equivalence have been defined on Adinkras [8].The vertex lowering/raising operation consists of changing the height of a given set of vertices while preserving the requirement that adjacent vertices are at adjacent heights.Hence two Adinkras (, , hgt 1 , , ) and (, , hgt 2 , , ) are related by a vertex lowering/raising operation if and only if ∀, The operation of switching a vertex consists of reversing the parity of all edges incident with it.We note briefly that this preserves the property that 4-cycles with only two edge colours have an odd number of dashed edges.
This switching operation is analogous to Seidel switching of graphs (see [17,18]) in which adjacency and nonadjacency are swapped.In this case, adjacency has been replaced by parity/dashedness for the purposes of switching.Continuing this analogy, we define the switching class of an Adinkra  to be the set of all Adinkras that can be obtained from  by switching some subset of its vertices.
Any Adinkras in the same switching class will be considered isomorphic.Adinkras related via vertex raising/lowering operations will be considered equivalent, but not necessarily isomorphic.
Hence the definitions of equivalence and isomorphism considered here differ slightly.Permuting the vertex labels, switching and raising/lowering operations all preserve equivalence, whereas the only operations preserving isomorphism are those of switching and permutations of vertex labels.
Example 5.All three Adinkras drawn in Figure 2 are in the same equivalence class; however only the first two are isomorphic.
Note that as the ultimate goal of introducing Adinkras is a greater understanding of representations of off-shell supermultiplets, useful definitions of equivalence and isomorphism regarding Adinkras should be related to the underlying supermultiplets that they encode.However notions of isomorphism applied to supermultiplets are inherently contextspecific.A pertinent discussion relating to automorphisms of supermultiplets can be found in Appendix B of [6].Here we cover a few of the points relating directly to Adinkras.In general, supermultiplets can be regarded as a triple (, R  , R  ), where R  and R  are vector spaces corresponding to the bosonic and fermionic component fields  and , and  = { 1 , . . .,   } denotes the set of  supercharges, or supersymmetry transformation operators mapping between R  and R  and their derivatives.An Adinkra graph  = (, , hgt, , ) can then be related to a supermultiplet M, with each vertex in  representing a component field of M.
Transformations acting on a supermultiplet are grouped into two classes, inner and outer transformations.This distinction reflects the property that general supersymmetric models will consist of several supermultiplets, each consisting of distinct (R  , R  ) pairs whilst sharing the same set of supercharges .An inner transformation is one affecting a single supermultiplet while leaving the others unchanged.For instance, permuting the labels of the component fields of some (R  , R  ) pair affects only that supermultiplet.However a transformation of the set { 1 , . . .,   } affects all supermultiplets of a given supersymmetric model and is hence termed an outer transformation.
A transformation induces an automorphism when the result is indistinguishable from the original when its image and preimage are the same.However "indistinguishability" is inherently contextual, and so there are several notions of equivalence between supermultiplets.Whether an outer transformation induces an automorphism can depend on the particular model being studied; hence permutations of the labels may or may not preserve equivalence.
Consequently, the definitions of equivalence and isomorphism provided above for Adinkras are not the only possible definitions, and as such a general classification of Adinkras must address a broader class of possible equivalences.One such alternative which is considered in Section 6.1 involves the inclusion of edge-colour permutations as an operation preserving isomorphism.As the edge colours (alternatively known as edge dimensions) correspond to the supercharges of the underlying supermultiplet, this situation simply involves allowing permutations of the set { 1 , . . .,   } to preserve isomorphism.
To introduce the tools necessary to classify the automorphism group properties of Adinkras, it will first be necessary to give a brief description of linear codes and Clifford algebras.

Linear Codes.
A binary linear (, ) code  ⊆ Z  2 consists of a set of 2  elements, known as codewords, which form a subgroup of (Z  2 , +).Hence for all , V ∈ ,  + V ∈ .When dealing with a codeword  of length  we will use the notation  = ( 1 ,  2 , . . .,   ), where   is the 'th coordinate of .When giving explicit examples of codewords, we will often omit the commas in this representation, as all coordinates are elements of Z 2 .We also consider all subsequent codes to be both binary and linear; these terms are henceforth dropped from their description.
A generating set of  is a set  ⊆ , consisting of  codewords, such that all codewords in  can be formed by a linear combination of elements of .The minimal value of  for which a generating set exists is called the dimension of the code and is invariant with respect to the particular choice of generating set.
The weight of a codeword , denoted by wt(), or simply ||, is the number of 1's in .If every codeword in a code has a weight of 0 (mod 4) the code is called doubly even.The inner product of two codewords  and V of length  is defined as Then a doubly even code has the property that any two of its codewords have an inner product of 0. Definition 6.A standard form generating set  of an (, ) code  is defined to be of the form  = ( | ), where  is the  ×  identity matrix and  is a  × ( − ) matrix being the remainder of each codeword in .
Example 7. By applying a permutation of the coordinates of codewords and considering an alternative generating set, the code  8 , generated by ( ), can be written in terms of a standard form generating set.In order to do so, first we will interchange some coordinates by moving columns  8 →  3 →  2 →  8 to give ( ).We then perform row operation  1 +  2 →  1 to give ( ) which is in the standard form for a generating set.
Note that the freedom to interchange coordinates means that there are numerous standard form generating sets that we could produce, which in turn would have different codes associated with them.Given the nature of the standard form however, any code with an associated standard form generating set will have a unique standard form generating set.
Note also that generating sets will be assumed to be minimal in that the codewords comprising the set are linearly independent.Thus, a generating set with  codewords corresponds to a code with 2  distinct codewords.
Observation 1.For any (, ) code, there exists a generating set  and permutation of the coordinates of the codewords  ∈ Sym() such that  is a standard form generating set.The notion of codewords can be effectively used to furnish a further organisation of the edge and vertex sets of an Adinkra.If we order the edge colours of an -cube Adinkra from 1 to , then assign each of these edge colours to the corresponding coordinate in an -length codeword; each of the 2  vertices in the Adinkra can be represented by such a codeword.These codewords are allocated in such a way that two vertices connected by the 'th edge differ precisely in the 'th element of their respective codewords.
Example 8. Applying this codeword representation to the vertices of a 3-cube Adinkra yields the graph of Figure 3.Note that, for an -cube Adinkra, two vertices are connected by an edge if and only if their corresponding codeword representations have a Hamming distance of 1 (differing in only one position).
An important theorem of [2] links general (, ) Adinkras to doubly even codes.We paraphrase it, combined with other results from the same work, below.
Theorem 9 (see [2]).Every (, ) Adinkra (up to equivalence) class can be formed from the -cube Adinkra by the process of quotienting via some doubly even (, ) code.
This quotienting process works as follows.We start with a doubly even (, ) code  and an -cube Adinkra with a corresponding edge-colour ordering and codeword representation.We then identify vertices (and their corresponding edges) related via any codeword in , ensuring first that identified vertices have identical edge parities relative to the ordering of edge colours.In this process an (, ) code identifies groups of 2  vertices and reduces the order of the vertex set from 2  to 2 − , producing an (, ) Adinkra.Doran et al. [2] showed that the topology of an Adinkra is uniquely determined by a doubly even code, with a 1-1 correspondence between the two.
Example 10.If we take the 4-cube Adinkra, with codewords given by the elements of Z 4  2 and we quotient by the doubly even (4, 1) code  = {(0000), (1111)}, we produce the (4, 1) Adinkra of Figure 1.Quotienting by  identifies pairs of codewords that differ by (1111) (e.g., (0000) and ( 1111); ( 0001) and ( 1110)), thus reducing the number of vertices from 16 to 8. We observe that this identification is consistent with the topology of the 4-cube Adinkra in that any edge joining two vertices V 1 and V 2 of the 4-cube Adinkra can also be identified with an edge joining vertices V 1 + (1111) and V 2 + (1111) in the 4-cube Adinkra.

Clifford Algebras
Definition 11.One will consider the Clifford algebra () to be the algebra over Z 2 with  multiplicative generators  1 ,  2 , . . .,   , with the property where   is the Kronecker delta.In other words, each of the generators is a root of 1, and any two generators anticommute.
It will be convenient to view the 4-cycle of Adinkras in terms of the anticommutativity property of Clifford generators.If we consider each position in the codeword representation of a vertex of an -cube Adinkra to correspond to a given generator of (), with the vertex itself being related to the product of these Clifford generators, then the 'th edge dimension can be naturally viewed as the transformations corresponding to left Clifford multiplication by the 'th Clifford generator.
For example, a vertex with codeword representation (01100) corresponds to the product of Clifford generators  2  3 ∈  (5), and the edge connecting the vertex (01100) to (01101) is related to the mapping  2  3  → ( 5 )( 2  3 ) =  2  3  5 .Then the condition that every 4-cycle which consists of exactly two edge colours must have an odd number of dashed edges corresponds to the anticommutativity property of Clifford generators,     = −    for  ̸ = .In connection with this Clifford generator notation, we define a standard form for the switching state of an -cube Adinkra.
Definition 12.A standard form -cube Adinkra has edge parity as follows.The 'th edge of vertex V = (V 1 , V 2 , . . ., V  ) has edge parity given by This corresponds to left Clifford multiplication of V by   .Note that this standard form is defined relative to some given codeword labelling of the vertex set.Since fixing the labelling of a single vertex fixes that of all vertices, we will sometimes refer to a standard form as being relative to a source node, being the vertex with label (00 ⋅ ⋅ ⋅ 0), or simply standard form relative to 0.
Example 13.The 3-cube Adinkra of Example 8 is in standard form.Vertices are ordered into heights relative to their codewords, such that heights range from 0 (at the bottom) to 3, and vertices at height  have weight .The edges are ordered from left to right, such that green corresponds to  1 and red corresponds to  3 .
As we have seen, many Adinkras can be formed by quotienting the -cube Adinkra with respect to some doubly even code (as we have not yet investigated the case of Gnomon Adinkras defined by the "zippering" process presented in [19], the extension of our results to these cases requires further study).However in practice this method can be quite inefficient.The following alternative method for constructing an (, ) Adinkra with associated code  is due to .Landweber (personal communication) is used by the Adinkramat software package: (1) Start with the standard form ( − )-cube Adinkra induced on the first  −  edge dimensions.
(2) Find a standard form generating set for , of the form  = ( | ).
(3) Associate the ( −  + )th edge dimension with the product of Clifford generators given by   , the 'th row of .
(4) The 'th edge connects a vertex V to the vertex V ⋅   , with switching state corresponding to right Clifford multiplication of V by   , up to a factor of (−1)  .
The factor of (−1)  , termed the fermion number operator, simply applies a (−1) factor to fermions and leaves bosons unchanged.This factor is required to ensure the parity of an edge remains the same in either direction.Again, note that the choice of whether even-or odd-weight vertices are bosons remains ambiguous.For simplicity, we consider odd-weight vertices to be fermions for the purposes of the (−1)  factor, with the symmetry encoded by a graph-wide factor of ±1 in the switching state of the extra  edge dimensions, corresponding to two potentially inequivalent (, ) Adinkras.
Define S  () to be the set of all Adinkras obtained by the above construction method using the associated doubly even (, ) code , with fermion/boson assignment determined by .It remains to be seen whether S  () coincides with an equivalence class of (, ) Adinkras with associated code .To our knowledge this has not been explicitly proven in previous work; hence we present a proof of this as follows.
Theorem 14.Given a doubly even (, ) code  and a fermion/boson assignment function , for any Adinkra  ∈ S  () the equivalence class of  coincides with S  ().
Proof.As we are only considering equivalence classes, the height assignments will be ignored.
Consider an -cube Adinkra quotiented with respect to an (, ) code  with standard form generating set  = ( | ), producing an (, ) Adinkra  = (, , hgt, , ).Assume without loss of generality that the vertices remaining after quotienting all have fixed ( −  + 1)th → th codeword characters (e.g., all fixed as 0).Then the rows of  represent the vertices identified by the quotienting process.We want to show that, up to isomorphism, there are at most two different ways this quotienting operation can be performed.
Isolating any set of  −  edge dimensions of  yields an induced ( − )-cube Adinkra,  = (,   , hgt, , ), with   ⊂  and  restricted to   .We will see in Section 4 that, for fixed , all -cube Adinkras belong to a single equivalence class.Hence without loss of generality  can be considered to be in standard form.This in turn fixes the switching state of all edges belonging to the chosen  −  edge dimensions.Now only a single degree of freedom remains in the switching states of the remaining  edge dimensions, due to the 4cycle condition.In other words, fixing the switching state of any one of the remaining edges fixes all remaining edges.This choice corresponds to a graph-wide factor of ±1 in the switching state of the additional  edge dimensions and is determined by .
Since this graph-wide factor of ±1 matches the difference between the two possibly inequivalent Adinkras produced by the above construction method, it remains to show that the construction method does indeed produce valid (, ) Adinkras.Hence me must verify that the 4-cycle condition holds.
As odd-weight vertices are considered to be fermions, the (−1)  factor can be replaced by an additive factor of ∑ − =1   , for a given vertex  ∈ .Then for  >  − ,  ∈ ,   = ( 1 ,  2 , . . .,  − ), The 4-cycles in  with two edge colours  and  will be split into three cases: Note that a given vertex  ∈  defines a unique such 4  and  +  + .Then the sum of the edge parities of the 4-cycle equals Hence the 4-cycle condition holds (note that this is the only case present in the construction of the standard form -cube Adinkra).
Case (iii) proceeds similarly to case (ii).
Hence the graphs produced via this construction method are indeed (, ) Adinkras.Since [2] showed that all (, ) Adinkras can be produced via the quotienting method, there can be at most two equivalence classes of Adinkras with the same associated code, and hence the Adinkras produced from the two methods must coincide.Definition 15.A standard form (, ) Adinkra has switching state given by the above construction, relative to an associated doubly even code.
Example 16.The smallest nontrivial (, ) Adinkra has parameters  = 4,  = 1, with associated doubly even code (1111).The standard form of Definition 15 is shown in Figure 4, for each choice of the graph-wide factor of ±1.
In this case the two Adinkras formed belong to different equivalence classes, as we demonstrate in the following section.
This construction provides a much simpler practical method of constructing Adinkras, and the standard form will be convenient in the proof of later results.Note that all (, ) Adinkras have an associated doubly even code, with matching parameters of length and dimension.For these purposes the -cube Adinkra is considered an (, 0) Adinkra with a trivial associated code of dimension 0.

Automorphism Group Properties of Adinkras
We now have sufficient tools to derive the main result of this part: classifying the automorphism group of an Adinkra with respect to the local parameters of the graph, namely, the associated doubly even code.We start with several observations regarding the automorphism properties of Adinkras.
Lemma 17. Ignoring height assignments, the -cube Adinkra is unique to , up to isomorphism.Note that equivalently, we may consider Adinkras with only two heights to correspond to the assignment of bosons and fermions, and we call these valise Adinkras.Those with more than two heights are called nonvalise Adinkras.
Proof.It suffices to show that any -cube Adinkra can be mapped to standard form via some set of vertex switching operations.Such a mapping can be trivially constructed.For example, start with a single vertex.The parity of its edge set can be mapped to any desired form by a set of vertex switching operations applied only to its neighbours.In particular the edge parities can be mapped to those of the corresponding standard form Adinkra. Since the 4-cycle restriction of Section 2.2 holds, this process can be continued consistently for the set of vertices at each subsequent distance from this original vertex.For example, there will be   2 vertices at a distance of two from the original vertex and each of these vertices will belong to one of the   2 unique 4-cycles defined by the pairs of edges joining the original vertex to its neighbours.For each of these 4-cycles, since we have already fixed two of its edges to have the correct parity (those joining the original vertex to its neighbours), the 4cycle property (that the cycle must contain an odd number of dashed edges) ensures that the remaining two edges both must either have the correct parity (requiring no vertex switching) or have incorrect parity (which can be rectified by switching the vertex).This process can then be continued in the same manner for vertices at further distances.The Adinkra resulting from this process will then be in standard form relative to this original vertex, regardless of the initial switching state of the Adinkra.Lemma 18. -cube valise Adinkras are vertex-transitive up to the boson/fermion bipartition.That is to say, given any two vertices V 1 and V 2 of the -cube Adinkra, there exists an automorphism  which maps Proof.To show this, we begin with a standard form -cube Adinkra  = (, , hgt, , ), with switching state defined by left multiplication by the corresponding Clifford generators, as in Definition 12. Since -cube Adinkras are unique up to isomorphism, in the sense of Lemma 17, this can be done without loss of generality.
Then the switching state of edge (, ), where  =  ⋅ , is of the form  1 +  2 + ⋅ ⋅ ⋅ +  −1 (mod 2).Consider a nontrivial permutation  :   → .Since  is nontrivial, there are two vertices , V ∈ ,  ̸ = V, such that  :   → V.If  is to preserve the topology of , we must have  :   → ( ⋅ V), ∀  ∈ .Note that  has no fixed points and is completely defined in terms of ( ⋅ V).Any automorphism  of  which permutes  according to  must also switch some set of vertices in such a way that edge parity is preserved.However  maps the edge (, ), where  =  ⋅ , with edge parity  1 +  2 + ⋅ ⋅ ⋅ +  −1 (mod 2), to the edge ((), ()), with edge parity of Hence the change in edge parity of (, ) does not depend on either endpoint explicitly, only on the mapping  and the edge dimension .In other words,  either preserves the switching state of all edges of a given edge dimension or reverses the parity of all such edges.Note that any single edge dimension can be switched (while leaving all other edges unchanged) via a set of vertex switching operations; hence an automorphism  exists for all such .Furthermore,  is unique to , which is in turn unique to the choice of ( ⋅ V).
Note that if  is in standard form, we term the automorphism mapping vertex  to vertex 0 = (00 ⋅ ⋅ ⋅ 0) as putting  in standard form relative to .By this terminology,  was initially in standard form relative to 0.
Corollary 19.The -cube Adinkra is minimally vertextransitive (up to the bipartition), in the sense that the pointwise stabiliser of the automorphism group is the identity, and |Aut()| = (1/2)|| = 2 −1 .In other words, no automorphisms exist that fix any points of the -cube Adinkra.
Consider any (, ) Adinkra  = (, , hgt, , ).The sub-Adinkra  = (,   , hgt, , ) induced on any set  of (−) edge dimensions of  will be an (−)-cube Adinkra.Also, for all such  there exists some set of vertex switching operations such that the induced Adinkra  is in standard form.In the case where  = (1, 2, . . .,  − ), the induced  is in standard form if and only if  is in standard form.
Observation 2. Given some (, ) Adinkra, containing a standard form ( − )-cube Adinkra induced on the first ( − ) edge dimensions (or equivalently an induced ( − )cube Adinkra in any given form), the switching state of the 'th edge dimension,  > ( − ), is fixed up to a graph wide factor of −1.
In particular, fixing the parity of the extra edges , where  > ( − ), of a single vertex fixes the parity of all extra edges in the graph.This is a direct consequence of the anticommutativity property of 4-cycles with two edge colours.
This reduces the problem of finding automorphisms of a general (, ) Adinkra to that of local mappings between vertices.In particular, for any two nodes ,  ∈ , there will be a unique automorphism of the induced ( − )cube Adinkra mapping  to .This will extend to a full automorphism of  if and only if it preserves the switching state of the additional  edges of .Hence we arrive at the following result.
Proof.Consider without loss of generality the case where  is in standard form, and take  = (,   , hgt, , ) to be the sub-Adinkra induced on the first  −  edge dimensions.By Lemma 18,  is vertex transitive if we disregard vertex colouring.So consider the automorphism  of ,  :   → , where ,  ∈ .Now  consists of two parts: a permutation of the vertex set,  : V  →  ⋅  ⋅ V, ∀ V ∈ , and a set of vertex switching operations, such that the switching state of  is preserved.
We wish to know when  switches  relative to  (i.e., when  is switched but  is not, or vice versa, and when either both or neither are switched).Where   () denotes the switching state of the 'th edge of  (in  or ), we use    () to denote the equivalent switching state of  in () or () (we also denote () and () by   and   , resp.).Note that  in   is the image of  in  under .
For edge dimension  ≤  − , we see that since  is an automorphism of ,   () =    (), and similarly   (V ⋅ ) =    (V ⋅ ) ∀ V ∈ .For the case  >  − ,   (V) is given by (4) in the proof of Theorem 14, but what about    (V)?The value of    (V) can be found by considering the path   () in  joining  to  ⋅   , where A  = ( 1 ,  2 , . . .,  − ).If we denote by   the associated product of Clifford generators where   denote the 1's of   , we have Then  will preserve the parity of edge (,  ⋅   ) if and only if the number of dashed edges in paths   () and   () are equal (mod 2).In other words, Now   1 () ≡  1 + ⋅ ⋅ ⋅ +   1 −1 (mod 2), . . .,    ( ⋅   ) ≡ ( 1  1 ) + ⋅ ⋅ ⋅ + (      ) (mod 2), where   = 1 for  ∈ {  : 1 ≤  ≤ }, and   = 0 elsewhere.Hence this can be rearranged as Theorem 20 leads to several important corollaries regarding the automorphism group properties of Adinkras.Recall that there are at most two equivalence classes of Adinkras with the same associated doubly even code.Theorem 20 implies that, disregarding the vertex colourings, there is in fact only one such equivalence class.Hence including the vertex bipartition, we see that two equivalence classes exist if and only if the respective vertex sets of bosons and fermions are setwise nonisomorphic.This in turn occurs if and only if at least one orbit (and hence all orbits) of  is of fixed weight modulo 2.
In [2,5], one such case was investigated, for Adinkras with parameters  = 4,  = 1.In this case, the Klein flip operation, which exchanges bosons for fermions, was found in [2,5] to change the equivalence class of the resulting Adinkra.We term this property Klein flip degeneracy and note the following corollary of Theorem 20.
Proof. has 2 − nodes.By Theorem 20, disregarding the vertex bipartition there are 2  orbits of equal size, partitioning the vertex set.Including the bipartition, these orbits are split into 2 once more whenever they contain nodes of variable weight modulo 2 (i.e., whenever  does not contain the all-1 codeword).

Characterising Adinkra Degeneracy
In the work of Gates et al. [5] the Klein flip degeneracy in the  = 4 case of Example 16 was investigated.It was shown that Adinkras belonging to these two equivalence classes can be distinguished via the trace of a particular matrix derived from each Adinkra.We will briefly introduce these results and generalise them to general (, ) Adinkras.
Throughout the following section we will consider an (, ) Adinkra  = (, , hgt, , ) with corresponding code .Note that  has 2 − vertices, each of degree .

Notation
Definition 24.The adjacency matrix () (or simply  where the relevant Adinkra is clear from the context) is a 2 − × 2 − symmetric matrix containing all the information of the graphical representation, except the vertex colouring associated with height assignments.Each element of the main diagonal represents either a boson or a fermion, denoted by + for bosons and − for fermions.The offdiagonal elements represent edges of , numbered according to edge dimension, with sign denoting dashedness.For example, if position  , = −4, there is a dashed edge of the fourth edge colour between boson/fermion  and fermion/boson .Hence the sign of the main diagonal elements represents the vertex bipartition, the sign of offdiagonal elements represents the edge parity, the absolute value of off-diagonal elements represents edge colour, and the position of the elements encodes the topology of the Adinkra.
If we order the vertex set into bosons and fermions, this Adinkra can be represented by the matrix: Note that the symmetric nature of the adjacency matrix arises naturally out of the definition, and requiring that this property be upheld imposes no further restrictions in and of itself.
We define  and  matrices similarly, as in [5], to represent a single edge dimension of the Adinkra. and  matrices encode this edge dimension, with rows corresponding to bosons and fermions, respectively.As each edge dimension is assigned a separate matrix, the elements corresponding to edges are all set to ±1.Then the Adinkra of Example 25 has  matrices: These matrices can be read directly off the top right quadrant of the adjacency matrix.Similarly, the  matrices can be read off the lower left quadrant.In this case, we have   =    , where  denotes the matrix transpose.Note that  and  matrices taken directly from the adjacency matrix will always be related via matrix transpose.Furthermore, since we are considering only off-shell supermultiplets, these matrices must also be square.We will assume that all subsequent  and  matrices are related in this way.We define a further object,  i , to be a composition of  and  matrices of the form Further details regarding these objects can be found in [5].In particular, it was shown in [5] that the Klein flip degeneracy of several (4, 1) Adinkras can be characterised by the trace of quartic products of these matrices, according to the formula where  represents the Kronecker delta and  the Levi-Civita symbol and where  0 = ±1 distinguishes between the (4, 1) Adinkras belonging to the two equivalence classes of Example 16.It is also conjectured in [5] that this same method for distinguishing equivalence classes can be generalised to all values of the parameters  and .We prove this conjecture in the following section.

Degeneracy for General 𝑁.
In order to generalise (21) to higher , we wish to determine the form taken by the trace of products of these  matrices and establish exactly when this can be used to partition Adinkras into their equivalence classes.Firstly we note the following properties of Adinkras.
Lemma 26.The cycles of an -cube Adinkra consist entirely of paths containing each edge dimension 0 (mod 2) times.

Lemma 27. The cycles of an (𝑁, 𝑘) Adinkra with associated code 𝐶 consist of paths in which
(i) each edge dimension is traversed 0 (mod 2) times; (ii) at least one edge dimension is traversed 1 (mod 2) times.
In case (ii), the set of such edge dimensions traversed 1 (mod 2) times corresponds to a codeword in .
In fact, the codeword (00 ⋅ ⋅ ⋅ 0) is in any such code , so all cycles have this property; however case (i) is considered a trivial instance.
Consider the product of   matrices of , denoted by  =   1   2 ⋅ ⋅ ⋅    .As we are considering only  and  matrices such that   =    , all  matrices defined as in ( 20) will be real and symmetric.This leads to the following property for .Proof.Consider the product of Clifford generators corresponding to path   .Since (ii) holds, after cancelling repeated elements we are left with some codeword  ∈ , such that  =   , where  = ±1, depending on whether   corresponds to an even or odd permutation of , relative to shifting and cancelling of Clifford generators.Since  is a group, either (i)  ∈ , a standard form generating set of , or (ii)  = ( 1 +  2 + ⋅ ⋅ ⋅ +   ), where   ∈ , for any such .
One immediate corollary of the preceding lemma is that the trace of  will vanish whenever   corresponds to a codeword in .In fact, Tr() will only be nonzero in the trivial case where path   consists of a set of pairs of edges of the same colour.These are the paths corresponding to the Kronecker delta terms of (21).In particular, this implies that Tr() cannot distinguish between equivalence classes of Adinkras directly.However if we instead consider powers of  and  matrices, the preceding lemma suggests a direct generalisation of (21) to all (, ) Adinkras.
Given an (, ) Adinkra, consider the product of   matrices,   1    2 ⋅ ⋅ ⋅     .Denoting path  = ( 1 ,  2 , . . .,   ), we define value   such that   = 0 if there exists an edge dimension in  that is present 1 (mod 2) times, and   =  otherwise.Here  = ±1, corresponding to the sign of the related product of Clifford generators (since  consists of pairs of edges of the same colour, this product of Clifford generators equals ±1).Then we have the following result.
Proof.The   term follows directly from Lemmas 28 and 30.
In Section 4, we show that (, ) Adinkras with the same associated code  are all in a single equivalence class, except where (11 ⋅ ⋅ ⋅ 1) ∈ .In this case, the two equivalence classes are related via the Klein flip operation, exchanging bosons and fermions.Moreover, since  = (11 ⋅ ⋅ ⋅ 1) ∈ , the Klein flip operation switches the sign of ⟨, ⟩, for each  ∈ .
Then by Lemma 30, the Adinkras from different equivalence classes correspond to  0 values of opposite sign.
Note that if  = 4 and  = (, , , ), then   =     −     +     , and the result of ( 21) follows.These results can be simplified in some respects if we consider the products of  matrices instead.Recall the definition  =   1   2 ⋅ ⋅ ⋅    , where   = ( 1 ,  2 , . . .,   ), and the fermion number operator (−1)  .Instead of taking the trace of , consider the trace of  ⋅ (−1)  .We have and we are considering only  =   , so for even , Replacing  matrices by  matrices in Lemma 31 simply changes the sign of  0 , so for an (, ) Adinkra,

Identifying Isomorphism Classes of Adinkras
The results up to this point deal with equivalence classes of valise Adinkras, where we consider only 2-level Adinkras.
For the nonvalise case, we require a method of partitioning general (, ) Adinkras into their isomorphism classes.The essential problem in establishing such a method is in classifying the topology of an Adinkra relative to the automorphism group of its underlying 1-level Adinkra (in which vertex colouring is ignored).We might consider simply partitioning the vertex set into the orbits of this underlying automorphism group and then classifying each height by the number of vertices of each orbit that it possesses.However this method will clearly be insufficient, as it ignores the relative connectivity between vertices at different heights.For example, the two Adinkras of Figure 5 are in the same equivalence class by use of this set of definitions.They also have the same number of vertices from each orbit at each height, and yet they are clearly nonisomorphic; no relabelling of the vertices or vertex switching operations can map between them.However even this simple method does come close to partitioning nonvalise Adinkras into their isomorphism classes.Recall that a pointwise stabiliser of the automorphism group of any Adinkra is the identity; no nontrivial automorphisms exist that fix any vertex.Note that here the term nontrivial refers to the corresponding permutation of the vertex set.An automorphism which switches vertices but leaves the ordering of the vertex set unchanged is considered trivial.In fact fixing any vertex of an Adinkra yields a natural, canonical ordering of the vertex set, relative to some ordering of the edge dimensions, according to the following construction.
(ii) Order the neighbours of V from 2 to  + 1 according to the ordering of the corresponding edge dimensions ( V (  V) = 1 + , where 1 ≤  ≤ ).
(iii) Repeat this for vertices at distance 2, beginning with the neighbours of  1 V and ending with the neighbours of   V.
(iv) Repeat this similarly for vertices at each distance, until all vertices have been assigned an ordering in [2 − ].
In other words,  V firstly orders the vertex set according to distance from V; then for each of these sets, each vertex  is assigned an ordering based on the lexicographically smallest path from V to .
To formalise the partitioning of heights discussed above, consider an (, ) Adinkra  = (, , hgt, , ) with ℎ different height assignments.Let Γ  be the automorphism group of the corresponding 1-level Adinkra (ignoring the vertex colouring of ).Relative to a particular ordering of the edge dimensions, and a particular generating set of the associated doubly even codes, order the 2  orbits of Γ  according to  :   → [2  ].We then define   (ℎ, ) to be the number of vertices at height ℎ belonging to the th orbit of Γ  , such that Consider a pair of Adinkras  = (, , hgt 1 ,   properties described above.Then cert  (V) = cert  (V) if and only if  and  are isomorphic.
Proof.If  and  are isomorphic then this is trivially true.Conversely, assume cert  (V) = cert  (V).Then since  and  belong to the same equivalence class and   (V) =   (V), there exists an isomorphism  mapping  to  (ignoring the vertex colourings).Then  extends to a full isomorphism (including the vertex colourings) if it preserves height assignments.This follows directly from cert  (V) = cert  (V); hence  and  are isomorphic.
The preceding theorem provides an efficient method of classifying Adinkras according to their isomorphism class.Note that the classification is relative to a given ordering of the edge colours and requires a knowledge of the associated doubly even code.In cases where the associated code is unknown, Lemma 27 suggests an efficient method for finding the code and hence relating a given (, ) Adinkra to its "parent" -cube Adinkra, in the sense of Theorem 9.In particular, Lemma 27 implies the following result.
Corollary 33.Given an (, ) Adinkra with related code , the codewords of  correspond exactly to the cycles of  in which at least 1 edge dimension appears once (modulo 2).
We provide an example of the above certificates below.Consider the two Adinkras of Figure 6.These are both height 3, (5, 1) Adinkras.They are in the same equivalence class; however by calculating the above certificate for each we show that they are nonisomorphic.
To analyse the above Adinkras, we first order the edge colours from green to purple, such that, in the codeword representation, green corresponds to the last coordinate and purple to the first.Note that henceforth we will order the right-most coordinate to the left-most coordinate, consistent with a bit-string interpretation of codewords in the computational application.Alternatively, the green edges are associated with the first Clifford generator and the purple edges with the fifth generator.As these are (5, 1) Adinkras, they have an associated (5, 1) doubly even code.By inspection or by explicitly finding the nontrivial cycles in the Adinkras, we note that the associated code is (11110), corresponding to a 4-cycle comprising edge colours {red, yellow, blue, purple}.By Theorem 20, the induced 1-level Adinkra has two orbits, corresponding to the sets of nodes with the same parity (inner product modulo 2) relative to this code.Denote the two Adinkras by  and , respectively.Then by applying the results of Section 4, we obtain  values of In other words, the two height 3 vertices of  are in a different orbit to those of .Hence cert  ̸ = cert  , and the two Adinkras are in different isomorphism classes.

Partitioning into Isomorphism Classes: Further Examples.
In [20] it was shown that simply recording the number of vertices at each height is not sufficient to characterise Adinkras.In particular, they provide examples of pairs of Adinkras which are in the same equivalence class, but not isomorphic, despite having the same number of vertices at each height.In this section, we analyse the examples of [20] using the techniques described above.
Firstly however, we note that a different definition of isomorphism is considered in [20].Specifically, they consider the situation where permutations of the edge colours preserve isomorphism, a variation discussed in Section 3.1.Allowing this more general definition of isomorphism results in several changes to the results of the preceding sections.In particular, note that the automorphism group of the cube Adinkra would simply become that of the -cube: the hyperoctahedral group of order 2  !.A permutation of the edge colours corresponds to a reordering of the codeword associated with each vertex (or equivalently a permutation of the Clifford generators associated with each edge dimension).

Advances in Mathematical Physics
Hence the automorphism group of (, ) Adinkras will be extended according to the following lemma.
Lemma 34.Allowing permutations of the edge colours to preserve isomorphism, an (, ) Adinkra  with associated doubly even code  has an automorphism group (ignoring height assignments) of order where Aut() is the automorphism group of the code  and where  = 1 if  contains the all-1 codeword, and  = 0 otherwise.
In other words, any permutations that correspond to symmetries of the code will extend naturally to automorphisms of the Adinkra.Conversely, if a permutation of the codeword is not in the automorphism group of the code, then trivially it cannot be an automorphism of the Adinkra.Note that Lemma 34 applies trivially to -cube Adinkras, for which  = 0 and  = (00 ⋅ ⋅ ⋅ 0); hence |Aut()| = !.
Hence, Klein flip degeneracy no longer necessarily exhibits for Adinkras containing the all-1 codeword.Instead, note that any automorphism of the associated doubly even code corresponding to an odd permutation of the edge colours (or alternatively the underlying supercharges) effectively performs a Klein flip, substituting bosons for fermions and vice versa.Hence, Klein flip degeneracy occurs if and only if the associated code contains the all-1 codeword and the automorphism group of the code contains no odd permutations, hence narrowing down the possible candidates.
Somewhat fortuitously, a recent result regarding doubly even codes sheds some light on this situation.Doran et al. [20] prove that the automorphism group of self-dual doubly even codes is always contained in the alternating group.Given a doubly even binary (, ) code , its dual  ⊥ is given by A self-dual code is simply a code equal to its own dual; a doubly even (, ) code is self-dual if and only if  = /2 and  ≡ 0(mod 8).Hence the following result holds.
However, the question of whether any other Adinkras with Klein flip degeneracy (again allowing for edge-colour permutations) exist still remains.This is equivalent to asking whether any doubly even codes exist, which are both not selfdual and contain no nontrivial even-permutation automorphisms, and is the subject of continuing work.Furthermore, if the automorphism group of doubly even codes turns out to be sufficiently rich, a greatly simplified certificate encoding the isomorphism class of an Adinkra could be developed, as will be discussed briefly in Section 8.
In [20], two pairs of equivalent but nonisomorphic Adinkras are presented, each pair having the same number of vertices at each height.The first pair comprises two height 3, (5, 1) Adinkras, isomorphic (up to a permutation of edge colours) to those of Figure 7.Note that the second Adinkra of Figure 7 is identical to the first Adinkra of Figure 6.
Applying the methods described in the previous section to this pair proceeds as in the analysis of the Adinkras of Figure 6.As in that example, after ordering the edge colours from blue to green, each Adinkra has associated code (11110).We see that the top two nodes of the first Adinkra belong to different orbits of the corresponding 1-level Adinkra, whereas the top two nodes of the second Adinkra belong to the same orbit.Hence the two Adinkras are trivially distinguished.In particular, following the conventions in the equations of Example (29), the  values of these two Adinkras, labelled by  and , respectively, are Advances Hence cert  ̸ = cert  , and the two Adinkras are in different isomorphism classes.Also, note that the "orbit spread," the number of vertices in each orbit at each height, has a different character in each Adinkra.So regardless of the ordering of the orbits, these two Adinkras must remain in different isomorphism classes if edge-colour permutations are allowed.
In this case, after ordering the edge colours from dark blue to green, as for the top left node of the first Adinkra, both Adinkras have the associated code generated by ( 1 1 1 1 0 0 0 0 1 1 1 1 ), and hence each has four orbits in the automorphism group of the corresponding 1-level Adinkras.The top two nodes of the first Adinkra are connected via the length 2 paths (001001) and (000110), having odd inner product with each of the codewords in the generating set above.Hence these nodes are in different orbits of the automorphism group.Conversely, the top two nodes of the second Adinkra are connected via the length 2 paths (110000), (001100), and (000011), having even inner product with each of the codewords.Hence they are in the same orbit.As a result, the certificates of Theorem 32 are different for each Adinkra, and hence they are in different isomorphism classes.Again, following the conventions in the equations of Example (29), we obtain  values of Hence, as in the previous example, cert  ̸ = cert  , and moreover the Adinkras remain in different isomorphism classes if edge-colour permutations are allowed.

Numerical Results
The automorphism group results of the preceding sections were also verified numerically, independently to the analytical results.All (, ) Adinkras up to  ≤ 16 were produced, and the related automorphism group and equivalence classes were calculated for each such Adinkra.The results found were consistent with the analytical results described in the earlier sections.In particular, (i) all (, ) Adinkras with the same associated code  were found to be in the same equivalence class, except in the cases where (11 ⋅ ⋅ ⋅ 1) ∈ .In these cases, the Adinkras were split into two equivalence classes, (ii) all 1-level (, ) Adinkras had 2  orbits, each consisting of sets of vertices with the same set of inner products with the codewords in , according to Theorem 20.
All doubly even (, ) codes up to  = 28 (and many larger parameter sets) can be found online (Miller,[21]).For each parameter set (, ), the two possibly inequivalent standard form Adinkras corresponding to the construction method of Theorem 14 were produced relative to each doubly even code on these parameters.As we were considering only equivalence classes and automorphism groups of valise Adinkras, it sufficed to use the adjacency matrix form defined in Section 5 for this analysis, as height assignments need not be encoded in the representation.The orbits were then calculated from the adjacency matrices by forming a canonical form relative to each node via a set of switching operations and a permutation of the vertex set.A canonical form is defined to be a mapping , consisting of a permutation of the vertex labels and set of vertex switching operations, such that for any two Adinkras  and , () = () if and only if  and  are isomorphic.
Then given a vertex V and adjacency matrix  of an (, ) Adinkra (together with an ordering of the edge colours), we define the following canonical form of  relative to V.
(iii) Repeat for neighbours of vertex  1 V.
(iv) Repeat for each vertex, in the ordering above, such that edges appearing lexicographically earlier in the adjacency matrix are of even parity where possible.
This defines a unique switching state of the Adinkra, up to isomorphism.Furthermore it is a canonical form, in that any two vertices belonging to the same orbit result in identical matrix forms.To illustrate the above process, we consider a (6, 2) Adinkra with associated code generated by ( 1 0 1 1 1 0 0 1 1 1 0 1 ).The form valise Adinkra is shown in Figure 9, where the top leftmost vertex has codeword (0000), and its edges are ordered lexicographically from left to right.
Consider the process of converting this Adinkra to canonical form, relative to vertex (0011) (the fifth white vertex from the left in Figure 9).If we order the vertices by height first, then from left to right, step (i) corresponds to the set of vertex lowering operations leading to the Adinkra shown in Figure 10.
Steps (ii) and (iii) correspond to a set of switching operations, permuting the switching state in the following stages, as shown in Figure 11.
Step (iv) then involves the remaining set of transformations, shown in Figure 12.
At this point the Adinkra is now in canonical form.The particular switching state of this resulting Adinkra is unique to choices of source vertices in the same orbit, in this case the set of vertices (0000), (0011), (1110), (1101).

Conclusions and Future Work
This work provides a graph theoretic characterisation of Adinkras, in particular classifying their automorphism groups according to an efficiently computable set of local parameters.In the current work, a number of comparisons are made to previous work.The connection between Adinkras and codes [4] has been reexamined and found to be robust.However, this connection is also exploited to utilise the standard form leading to more computationally efficient algorithms for the study of Adinkras.As well, the observations based on matrix methods used within the context of  =  = 4 [5] have now been extended by a formal proof to all values of  and .Also as emphasised in Section 7, numerical studies up to values of  = 16 provide additional concurrence.These results support the proposal that  0 "chi-null" is a class valued function defined on valise Adinkras.
All nonvalise Adinkras through a series of node raising and lowering can be brought to the form of a valise Adinkra.In this sense  0 is defined for all Adinkras.However, for nonvalise Adinkras,  0 is not sufficient to define classes.For this purpose, the new certificate  A (ℎ, ), where A is an arbitrary Adinkra, seems to fill in a missing gap.
Additionally, the classification method used here is robust in the sense that it can be readily adapted to address a variety of definitions of isomorphism/equivalence, relevant to the particular supersymmetric system of interest.For instance, in Section 6.1 the generalised definition of isomorphism including edge-colour permutations yields a generalised certificate.
8.1.Open Questions.It is the work of future investigations to explore whether these tools ( 0 and  A (ℎ, )) are sufficient to attack the problem of the complete classification of onedimensional off-shell supersymmetrical systems.One obvious future avenue of study is to investigate the role codes play in Gnomon Adinkras [19] and Escheric Adinkras [1].This, as part of continuing to attack the general problem, presents continuing challenges.
Note that when edge-colour permutations are allowed, the calculation of the certificate encoding the isomorphism class of an Adinkra, as detailed in Section 6, is currently more complex, compared to the situation when edge-colour permutations do not preserve isomorphism in that the automorphism group of the doubly even code must also be calculated.One future direction of research is the investigation of the properties of these automorphism groups.It is already known that self-dual doubly even codes have automorphism groups contained in the alternating group [22]; however further properties must be discovered to determine all possible Klein flip degenerate Adinkras in this case.

Figure 2 :
Figure 2: Three Adinkras belonging to the same equivalence class.The first two are isomorphic, whereas the third belongs to a separate isomorphism class.

Figure 3 :
Figure 3: A 3-cube Adinkra shown together with a codeword representation for each vertex.

Figure 5 :
Figure 5: Two equivalent, nonisomorphic Adinkras with the same values of (ℎ, ), for all possible values of ℎ and .
Lemma 28.The elements of the main diagonal of  are nonzero if and only if the path   = ( 1 ,  2 , . . .,   ) represents a closed loop within the Adinkra.This can occur by one of two ways: and only if vertices  and  are connected via a path (, ) (i.e., if  =  ⋅  ⋅ ).Extending to general , if  , ̸ = 0 for some  ∈ , this implies that  is connected to itself via the path   , a closed loop/cycle in .Hence Lemma 27 completes the proof.In case (ii) of Lemma 28, with  , = ±1 for all  ∈ ,  , =  , if and only if  and  have the same inner product with respect to the codeword corresponding to   .