The diagonal-monomial reachability conjecture for psd-stable polynomials
Statement
Let be a psd-stable polynomial in symmetric variables, and let be a monomial appearing in a psd-stable polynomial. A diagonal monomial is a monomial appearing in whose variables are diagonal variables. The distance between monomials is measured by the norm used for exponent vectors, and linear, double, and transposition steps are the support-preserving monomial moves defined in the paper.
Diagonal-monomial reachability conjecture. For any monomial appearing in a psd-stable polynomial, there is a diagonal monomial appearing in which can be reached by a sequence of linear, double and transposition steps which decrease the distance from to and which never leave the support of .
This conjecture proposes that the determinant's connectedness under support-preserving combinatorial moves extends to all psd-stable polynomials. Its resolution is not specified in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.