Related papers: Adinkra Isomorphisms and `Seeing' Shapes with Eige…
Adinkra networks arise in the Carroll limit of supersymmetric QFT. Extensions of adinkras that are infinite dimensional graphs have never previously been discussed in the literature. We call these "infinite unfolded'' adinkras and study the…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…
We explain how the redefinitions of supermultiplet component fields, comprising what we call "frame shifts", can be used in conjuction with the graphical technology of multiplet Adkinras to render manifest the reducibility of off-shell…
In our previous paper math/0502157 we classified a large class of finite-dimensional pointed Hopf algebras up to isomorphism. However the following problem was left open for Hopf algebras of of type $A,D$ or $E_6$, that is whose Cartan…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
Adinkras are graphical representations of the gauge invariant field components in supersymmetric theories and their orbits under the action of supersymmetry (SUSY) generators in the context of supermultiplets. A discussion is given that…
We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
We provide an algorithm for detecting the involutions leaving a surface defined by a polynomial parametrization invariant. As a consequence, the symmetry axes, symmetry planes and symmetry center of the surface, if any, can be determined…
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…
An ordering of colours in an Adinkra leads to an embedding of this Adinkra into a Riemann surface $X$, and a branched covering map $\beta_X:X\to\mathbb{CP}^1$. This paper shows how the dashing of edges in an Adinkra determines a signed…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
Although eigenspectra of one dimensional shape invariant potentials with unbroken supersymmetry are easily obtained, this procedure is not applicable when the parameters in these potentials correspond to broken supersymmetry, since there is…
We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…