The hierarchy conjecture for polynomials preserving nonnegative matrices

For n3n\geq 3, let Pn\mathscr{P}_n denote the set of polynomials that preserve entrywise nonnegative n×nn\times n matrices under polynomial evaluation. Hierarchy conjecture.

Pn+1Pn.\mathscr{P}_{n+1}\subset \mathscr{P}_n.

The paper has established the inclusions P2P1\mathscr{P}_2\subset \mathscr{P}_1 and, by Clark and Paparella, P3P2\mathscr{P}_3\subset \mathscr{P}_2; the conjecture proposes that this descending hierarchy continues for every n3n\geq 3.

Sources & referencesView supporting material

Primary source

Benjamin J. Clark and Pietro Paparella, “Polynomials that preserve nonnegative matrices”, arXiv:2109.03360 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.