相关论文: Row or column completion of polynomial matrices of…

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…

We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in a previous work when the polynomial…

We study the row completion problem of polynomial and rational matrices with partial prescription of the structural data. The prescription of the complete structural data has been solved in Amparan et al., Lin. Alg. Appl. 720 (2025)…

The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…

We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the…

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…

In this article, we introduce the concept of the column-sufficient W-property for a set of matrices and prove the convexity of the solution set for the Extended Horizontal Linear Complementarity Problem. Additionally, we present an…

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard,…

Efficient resource allocation is one of the main driving forces of human civilizations. Of the many existing approaches to resource allocation, matrix completion is one that is frequently applied. In this paper, we investigate a special…

The column number question asks for the maximal number of columns of an integer matrix with the property that all its rank size minors are bounded by a fixed parameter $\Delta$ in absolute value. Polynomial upper bounds have been proved in…

Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…

In this paper we study the low rank matrix completion problem using tools from Schur complement. We give a sufficient and necessary condition such that the completed matrix is globally unique with given data. We assume the observed entries…

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

In most of today's exactly solved classes of polyominoes, either all members are convex (in some way), or all members are directed, or both. If the class is neither convex nor directed, the exact solution uses to be elusive. This paper is…

This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion…

We show that the {\em column sum optimization problem}, of finding a $(0,1)$-matrix with prescribed row sums which minimizes the sum of evaluations of given functions at its column sums, can be solved in polynomial time, either when all…

We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local $w$-uniqueness of the solutions to the linear complementarity problem can be identified by the column competent matrices.…

We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: under what condition there will be (at least locally) unique solution to the matrix completion…