Related papers: Adinkra Isomorphisms and `Seeing' Shapes with Eige…
Adinkras are a graphical tool 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…
An Adinkra is a class of graphs with certain signs marking its vertices and edges, which encodes off-shell representations of the super Poincar\'e algebra. The markings on the vertices and edges of an Adinkra are cochains for cubical…
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…
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…
We survey the combinatorics of the Adinkra, a graphical device for solving differential equations in supersymmetry. These graphs represent an exceptional class of 1-factorizations with further augmentations. As a new feature, we…
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…
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…
Adinkras are signed graphs used to study supersymmetry in physics. We provide an introduction to these objects, and study the properties of their signed adjacency and signed Laplacian matrices. These matrices each have exactly two distinct…
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…
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 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…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…
Adinkras are highly structured graphs developed to study 1-dimensional supersymmetry algebras. A cyclic ordering of the edge colors of an Adinkra, or rainbow, determines a Riemann surface and a height function on the vertices of the Adinkra…
The problem of classifying off-shell representations of the $N$ -extended one-dimensional super Poincar\'e algebra is closely related to the study of a class of decorated $N$-regular, $N$-edge colored bipartite graphs known as Adinkras. In…
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…
An adinkra is a graph-theoretic representation of spacetime supersymmetry. Minimal four-color valise adinkras have been extensively studied due to their relations to minimal 4D, $\cal N$ = 1 supermultiplets. Valise adinkras, although an…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…