The Totally Positive Completion Problem: The 3-by-n Case
Abstract The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.
2004 ◽
Vol 393
◽
pp. 259-274
◽
2007 ◽
Vol 03
(04)
◽
pp. 541-556
◽
2017 ◽
Vol 66
(5)
◽
pp. 861-868
◽
Keyword(s):
2012 ◽
Vol 312
(22)
◽
pp. 3306-3315
◽
2014 ◽
Vol 184
◽
pp. 209-237
◽