Adjacency preservers, symmetric matrices, and cores
نویسندگان
چکیده
منابع مشابه
Adjacency preservers, symmetric matrices, and cores
It is shown that the graph Γn that has the set of all n× n symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if n≥ 3. Eigenvalues of the graph Γn are calculated as well.
متن کاملTotally Positive Density Matrices and Linear Preservers
The intersection between the set of totally nonnegative matrices, which are of interest in many areas of matrix theory and its applications, and the set of density matrices, which provide the mathematical description of quantum states, are investigated. The single qubit case is characterized, and several equivalent conditions for a quantum channel to preserve the set in that case are given. Hig...
متن کاملGeneralized Doubly Stochastic Matrices and Linear Preservers
A real or complex n × n matrix is generalized doubly stochastic if all of its row sums and column sums equal one. Denote by V the linear space spanned by such matrices. We study the reducibility of V under the group Γ of linear operators of the form A 7→ PAQ, where P and Q are n×n permutation matrices. Using this result, we show that every linear operator φ : V → V mapping the set of generalize...
متن کاملPreservers of term ranks and star cover numbers of symmetric matrices
Let Sn(S) denote the set of symmetric matrices over some semiring, S. A line of A ∈ Sn(S) is a row or a column of A. A star of A is the submatrix of A consisting of a row and the corresponding column of A. The term rank of A is the minimum number of lines that contain all the nonzero entries of A. The star cover number is the minimum number of stars that contain all the nonzero entries of A. Th...
متن کاملLaplacian and the Adjacency Matrices
Proof. We first recall that every non-singular matrix B can be written B = QR, where Q is an orthonormal matrix Q and R is upper-triangular matrix R with positive diagonals1 We will use a slight variation of this fact, writing B = RQ. Now, since QT = Q−1, QAQT has exactly the same eigenvalues as A. Let Rt be the matrix t ∗R+ (1− t)I, and consider the family of matrices Mt = RtQAQR t , as t goes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2011
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-011-0318-0