Proof of a conjecture on polynomials preserving nonnegative matrices
Raphael Loewy

TL;DR
This paper proves Clark and Paparella's conjecture that the set of polynomials preserving nonnegative matrices of size n+1 is strictly contained within those preserving size n, advancing understanding in matrix positivity.
Contribution
The paper provides a proof that P(n+1) is strictly contained in P(n), confirming a conjecture related to polynomials preserving nonnegative matrices.
Findings
Confirmed the strict inclusion P(n+1) ⊂ P(n)
Enhanced understanding of polynomial preservation of nonnegative matrices
Contributed to the Nonnegative Inverse Eigenvalue Problem
Abstract
We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n nonnegative (element-wise) matrix}. This set plays a role in the Nonnegative Inverse Eigenvalue Problem. Clark and Paparella conjectured that P(n+1) is strictly contained in P(n). We prove this conjecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Mathematics and Applications
