Related papers: Constructing all self-adjoint matrices with prescr…
We produce a new proof and extend results by Harrell and Stubbe for the discrete spectrum of a self-adjoint operator. An abstract approach--based on commutator algebra, the Rayleigh-Ritz principle, and an ``optimal'' usage of the…
The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
The Nystrom method is an efficient technique to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by…
In this paper we show how to construct diagonal scalings for arbitrary matrix pencils $\lambda B-A$, in which both $A$ and $B$ are complex matrices (square or nonsquare). The goal of such diagonal scalings is to "balance" in some sense the…
It is shown that a $N\times N$ real symmetric [complex hermitian] positive definite matrix $V$ is congruent to a diagonal matrix modulo a pseudo-orthogonal [pseudo-unitary] matrix in $SO(m,n)$ [ $SU(m,n)$], for any choice of partition…
An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a…
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation…
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…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
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.…
Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the…
The permanent-on-top conjecture states that the largest eigenvalue of the Schur power matrix of a positive semi-definite Hermitian matrix H is per(H). A counterexample has been found with the help of computers, but here, I present another…
To any $V$ in the Grassmannian ${\rm Gr}_k({\mathbb R}^n)$ of $k$-dimensional vector subspaces in ${\mathbb R}^n$ one can associate the diagonal entries of the ($n\times n$) matrix corresponding to the orthogonal projection of ${\mathbb…
The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
We propose to build a combinatorial invariant, called the spectral monodromy, from the spectrum of a single non-selfadjoint h-pseudodifferential operator with two degrees of freedom in the semi-classical limit. Our inspiration comes from…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively…
The purpose of this article is to improve existing lower bounds on the chromatic number chi. Let mu_1,...,mu_n be the eigenvalues of the adjacency matrix sorted in non-increasing order. First, we prove the lower bound chi >= 1 + max_m…
Carsten Thomassen in 1989 conjectured that if a graph has minimum degree more than the number of atoms in the universe ($\delta(G)\ge 10^{10^{10}}$), then it contains a pillar, which is a graph that consists of two vertex-disjoint cycles of…