Related papers: Adinkra Isomorphisms and `Seeing' Shapes with Eige…
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…
A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…
In image analysis, many tasks require representing two-dimensional (2D) shape, often specified by a set of 2D points, for comparison purposes. The challenge of the representation is that it must not only capture the characteristics of the…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
Recent efforts to classify representations of supersymmetry with no central charge have focused on supermultiplets that are aptly depicted by Adinkras, wherein every supersymmetry generator transforms each component field into precisely one…
Adinkras are graphical gadgets introduced by physicists to study supersymmetry, which can be thought of as the Cayley graphs for supersymmetry algebras. Improving the result of Iga et al., we determine the critical group of an Adinkra given…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
This paper introduces a polynomial blind algorithm that determines when two square matrices, $A$ and $B$, are permutation similar. The shifted and translated matrices $(A+\beta I+\gamma J)$ and $(B+\beta I+\gamma J)$ are used to color the…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
We present a conceptually simple and intuitive method to calculate and to measure the dissimilarities among 2D shapes. Several methods to interpret and to visualize the resulting dissimilarity matrix are presented and compared.
"Pure" homogeneous linear supermultiplets (minimal and non-minimal) of the N=4-Extended one-dimensional Supersymmetry Algebra are classified. "Pure" means that they admit at least one graphical presentation (the corresponding graph/graphs…
Supersymmetric quantum mechanics is well known to provide, together with the so-called shape invariance condition, an elegant method to solve the eigenvalue problem of some one-dimensional potentials by simple algebraic manipulations. In…
We describe algorithms based on invariant theory to solve problems on the geometry of curves, mainly those of genus 2, 3 and 4. New theoretical results building on the first author's PhD thesis are also included.
We define the concept of self-similarity of an object by considering endomorphisms of the object as `similarity' maps. A variety of interesting examples of self-similar objects in geometry, algebra and arithmetic are introduced.…
This paper first reviews how anti-symmetric matrices in two dimensions yield imaginary eigenvalues and complex eigenvectors. It is shown how this carries on to rotations by means of the Cayley transformation. Then a real geometric…
Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…