The WST-decomposition for partial matrices

DOI10.1016/J.LAA.2018.11.028MaRDI QIDQ1715837zbMATH OpenOpenAlexWikidataFDO

Authors Alberto Borobia, Roberto Canogar

Publication date 29 January 2019

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.10825

zbMATH Keywords

completion problemmatrix decompositionpartial matrixrank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Matrix completion problems (15A83)

Abstract: A partial matrix over a field $mathbbF$ is a matrix whose entries are either an element of $mathbbF$ or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in $mathbbF$ to all indeterminates. Given a partial matrix, through elementary row operations and column permutation it can be decomposed into a block matrix of the form $$ where $$ is wide (has more columns than rows), $$ is square, $$ is tall (has more rows than columns), and these three blocks have at least one completion with full rank. And importantly, each one of the blocks $$, $$ and $$ is unique up to elementary row operations and column permutation whenever $$ is required to be as large as possible. When this is the case $$ will be called a WST-decomposition. With this decomposition it is trivial to compute maximum rank of a completion of the original partial matrix: $$. In fact we introduce the WST-decomposition for a broader class of matrices: the ACI-matrices.

Review text

A matrix over \(\mathbb{F} [x_1, \dots, x_k]\), where \(\mathbb{F}\) is a field, is an affine column independent matrix or ACI-matrix if its entries are polynomials of degree at most one and no indeterminate appears in two different columns. A completion of an ACI-matrix is a constant matrix over \(\mathbb{F}\) obtained by assigning values from \(\mathbb{F}\) to its indeterminates. \par The main result that the authors obtain is the following: for any ACI-matrix \(M\) there exists a nonsingular matrix \(R\) and a permutation matrix \(Q\) such that \(RMQ\) is a matrix with the diagonal \(\mathbf{W}\mathbf{S}\mathbf{T}\) and zeros below the diagonal. Here \(\mathbf{W}\), \(\mathbf{S}\) and \(\mathbf{ T}\) are ACI-matrices, \(\mathbf{W}\) is wide (has more columns than rows), \(\mathbf{S}\) is square, \(\mathbf{T}\) is tall (has more rows than columns), and with these three blocks having at least one completion with full rank. These matrices are unique up to equivalence if \(\mathbf{S}\) is as large as possible for such a decomposition. Also, \(\mathbf{W}\), \(\mathbf{S}\) and \(\mathbf{T}\) are unique up to elementary row operations and column permutations.

Recommendations

• ACI-matrices all of whose completions have the same rank
• Singular, nonsingular, and bounded rank completions of ACI-matrices
• Partial matrices whose completions have ranks bounded below
• ACI-matrices of constant rank over arbitrary fields
• Nonsingular ACI-matrices over integral domains

Cites work

• ACI-matrices all of whose completions have the same rank
• ACI-matrices of constant rank over arbitrary fields
• Characterization of full rank ACI-matrices over fields
• scientific article; zbMATH DE number 4107004 (Why is no real title available?)
• Nonsingular ACI-matrices over integral domains
• Partial matrices of constant rank
• Singular, nonsingular, and bounded rank completions of ACI-matrices

Cited in

(1)

• On simplifying the matrix of a wff

This page was built for publication: The WST-decomposition for partial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715837)