Adinkra Isomorphisms and `Seeing' Shapes with Eigenvalues

preprint2012arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.