Related papers: Spectral decomposition of hypergraph automorphism …
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
We extend the theory of equitable decompositions, in which, if a graph has a particular type of symmetry, i.e. a uniform or basic automorphism $\phi$, it is possible to use $\phi$ to decompose a matrix $M$ appropriately associated with the…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
If F is an automorphism of the spectral unit ball, we show that, in a neighborhood of any cyclic (i.e. non-derogatory) matrix of the ball, the map F can be written as conjugation by a holomorphically varying non singular matrix. This…
We study one and two point functions of conformal field theories on spaces of maximal symmetry with and without boundaries and investigate their spectral representations. Integral transforms are found, relating the spectral decomposition to…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect 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…
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…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
The homotopy type and homotopy groups of some spectra TAF of topological automorphic forms associated to a unitary similitude group GU of type (1,1) are explicitly described in quasi-split cases. The spectrum TAF is shown to be closely…
Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…
This work is concerned with variational analysis of so-called spectral functions and spectral sets of matrices that only depend on eigenvalues of the matrix. Based on our previous work [H. T. B\`ui, M. N. B\`ui, and C. Clason, Convex…
We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…