相关论文: Criteria of positivity for linear maps constructed…

An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space…

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…

For a permutation $\pi: [K]\rightarrow [K]$, a sequence $f: \{1,2,\cdots, n\}\rightarrow \mathbb R$ contains a $\pi$-pattern of size $K$, if there is a sequence of indices $(i_1, i_2, \cdots, i_K)$ ($i_1<i_2<\cdots<i_K$), satisfying that…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

We provide a partial classification of positive linear maps in matrix algebras which is based on a family of spectral conditions. This construction generalizes celebrated Choi example of a map which is positive but not completely positive.…

An alternating permutation of length $n$ is a permutation $\pi=\pi_1 \pi_2 ... \pi_n$ such that $\pi_1 < \pi_2 > \pi_3 < \pi_4 > ...$. Let $A_n$ denote set of alternating permutations of ${1,2,..., n}$, and let $A_n(\sigma)$ be set of…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

Let $M_{m,n}$ be the space of $m\times n$ real or complex rectangular matrices. Two matrices $A, B \in M_{m,n}$ are disjoint if $A^*B = 0_n$ and $AB^* = 0_m$. In this paper, a characterization is given for linear maps $\Phi: M_{m,n}…

Using pure entangled Schmidt states, we show that m-positivity of a map is bounded by the ranks of its negative Kraus matrices. We also give an algebraic condition for a map to be m-positive. We interpret these results in the context of…

Let $\pi$ be a permutation of $\{1,2,\ldots,n\}$. If we identify a permutation with its graph, namely the set of $n$ dots at positions $(i,\pi(i))$, it is natural to consider the minimum $L^1$ (Manhattan) distance, $d(\pi)$, between any…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

In this paper, we generalize some matrix inequalities involving matrix power and Karcher means of positive definite matrices. Among other inequalities, it is shown that if ${\mathbb A}=(A_{1},...,A_{n})$ is a $n$-tuple of positive definite…

For $N\in\mathbb{N}$, let $\pi_N$ be the law of the number of fixed points of a random permutation of $\{1, 2, ..., N\}$. Let $\mathcal{P}$ be a Poisson law of parameter 1.A classical result shows that $\pi_N$ converges to $\mathcal{P}$ for…

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

We generalize a preceding simple proof of the Jamiolkowski criterion to check whether a given linear map between algebras of operators is completely positive or not. The generalization is performed to embrace all algebras of Hilbert-Schmidt…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

We consider the tensorial Schur product $R \circ^\otimes S = [r_{ij} \otimes s_{ij}]$ for $R \in M_n(\mathcal{A}), S\in M_n(\mathcal{B}),$ with $\mathcal{A}, \mathcal{B}$ unital $C^*$-algebras, verify that such a `tensorial Schur product'…

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

Let $(X, d)$ be a semimetric space. A permutation $\Phi$ of the set $X$ is a combinatorial self similarity of $(X, d)$ if there is a bijective function $f \colon d(X^2) \to d(X^2)$ such that $$ d(x, y) = f(d(\Phi(x), \Phi(y))) $$ for all…

Given positive numbers p_1 < p_2 < ... < p_n, and a real number r let L_r be the n by n matrix with its (i,j) entry equal to (p_i^r-p_j^r)/(p_i-p_j). A well-known theorem of C. Loewner says that L_r is positive definite when 0 < r < 1. In…