Wilmes' conjecture on Betti numbers of graph parking function ideals
Let be a connected graph with sink vertex , let , and let be the -parking function ideal generated by the monomials associated to connected cuts of . Write for its coarsely graded Betti numbers, and let denote the number of maximal parking functions of a connected graph . For a connected partition of , write for the corresponding contracted graph.
Wilmes' conjecture. For all , one has
where the sum is over all connected partitions of with parts.
The conjecture predicts the coarsely graded Betti numbers of the graph parking function ideal from maximal parking functions of contracted connected graphs.
References
2 papers in this index state this conjecture (2012–2013). The statement above is taken from the most recent of them; the others are arXiv:1210.8109.
Status
- Solved: Anton Dochtermann and Raman Sanyal. Another proof of Wilmes’ conjecture (Discrete Mathematics, 2014) https://doi.org/10.1016/j.disc.2014.01.010
Source: Sam Hopkins, “Another proof of Wilmes' conjecture”, arXiv:1306.2930 (2017).
Progress summary
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.