Related papers: $k$-Positive Maps: New Characterizations and a Gen…

We construct a family of map which is shown to be positive when imposing certain condition on the parameters. Then we show that the constructed map can never be completely positive. After tuning the parameters, we found that the map still…

Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a sufficient condition for a positive map to be exposed. This is an analog of a spanning property which guaranties that a positive map is optimal.…

We present an optimization procedure for a seminal class of positive maps $\tau_{n,k}$ in the algebra of $n \times n$ complex matrices introduced and studied by Tanahasi and Tomiyama, Ando, Nakamura and Osaka. Recently, these maps were…

We initiate a study of linear maps on $M_n(\mathbb{C})$ that have the property that they factor through a tracial von Neumann algebra $(\mathcal{A,\tau})$ via operators $Z\in M_n(\mathcal{A})$ whose entries consist of positive elements from…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

An $m \times n$ matrix $\mathsf{A}$ with column supports $\{S_i\}$ is $k$-separable if the disjunctions $\bigcup_{i \in \mathcal{K}} S_i$ are all distinct over all sets $\mathcal{K}$ of cardinality $k$. While a simple counting bound shows…

Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…

Positive systems play an important role in systems and control theory and have found many applications in multi-agent systems, neural networks, systems biology, and more. Positive systems map the nonnegative orthant to itself (and also the…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

We extend \cite{chen2025srkbp} by analyzing the complexity of the $k$-block-positivity testing algorithm that stems from the optimization problem in Definition \ref{definition:SDP-k-block-positivity}. In this paper, we investigate a…

Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…

Hilbert polynomials have positivity properties under favorable conditions. We establish a similar "K-theoretic positivity" for matroids. As an application, for a multiplicity-free subvariety of a product of projective spaces such that the…

We construct a new class of positive indecomposable maps in the algebra of `d x d' complex matrices. These maps are characterized by the `weakest' positivity property and for this reason they are called atomic. This class provides a new…

We answer in the affirmative a recently-posed question that asked if there exists an "untypical" convex mapping cone -- i.e., one that does not arise from the transpose map and the cones of k-positive and k-superpositive maps. We explicitly…

We propose a flexible and theoretically supported framework for scalable nonnegative matrix factorization. The goal is to find nonnegative low-rank components directly from compressed measurements, accessing the original data only once or…

A linear dynamical system is called positive if its flow maps the non-negative orthant to itself. More precisely, it maps the set of vectors with zero sign variations to itself. A linear dynamical system is called $k$-positive if its flow…

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…

This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…

We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…