Related papers: Linear maps on nonnegative symmetric matrices pres…

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…

Let $X$ be a character table of the symmetric group $S_n$. It is shown that unless $n = 4$ or $n=6$, there is a unique way to assign partitions of $n$ to the rows and columns of $X$ so that for all $\lambda$ and $\nu$, $X_{\lambda\nu}$ is…

Given a suitable collection of partitions of sets, there exists a connection to easy quantum groups via intertwiner maps. A sufficient condition for this correspondence to be one-to-one are particular linear independences on the level of…

A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…

A graph with at most two vertices of the same degree is called antiregular (Merris 2003), maximally nonregular (Zykov 1990) or quasiperfect (Behzad, Chartrand 1967). If s_{k} is the number of independent sets of cardinality k in a graph G,…

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Given an admissible map F for a homogeneous network N, it is known that the Jacobian DF(x) around a fully synchronous point x = (x0, ..., x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible…

Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…

Let $A$ be a nonnegative symmetric $ 5 \times 5 $ matrix with eigenvalues $ \lambda_1 \geq \lambda_2 \geq \lambda_3 \geq \lambda_4 \geq \lambda_5 $. We show that if $ \sum_{i=1}^{5} \lambda_{i} \geq \frac{1}{2} \lambda_1 $ then $ \lambda_3…

We consider a new class of matrices associated to a real square matrix $A$ and to a vector $\vec{c} \in \{-1,1\}^n$ such that $c_1=1$ by using a map $\varphi_{\vec{c}}$ which turns out to be a conjugation of a matrix $A$ by a signature…

We consider products of independent square non-Hermitian random matrices. More precisely, let X(1),...,X(n) be random matrices with independent entries (real or complex with independent real and imaginary parts) with zero mean and variance…

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 prove…

Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

A well known upper bound for the independence number $\alpha(G)$ of a graph $G$, is that \[ \alpha(G) \le n^0 + \min\{n^+ , n^-\}, \] where $(n^+, n^0, n^-)$ is the inertia of $G$. We prove that this bound is also an upper bound for the…

The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…