Related papers: Adinkra Isomorphisms and `Seeing' Shapes with Eige…
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge.…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
Motivated by the search for embedded on-shell supermultiplets in higher dimensional off-shell theories, we investigate several 16-color supermultiplets and their topology. An Adinkra's topology is known to be equivalent to…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We present further progress toward a complete classification scheme for describing supermultiplets of N-extended worldline supersymmetry, which relies on graph-theoretic topological invariants. In particular, we demonstrate a relationship…
The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
We associate an square to any two dimensional evolution algebra. This geometric object is uniquely determined, does not depend on the basis and describes the structure and the behaviour of the algebra. We determine the identities of degrees…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
We study creating and analyzing symmetry and broken symmetry in digital art. Our focus is not so much on computer-generating artistic images, but rather on analyzing concepts and templates for incorporating symmetry and symmetry breaking…
Isoclinism of Lie superalgebras has been defined and studied currently. In this article it is shown that for finite dimensional Lie superalgebras of same dimension, the notation of isoclinism and isomorphism are equivalent. Furthermore we…
We establish shape holomorphy results for general weakly- and hyper-singular boundary integral operators arising from second-order partial differential equations in unbounded two-dimensional domains with multiple finite-length open arcs.…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We study the symmetry properties of autonomous integrating factors from an algebraic point of view. The symmetries are delineated for the resulting integrals treated as equations and symmetries of the integrals treated as functions or…
This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…
We investigate the spectral geometry and spectral action functionals associated to 1D Supersymmetry Algebras, using the classification of these superalgebras in terms of Adinkra graphs and the construction of associated dessin d'enfant and…
Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
Symmetries play an critical role in finding analytic solutions to nonlinear differential equations. A symmetry is a mapping of the solutions of the differential equation into the solutions and have been studied extensively for over a…