Proof of the monotone column permanent conjecture
Petter Br\"and\'en, James Haglund, Mirk\'o Visontai, David G., Wagner

TL;DR
This paper proves the stability of a certain matrix permanent polynomial, confirming a conjecture and deriving implications for real-rootedness, Eulerian polynomials, and inequalities.
Contribution
It establishes the stability of the permanent of a matrix involving a diagonal and all-ones matrix, resolving a recent conjecture and deriving multiple mathematical consequences.
Findings
Proved the stability of per(J_nZ_n + A) in variables z_i.
Showed per(zJ_n + A) has only real roots as a polynomial in z.
Derived new permanental inequalities and applications to Eulerian polynomials.
Abstract
Let A be an n-by-n matrix of real numbers which are weakly decreasing down each column, Z_n = diag(z_1,..., z_n) a diagonal matrix of indeterminates, and J_n the n-by-n matrix of all ones. We prove that per(J_nZ_n+A) is stable in the z_i, resolving a recent conjecture of Haglund and Visontai. This immediately implies that per(zJ_n+A) is a polynomial in z with only real roots, an open conjecture of Haglund, Ono, and Wagner from 1999. Other applications include a multivariate stable Eulerian polynomial, a new proof of Grace's apolarity theorem and new permanental inequalities.
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
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Advanced Combinatorial Mathematics
