Stembridge's polynomial-counting conjecture for nondegenerate sparse symmetric matrices
Statement
Let be a simple graph with vertex set . Let be the scheme of nondegenerate symmetric matrices satisfying
Equivalently, for a graph obtained from by adjoining an apex vertex connected to every vertex, the source identifies with . Stembridge's conjecture. For every simple graph , is a polynomial in . Since it would follow from Stanley's reformulation, and that reformulation is equivalent to the refuted Kontsevich conjecture, this conjecture is also refuted.
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.