Special Matrices (Apr 2021)

The Totally Positive Completion Problem: The 3-by-n Case

Carter D.,
DiMarco K.E.,
Johnson C.R.,
Wedemeyer L.,
Yu Z.

Affiliations

Carter D.: Department of Mathematics, Princeton University, Princeton, NJ 08544
DiMarco K.E.: Department of Mathematics, Bucknell University, Lewisburg, PA 17837
Johnson C.R.: Department of Mathematics, College of William and Mary, Williamsburg, VA 23187-8795, USA
Wedemeyer L.: Department of Mathematics, Duke University, Durham, NC 27708
Yu Z.: Department of Mathematics, University of Florida, Gainesville, FL 32601

DOI: https://doi.org/10.1515/spma-2020-0134
Journal volume & issue: Vol. 9, no. 1
pp. 226 – 239

Abstract

The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.

Published in Special Matrices

ISSN: 2300-7451 (Online)
Publisher: De Gruyter
Country of publisher: Poland
LCC subjects: Science: Mathematics
Website: https://www.degruyter.com/journal/key/spma/html

About the journal