Related papers: Equality condition for a matrix inequality by part…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
We study entanglement in mixed bipartite quantum states which are invariant under simultaneous SU(2) transformations in both subsystems. Previous results on the behavior of such states under partial transposition are substantially extended.…
Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the…
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods. We discuss these differences and…
The symmetry of the Hamiltonian describing the asymmetric twin model was partially studied in earlier works, and our aim here is to generalize these results for the open transfer matrix. In this spirit we first prove, that the so called…
We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for…
We present a generalized Schmidt decomposition for a pure system with any number of two-level subsystems. The basis is symmetric under the permutation of the parties and is derived from the product state defining the injective tensor norm…
Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on…
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
Joint modeling of a large number of variables often requires dimension reduction strategies that lead to structural assumptions of the underlying correlation matrix, such as equal pair-wise correlations within subsets of variables. The…
We present inequalities related to generalized matrix function for positive semidefinite block matrices. We introduce partial generalized matrix functions corresponding to partial traces, and then provide a unified extension of the recent…
Let $\phi$ be a linear map from the $n\times n$ matrices ${\mathcal M}_n$ to the $m\times m$ matrices ${\mathcal M}_m$. It is known that $\phi$ is $2$-positive if and only if for all $K\in {\mathcal M}_n$ and all strictly positive $X\in…
Given a matrix of distribution functions and a quasi-stochastic matrix, i.e. an irreducible nonnegative matrix with maximal eigenvalue one and associated unique positive left and right eigenvectors, the article studies the properties of an…
We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…
Accretive partial transpose (APT) matrices have been recently defined, as a natural extension of positive partial transpose (PPT) matrices. In this paper, we discuss further properties of APT matrices in a way that extends some of those…
A partial Hadamard matrix is a matrix $H\in M_{M\times N}(\mathbb T)$ whose rows are pairwise orthogonal. We associate to each such $H$ a certain quantum semigroup $G$ of quantum partial permutations of $\{1,...,M\}$ and study the…
Pairwise comparison matrices have received substantial attention in a variety of applications, especially in rank aggregation, the task of flattening items into a one-dimensional (and thus transitive) ranking. However, non-transitive…
By a result of Lundquist-Barrett, it follows that the rank of a positive semi-definite matrix is less than or equal to the sum of the ranks of its principal diagonal submatrices when written in block form. In this article, we take a general…