Related papers: Inversion of the Multiplicative Matrix Compound Op…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
We study sums of $k$-potent matrices. We show the conditions by which a complex matrix $A$ can be expressed as a sums of $k$-potent matrices. Also we obtain conditions by which a complex matrix $A$ can be expressed as a sum of finite order…
We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…
A formula is given for the propagation of errors during matrix inversion. An explicit calculation for a 2 by 2 matrix using both the formula and a Monte Carlo calculation are compared. A prescription is given to determine when a matrix with…
We determine a necessary and sufficient condition for a polynomial over an algebraically closed field $k$ to induce a surjective map on matrix algebras $M_n(k)$ for $n \ge 2$. The criterion is given in terms of critical points and uses…
In the matroid secretary problem, elements $N := [n]$ of a matroid $\mathcal{M} \subseteq 2^N$ arrive in random order. When an element arrives, its weight is revealed and a choice must be made to accept or reject the element, subject to the…
The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Manifold regularization methods for matrix factorization rely on the cluster assumption, whereby the neighborhood structure of data in the input space is preserved in the factorization space. We argue that using the k-neighborhoods of all…
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…
The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
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…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…
It is well-understood that the robustness of mechanical and robotic control systems depends critically on minimizing sensitivity to arbitrary application-specific details whenever possible. For example, if a system is defined and performs…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…