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

IF 0.8 Q2 MATHEMATICS

Special Matrices Pub Date : 2021-01-01 DOI:10.1515/spma-2020-0134

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

引用次数: 1

Abstract

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

查看原文本刊更多论文

完全正补全问题:3 × n情况

摘要3-by-n TP可完成模式的特征在于识别达到自然对称的最小障碍。它们的数量是有限的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Special Matrices MATHEMATICS-

CiteScore

1.10

自引率

20.00%

发文量

审稿时长

8 weeks

期刊介绍： Special Matrices publishes original articles of wide significance and originality in all areas of research involving structured matrices present in various branches of pure and applied mathematics and their noteworthy applications in physics, engineering, and other sciences. Special Matrices provides a hub for all researchers working across structured matrices to present their discoveries, and to be a forum for the discussion of the important issues in this vibrant area of matrix theory. Special Matrices brings together in one place major contributions to structured matrices and their applications. All the manuscripts are considered by originality, scientific importance and interest to a general mathematical audience. The journal also provides secure archiving by De Gruyter and the independent archiving service Portico.