相关论文: Inversion of the Multiplicative Matrix Compound Op…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…
The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A solution of the problem is given producing a new canonical…
Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
We will study rigorously the notion of mixed states and their density operators (or matrices.) We will also discuss the quantum-mechanical consequences of possible variations of Planck's constant h. This Review has been written having in…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
Matrix completion is a classical problem in data science wherein one attempts to reconstruct a low-rank matrix while only observing some subset of the entries. Previous authors have phrased this problem as a nuclear norm minimization…
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
Let $M$ be a representation of an acyclic quiver $Q$ over an infinite field $k$. We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of $M$. The algorithm is polynomial in the dimensions of $M$, the weights…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…
By modifying the proof of a paper by O. Bournez and M. Branicky, we establish that the Matrix Mortality Problem is decidable with any finite set of $2\times2$ matrices which has at most one invertible matrix. The same modification also…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…
We investigate the relationship between mapping cones and matrix ordered *-vector spaces (i.e., abstract operator systems). We show that to every mapping cone there is an associated operator system on the space of n-by-n complex matrices,…
A preference matrix $M$ has an entry for each pair of candidates in an election whose value $p_{ij}$ represents the proportion of voters that prefer candidate $i$ over candidate $j$. The matrix is rationalizable if it is consistent with a…