Related papers: Exposed positive maps: a sufficient condition
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
We consider the maximal p-norm associated with a completely positive map and the question of its multiplicativity under tensor products. We give a condition under which this multiplicativity holds when p = 2, and we describe some maps which…
Let $X$ be a smooth projective variety. Define a stable map $f:C\to X$ to be "eventually smoothable" if there is an embedding $X\hookrightarrow\mathbb{P}^N$ such that $(C,f)$ occurs as the limit of a $1$-parameter family of stable maps to…
We discuss the use of Kaniadakis' $\kappa$-exponential in the construction of a statistical manifold modelled on Lebesgue spaces of real random variables. Some algebraic features of the deformed exponential models are considered. A chart is…
This chapter is an introduction to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem.
This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…
We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…
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,…
In this paper we consider the unbounded local completely positive and local completely contractive maps on maximal tensor product of unital locally C*-algebras and discuss on extremal points of certain convex subsets in the set of such…
We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also…
In \cite{CMW19}, the authors introduced $k$-entanglement breaking linear maps to understand the entanglement breaking property of completely positive maps on taking composition. In this article, we do a systematic study of $k$-entanglement…
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
This is a revised form of the previous paper in which we study cones of positive maps of B(H) into itself. We add the result that the dual cone of a symmetric mapping cone is itself a symmetric mapping cone. As applications we obtain…
We present a large class of indecomposable exposed positive linear maps between three dimensional matrix algebras. We also construct two qutrit separable states with lengths ten in the interior of their dual faces. With these examples, we…
The new paper will be submitted.
An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we…
For a 2-dimensional map representing an expanding geometric Lorenz at- tractor we prove that the attractor is the closure of a union of as long as possible unstable leaves with ending points. This allows to define the notion of good…