Adinkra Isomorphisms and `Seeing' Shapes with Eigenvalues
  We create an algorithm to determine whether any two graphical representations (adinkras) of equations possessing the property of supersymmetry in one or two dimensions are isomorphic in shape. The algorithm is based on the determinant of `permutation matrices' that are defined in this work and derivable for any adinkra. 
Keith Burghardt, and S. James Gates Jr
hep-th math-ph math.MP