Related papers: $k$-Positive Maps: New Characterizations and a Gen…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
We provide new high-accuracy randomized algorithms for solving linear systems and regression problems that are well-conditioned except for $k$ large singular values. For solving such $d \times d$ positive definite system our algorithms…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
The authors in a previous paper devised certain subcones of the semidefinite plus nonnegative cone and showed that satisfaction of the requirements for membership of those subcones can be detected by solving linear optimization problems…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\:f^{\ast}=\min \{\,f(x):x\in K\,\}$ on a compact basic semi-algebraic set $K\subset\R^n$. This hierarchy combines some advantages…
Given a positive integer k, we investigate the class of numerical semigroups verifying the property that every two subsequent non gaps, smaller than the conductor, are spaced by at least k. These semigroups will be called k-sparse and…
In this paper we present a new method for entanglement witnesses construction. We show that to construct such an object we can deal with maps which are not positive on the whole domain, but only on a certain sub-domain. In our approach…
Knowledge graphs (KGs) are typically incomplete and we often wish to infer new facts given the existing ones. This can be thought of as a binary classification problem; we aim to predict if new facts are true or false. Unfortunately, we…
This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of $n$ elements using the fewest possible tests. Non-adaptive…
We provide a universal characterization of the construction taking a scheme $X$ to its stable $\infty$-category $\text{Mot}(X)$ of noncommutative motives, patterned after the universal characterization of algebraic K-theory due to…
We consider 2-positive almost order zero (disjointness preserving) maps on C*-algebras. Generalizing the argument of M. Choi for multiplicative domains, we give an internal characterization of almost order zero for 2-positive maps. It is…
We provide necessary and sufficient conditions for separability of mixed states of n-particle systems. The conditions are formulated in terms of maps which are positive on product states of $n-1$ particles. The method of providing of the…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
The full description of the set of positive maps $T: \qA \to \cB(\cH)$ ($\qA$ a $C^*$-algebra) is given. The approach is based on the simple prescription for selecting various types of positive maps. This prescription stems from the…
This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and…
For a class of linear maps on a von Neumann factor, we associate two objects, bounded operators and trace class operators, both of which play the roles of Choi matrices. Each of them is positive if and only if the original map on the factor…