Matrix Completion Theorems

DOI10.2307/2044947MaRDI QIDQ3677871zbMATH OpenOpenAlexFDO

Authors Morris Newman

Publication date 1985

Full work available at URL https://doi.org/10.2307/2044947

zbMATH Keywords

completingembeddingmatrices over a principal ideal ringmultiplicative commutator

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Matrices of integers (15B36)

Recommendations

• scientific article; zbMATH DE number 5526608
• Polynomial matrices with given determinant
• Similarity and commutators of matrices over principal ideal rings
• An Answer to a Question of M. Newman on Matrix Completion
• Completing row over commutative Bezout ring to matrix determinant of which one is the greatest common divisor of all elements of this row.

Cites work

• scientific article; zbMATH DE number 3009965 (Why is no real title available?)
• scientific article; zbMATH DE number 3401090 (Why is no real title available?)
• Symmetric Completions and Products of Symmetric Matrices
• Symplectic Modular Complements
• Über die analytische Theorie der quadratischen Formen

Cited in

(16)

• On a question of M. Newman on the number of commutators
• Jordan form of a binomial coefficient matrix over \(Z_ p\)
• Matrix completions for linear matrix equations
• Polynomial matrices with given determinant
• Completing any low-rank matrix, provably
• Completing row over commutative Bezout ring to matrix determinant of which one is the greatest common divisor of all elements of this row.
• Invertible commutators in matrix rings
• Linear groups over general rings. I: Generalities.
• An Answer to a Question of M. Newman on Matrix Completion
• Unimodular Commutators
• Poisson Matrix Recovery and Completion
• Overgroups of elementary symplectic groups
• Strongly stable rank and applications to matrix completion
• On the existence of unimodular matrices with a prescribed submatrix
• Combinatorial reduction of set functions and matroid permutations through minor invertible product assignment
• Semidefinite programming for discrete optimization and matrix completion problems

This page was built for publication: Matrix Completion Theorems

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