Related papers: Checking the strict positivity of Kraus maps is NP…

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

We study the combinatorial and algebraic properties of Nonnegative Matrices. Our results are divided into three different categories. 1. We show a quantitative generalization of the 100 year-old Perron-Frobenius theorem, a fundamental…

We investigate elementary topological properties of sets of completely positive (CP) maps that arise in quantum Perron-Frobenius theory. We prove that the set of primitive CP maps of fixed Kraus rank is path-connected and we provide a…

For matrices with all nonnegative entries, the Perron-Frobenius theorem guarantees the existence of an eigenvector with all nonnegative components. We show that the existence of such an eigenvector is also guaranteed for a very different…

If A is a nonnegative matrix whose associated directed graph is strongly connected, the Perron-Frobenius theorem asserts that A has an eigenvector in the positive cone, (R^+)^n. We associate a directed graph to any homogeneous, monotone…

We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to…

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…

Using the Perron-Frobenius eigenfunction and eigenvalue, each finite irreducible nonnegative matrix $A$ can be transformed into a probability kernel $P$. This was generalized by David Vere-Jones who gave necessary and sufficient conditions…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

We derive a generalization of the Perron-Frobenius theorem to time-varying row-stochastic matrices as follows: using Kolmogorov's concept of absolute probability sequences, which are time-varying analogs of principal eigenvectors, we…

We give a simple direct proof of the Jamiolkowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accesible for physicists than others found in the literature and provides a…

We prove that if an $n\times n$ matrix defined over ${\mathbb Q}_p$ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in…

The classical Perron-Frobenius theory asserts that for two matrices $A$ and $B$, if $0\leq B \leq A$ and $r(A)=r(B)$ with $A$ being irreducible, then $A=B$. This was recently extended in Bernik et al. (2012) to positive operators on…

Let $\phi$ be a linear map from the $n\times n$ matrices ${\mathcal M}_n$ to the $m\times m$ matrices ${\mathcal M}_m$. It is known that $\phi$ is $2$-positive if and only if for all $K\in {\mathcal M}_n$ and all strictly positive $X\in…

We introduce the notion of order-preserving multi-homogeneous mapping which allows to study Perron-Frobenius type theorems and nonnegative tensors in unified fashion. We prove a weak and strong Perron-Frobenius theorem for these maps and…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

We investigate the computational complexity of the graph primality testing problem with respect to the direct product (also known as Kronecker, cardinal or tensor product). In [1] Imrich proves that both primality testing and a unique prime…

We use fixed point theory to analyze nonnegative neural networks, which we define as neural networks that map nonnegative vectors to nonnegative vectors. We first show that nonnegative neural networks with nonnegative weights and biases can…

We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that…

The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…