相关论文: Principal pivot transforms: properties and applica…

In bipartite quantum systems of dimension 3x3 entangled states that are positive under partial transposition (PPT) can be constructed with the use of unextendible product bases (UPB). As discussed in a previous publication all the lowest…

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…

We consider sensitivity of a semidefinite program under perturbations in the case that the primal problem is strictly feasible and the dual problem is weakly feasible. When the coefficient matrices are perturbed, the optimal values can…

We investigate behavior of principal curvatures and principal vectors near a non-degenerate singular point of the first kind of frontals. As an application, we extend the notion of Ribaucour transformations to frontals with singular points.

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

Invariant coordinate selection is an unsupervised multivariate data transformation useful in many contexts such as outlier detection or clustering. It is based on the simultaneous diagonalization of two affine equivariant and positive…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

We study, from a combinatorial viewpoint, the quantized coordinate ring of mxn matrices over an infinite field K (also called quantum matrices) and its torus-invariant prime ideals. The first part of this paper shows that this algebra,…

This paper investigates spectral properties of certain classes of positive operators originated from different matrices appeared in linear complementarity problem. These positive operators play a crucial role in various areas of mathematics…

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…

Principal component analysis is a ubiquitous tool in exploratory data analysis. It is widely used by applied scientists for visualization and interpretability purposes. We raise an important issue (the curse of isotropy) about the…

In this note, we discuss dilation-theoretic matrix parametrizations of contractions and positive matrices. These parametrizations are then applied to some problems in quantum information theory. First we establish some properties of…

Inverse categories are categories in which every morphism x has a unique pseudo-inverse y in the sense that xyx=x and yxy=y. Persistence modules from topological data analysis and similarly decomposable category representations factor…

Principal component analysis is a versatile tool to reduce dimensionality which has wide applications in statistics and machine learning. It is particularly useful for modeling data in high-dimensional scenarios where the number of…

This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…

Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a…

Sylvester's criterion characterizes positive definite (PD) and positive semidefinite (PSD) matrices without the need of eigendecomposition. It states that a symmetric matrix is PD if and only if all of its leading principal minors are…

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

The problem of when the vanishing of a (generalized) Schur complement of a block matrix (corresponding to the leading principal subblock) implies that the other (generalized) Schur complement (corresponding to the trailing principal…