ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ff be a psd-stable polynomial in symmetric variables, and let ZβZ^\beta be a monomial appearing in a psd-stable polynomial. A diagonal monomial is a monomial ZαZ^\alpha appearing in ff 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 ZβZ^\beta appearing in a psd-stable polynomial, there is a diagonal monomial ZαZ^\alpha appearing in ff which can be reached by a sequence of linear, double and transposition steps which decrease the distance from β\beta to α\alpha and which never leave the support of ff.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.