← All problems

Stanley's reformulation of Kontsevich's polynomial-counting conjecture

26 years old · traced to

Let GG be a finite graph with edge set E(G)E(G), and let

QG=∑T∏e∈Txe,Q_G=\sum_T\prod_{e\in T}x_e,

where the sum runs over spanning trees TT of GG. Let V(QG)V(Q_G) be the zero scheme of QGQ_G in AE(G)\mathbf A^{E(G)}, let XG=AE(G)∖V(QG)X_G=\mathbf A^{E(G)}\setminus V(Q_G), and write [XG](q)=#XG(Fq)[X_G](q)=\#X_G(\mathbf F_q). Stanley's reformulation. For all graphs GG, [XG][X_G] is a polynomial in qq. Stanley showed that this conjecture is equivalent to Kontsevich's conjecture for YGY_G.

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.