Related papers: Symmetric Matrices over F_2 and the Lights Out Pro…
Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
In this paper, we describe the entire structure of the vector space $Sym_2^0$ of all symmetric matrices of size $2$ having trace zero. This is motivated by the geometrical interpretation of any arbitrary element of $Sym_2^0$. We further…
We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…
The theory behind the Lights Out game has been developed by several authors. The aim of this work is to present some results related to this game using Linear Algebra. We establish a criterion for the solubility of this game in the case of…
We completely describe all integer symmetric matrices that have all their eigenvalues in the interval [-2,2]. Along the way we classify all signed graphs, and then all charged signed graphs, having all their eigenvalues in this same…
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.
The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. It is a known result…
Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic…
The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling…
We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\boldsymbol{v}$ over a fixed field $\mathbb{F}$ for a specified…
Consider a symmetric (finite) matrix ensemble, with a certain probability distribution. What is the probability that the spectrum belongs to a certain interval or union of intervals on the real line? In this paper, we show that, upon…
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.
In this paper, we provide an algebraic condition on any $2n \times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix in the sense of Williamson's…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
We examine a one-dimensional $\mathcal{PT}$-symmetric binary lattice in the presence of diagonal disorder. We focus on the wave transport phenomena of localized and extended input beams for this disordered system. In the pure…
Let X be a finite set of complex numbers and let A be a normal operator with spectrum X that acts on a separable Hilbert space H. Relative to a fixed orthonormal basis e_1,e_2, ... for H, A gives rise to a matrix whose diagonal is a…