Related papers: On Agaian Matrix
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…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
Motivated by a problem of Halmos, we obtain a canonical decomposition for complex matrices which are unitarily equivalent to their transpose (UET). Surprisingly, the naive assertion that a matrix is UET if and only if it is unitarily…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…
Complex Hadamard matrices have received considerable attention in the past few years due to their appearance in quantum information theory. While a complete characterization is currently available only up to order 5 (in \cite{haagerup}),…
In this paper, we study the problem of detecting multiple hidden submatrices in a large Gaussian random matrix when the planted signal is inhomogeneous across entries. Under the null hypothesis, the observed matrix has independent and…
We show that the novel one-way photonic modal conversion effect, as demonstrated by Feng et al (Reports, 11 August, 2011, p. 729), is insufficient in itself to enable optical isolation, since the underlying dielectric structure possesses a…
This paper is devoted to integrability conditions for systems of linear difference and differential equations with difference parameters. It is shown that such a system is difference isomonodromic if and only if it is difference…
In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…
It is argued that experimental constraints on theories of asymmetric dark matter (ADM) almost certainly require that the DM be part of a richer hidden sector of interacting states of comparable mass or lighter. A general requisite of models…
An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…
We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…
We construct new pairs of orthogonal maximal abelian $*$-subalgebras of $M_6(\mathbb C)$, by classifying all self-adjoint complex Hadamard matrices of order 6. In particular, we exhibit a non-affine one-parameter family of non-equivalent…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…