Related papers: Row completion of polynomial and rational matrices
The aim of this note (as well as of the course itself) is to give a largely self-contained proof of two of the main results in the field of low-rank matrix recovery. This field aims for identification of low-rank matrices from only limited…
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…
In this paper, we considered the theory of quasideterminants and row and column determinants. We considered the application of this theory to the solving of a system of linear equations in quaternion algebra. We established correspondence…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.
Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…
Minimal free resolutions of graded modules over a noetherian polynomial ring have been attractive objects of interest for more than a hundred years. We introduce and study two natural extensions in the setting of graded modules over a…
Let $A$ be a real matrix. The term rank of $A$ is the smallest number $t$ of lines (that is, rows or columns) needed to cover all the nonzero entries of $A$. We prove a conjecture of Li et al. stating that, if the rank of $A$ exceeds $t-3$,…
We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
This paper studies the low-rank matrix completion problem from an information theoretic perspective. The completion problem is rephrased as a communication problem of an (uncoded) low-rank matrix source over an erasure channel. The paper…
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…
This paper develops new methods to recover the missing entries of a high-rank or even full-rank matrix when the intrinsic dimension of the data is low compared to the ambient dimension. Specifically, we assume that the columns of a matrix…
We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
We establish the existence and uniqueness of rational conformal maps of minimal degree $n+1$ for opening up $n$ arcs. In earlier results, the degree was exponential in $n$. We also discuss two related problems. (a) We establish existence of…