Related papers: Adjacency preserving mappings on real symmetric ma…

A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of…

A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is…

We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…

The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…

In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…

Let \phi((x_1,x_2),(y_1,y_2))=(x_1-y_1)^2+(x_2-y_2)^2. We say that f:R^2 -> C^2 preserves distance d>=0 if for each x,y \in R^2 \phi(x,y)=d^2 implies \phi(f(x),f(y))=d^2. We prove that if x,y \in R^2 and |x-y|=(2\sqrt{2}/3)^k \cdot…

In this paper, all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $2$ and $-1$ are determined. These graphs conclude a class of generalized friendship graphs $F_{t,r,k}, $ which is the…

An order-preserving Freiman 2-isomorphism is a map $\phi:X \rightarrow \mathbb{R}$ such that $\phi(a) < \phi(b)$ if and only if $a < b$ and $\phi(a)+\phi(b) = \phi(c)+\phi(d)$ if and only if $a+b=c+d$ for any $a,b,c,d \in X$. We show that…

After introducing the different boundary geometries of rank one symmetric spaces, we state and prove Fried's theorem in the general setting of all those geometries: a closed manifold with a similarity structure is either complete or the…

Let $\mathcal A$ and $\mathcal B$ be two (complex) algebras. A linear map $\phi:{\mathcal A}\to{\mathcal B}$ is called $n$-homomorphism if $\phi(a_{1}... a_{n})=\phi(a_{1})...\phi(a_{n})$ for each $a_{1},...,a_{n}\in{\mathcal A}.$ In this…

We study on what conditions on $B_k,$ \ a linear transformation of rank $r$ \label{form} T(A)=\sum_{k=1}^r\tr(AB_k)U_k where $U_k,\ k=1,2,..., r$ are linear independent and all positive definite; is positive definite preserving. We give…

Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, other…

Explicit expressions for the concurrence of all positive and trace-preserving ("stochastic") 1-qubit maps are presented. By a new method we find the relevant convex roof pattern. We conclude that two component optimal decompositions always…

Let $F$ be a field, and $\mathcal{M}$ be a linear subspace of $n$-by-$n$ matrices with entries in $F$ that have at most two eigenvalues in $F$ (respectively, at most one non-zero eigenvalue in $F$). In a previous article, we have determined…

Linear maps preserving pure states of a quantum system of any dimension are characterized. This is then used to establish a structure theorem for linear maps that preserve separable pure states in multipartite systems. As an application, a…

We study diffeomorphisms that have one-parameter families of continuous symmetries. For general maps, in contrast to the symplectic case, existence of a symmetry no longer implies existence of an invariant. Conversely, a map with an…

This work characterizes the general form of a bijective linear map $\Psi:\mathscr{M}_n(\mathbb{C}) \to \mathscr{M}_n(\mathbb{C})$ such that $[\Psi(A_1),~\Psi(A_2)]=D_2$ whenever $[A_1,~A_2]=D_1$ where $D_1~\text{and}~D_2$ are fixed…

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant…

We consider T(x), a tensor of arbitrary rank that is symmetric in all of its indices and conserved in the sense that the divergence on any one index vanishes. Our conjecture is that all integral moments of this tensor will vanish if the…