← All problems

Stembridge's polynomial-counting conjecture for nondegenerate sparse symmetric matrices

26 years old · traced to

Let GG be a simple graph with vertex set V(G)={v1,…,vn}V(G)=\{v_1,\ldots,v_n\}. Let ZGoZ^o_G be the scheme of nondegenerate symmetric n×nn\times n matrices MM satisfying

Mij=0if i≠j and there is no edge from vi to vj.M_{ij}=0\quad\text{if }i\ne j\text{ and there is no edge from }v_i\text{ to }v_j.

Equivalently, for a graph G∗G^* obtained from GG by adjoining an apex vertex connected to every vertex, the source identifies ZGoZ^o_G with XG∗X_{G^*}. Stembridge's conjecture. For every simple graph GG, [ZGo][Z^o_G] is a polynomial in qq. Since it would follow from Stanley's reformulation, and that reformulation is equivalent to the refuted Kontsevich conjecture, this conjecture is also refuted.

References

Status

Source: Prakash Belkale and Patrick Brosnan, “Matroids, motives and conjecture of Kontsevich”, arXiv:math/0012198 (2000).

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.