Related papers: Sign pattern matrices associated with cycle graphs…
In this paper, we introduce a large class of (so-called) conditional indicators, on a complete probability space with respect to a sub $\sigma$-algebra. A conditional indicator is a positive mapping, which is not necessary linear, but may…
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms…
A matrix $A\in \mathbb{R}^{m \times n}$ is strictly sign regular/SSR (or sign regular/SR) if for each $1 \leq k \leq \min\{m,n\}$, all (non-zero) $k\times k$ minors of $A$ have the same sign. This class of matrices contains the totally…
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…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
Some real functions f induce mean of positive numbers and the matrix monotonicity gives a possibility for means of positive definite matrices. Moreover, such a function f can define linear mapping beta on matrices (which is basic in the…
Let the matching polynomial of a graph $G$ be denoted by $\mu (G,x)$. A graph $G$ is said to be $\theta$-super positive if $\mu(G,\theta)\neq 0$ and $\mu(G\setminus v,\theta)=0$ for all $v\in V(G)$. In particular, $G$ is 0-super positive if…
It can be shown that any symmetric $(0,1)$-matrix $A$ with $\tr A = 0$ can be interpreted as the adjacency matrix of a simple, finite graph. The square of an adjacency matrix $A^2=(s_{ij})$ has the property that $s_{ij}$ represents the…
We give conditions for when the tensor product of two positive maps between matrix algebras is a positive map. This happens when one map belongs to a symmetric mapping cone and the other to the dual cone. Necessary and sufficient conditions…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
A "signed graph" is a graph $\Gamma$ where the edges are assigned sign labels, either "$+$" or "$-$". The sign of a cycle is the product of the signs of its edges. Let $\mathrm{SpecC}(\Gamma)$ denote the list of lengths of cycles in…
Given a real symmetric $n\times n$ matrix, the sepr-sequence $t_1\cdots t_n$ records information about the existence of principal minors of each order that are positive, negative, or zero. This paper extends the notion of the sepr-sequence…
We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…
A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is nonzero, and the entry in the top-right corner is nonzero.…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide…
The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy…
A signed complete graph contains both positive and negative Hamiltonian cycles if and only if it also contains both positive and negative triangles. Otherwise, all Hamiltonian cycles are negative if and only if all triangles are negative…
We obtain a necessary and sufficient condition for an algebraic set in a group to have a fully characteristic radical. As a result, we see that if the radical of a system of equation $S$ over a group $G$ is fully characteristic, then there…