Stanley's reformulation of Kontsevich's polynomial-counting conjecture
Let be a finite graph with edge set , and let
where the sum runs over spanning trees of . Let be the zero scheme of in , let , and write . Stanley's reformulation. For all graphs , is a polynomial in . Stanley showed that this conjecture is equivalent to Kontsevich's conjecture for .
References
Status
- Refuted: Prakash Belkale and Patrick Brosnan. Matroids, motives and a conjecture of Kontsevich (Duke Mathematical Journal, 2003) https://arxiv.org/abs/math/0012198
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.