Totally positive completions for monotonically labeled block clique graphs

MaRDI QIDQ3394471zbMATH OpenFDO

Authors Charles R. Johnson, Cris Negron

Publication date 7 September 2009

Full work available at URL https://eudml.org/doc/130556, http://www.emis.de/journals/ELA/ela-articles/abstracts/abs_vol18_pp146_161.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

partial matrixmonotonically labeled block clique graphtotally positive matrix completion problems

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Determinants, permanents, traces, other special matrix functions (15A15)

Recommendations

• The totally non-positive matrix completion problem
• The totally positive completion problem
• Paths and Cycles in the Totally Positive Completion Problem
• The completable digraphs for the totally nonnegative completion problem
• Adjacent edge conditions for the totally nonnegative completion problem

Cited in

(4)

• Adjacent edge conditions for the totally nonnegative completion problem
• Completion of TP and TN border patterns
• Arrangements of equal minors in the positive Grassmannian
• Asymmetric TP and TN completion problems

This page was built for publication: Totally positive completions for monotonically labeled block clique graphs

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