Related papers: Linear maps on nonnegative symmetric matrices pres…

Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…

Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $\phi: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(\phi(A_1\otimes \cdots \otimes…

We introduce a property of a matrix-valued linear map $\Phi$ that we call its "non-m-positive dimension" (or "non-mP dimension" for short), which measures how large a subspace can be if every quantum state supported on the subspace is…

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…

Let $MIS(G)$ be the set of all maximal independent sets in a graph $G$, and let $mis(G)=|MIS(G)|$. In this paper, we show that for any tree $T$ with $n$ vertices and independence number $\alpha$, \[mis(T)\geq f(n-\alpha),\] and for any…

A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Let $f$ bea noncommutativepolynomial of degree $m\ge 1$ over an algebraically closed field $F$ of characteristic $0$. If $n\ge m-1$ and $\alpha_1,\alpha_2,\alpha_3$ are nonzero elements from $F$ such that $\alpha_1+\alpha_2+\alpha_3=0$,…

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we…

Let $\pi(A)$, $\xi(A)$ and $\nu(A)$, respectively, denote the number of positive, zero and negative eigenvalues of the matrix $A$. Then the triplet $(\pi(A), \xi(A), \nu(A))$ is called the \emph{inertia} of $A$ and is denoted by…

We investigate alternating sign matrices that are not permutation matrices, but have finite order in a general linear group. We classify all such examples of the form $P+T$, where $P$ is a permutation matrix and $T$ has four non-zero…

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

An n x n permutative matrix is a matrix in which every row is a permutation of the first row. In this paper the result given by Paparella in [Electron. J. Linear Algebra 31 (2016) 306-312] is extended to a more general lists of real and…

Let $H_{n}^{+}(\mathbb{R})$ be the cone of all positive semidefinite $n\times n$ real matrices. We describe the form of all surjective maps on $H_{n}^{+}(\mathbb{R}) $, $n\geq 3$, that preserve the minus partial order in both directions.

In this paper a complete description of the linear maps $\phi:W_{n}\rightarrow W_{n}$ that preserve the Lorentz spectrum is given when $n=2$ and $W_{n}$ is the space $M_{n}$ of $n\times n$ real matrices or the subspace $S_{n}$ of $M_{n}$…

A method is obtained to compute the maximum number of functionally independent invariant functions under the action of a linear algebraic group as long as its Lie algebra admits a base of square-zero matrices. Some applications are also…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…