相关论文: On positive decomposable maps

In this paper, we discuss positive maps induced by (irreducibly) covariant linear operators for finite groups. The application of group theory methods allows deriving some new results of a different kind. In particular, a family of…

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…

We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song et al.) are in fact known. We also present a new type of question in this area.

In this paper, we reproduce experimental results presented in our earlier work titled "In-processing User Constrained Dominant Sets for User-Oriented Fairness in Recommender Systems" that was presented in the proceeding of the 31st ACM…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

We study mapping cones and their dual cones of positive maps of the n by n matrices into itself. For a natural class of cones there is a close relationship between maps in the cone, super-positive maps, and separable states. In particular…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

This note is to indicate the new sphere of applicability of the method developed by Mlak as well as by the author. Restoring those ideas is summoned by current developments concerning $K$-spectral sets on numerical ranges.

This short introduction to positive geometries, targeted at a mathematical audience, is based on my talk at OPAC 2022.

We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

Accurately attributing answer text to its source document is crucial for developing a reliable question-answering system. However, attribution for long documents remains largely unexplored. Post-hoc attribution systems are designed to map…

By a result of Blokh from 1984, every transitive map of a tree has the relative specification property, and so it has finite decomposition ideal, positive entropy and dense periodic points. In this paper we construct a transitive dendrite…

This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…

Several problems concerning separable states are clarified on the basis of Choi's scheme and old Kadison and Tomiyama results. Moreover, we generalize Terhal's construction of positive maps.

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.

This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…

These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…