The totally positive completion problem: the 3-by-n case
type: Item
instance of: scholarly article
title: The totally positive completion problem: the 3-by-n case
zbMATH Open document ID: 1479.15031
author: N. E. Zubov
published in: Special Matrices
publication date: 2021-12-17T00:00:00Z
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 15B48
zbMATH DE Number: 7447711
zbMATH Keywords: completion problem
zbMATH Keywords: initial minors
zbMATH Keywords: totally positive matrix
MaRDI profile type: Publication
full work available at URL: spma-2020-0134
OpenAlex ID: W3154592347
cites work: Q4941601
cites work: Q3002117
cites work: On the solvability of derived matrix problems, including completions and duals
DOI: 10.1515/SPMA-2020-0134
Recommended article: The totally positive completion problem
Recommended article: Q4400640
Recommended article: The completely positive and doubly nonnegative completion problems
Recommended article: The completable digraphs for the totally nonnegative completion problem
Recommended article: The positive definite completion problem revisited
Recommended article: Paths and Cycles in the Totally Positive Completion Problem
Recommended article: Parametrization of all solutions of the three chains completion problem
Recommended article: Complete solution to the TP2completion problem
Recommended article: Three‐query PCPs with perfect completeness over non‐Boolean domains
description: scientific article; zbMATH DE number 7447711