← All problems

Wilmes' conjecture on Betti numbers of graph parking function ideals

13 years old · documented by

Let GG be a connected graph with sink vertex vnv_n, let R=k[x1,…,xn−1]R=\mathbf{k}[x_1,\ldots,x_{n-1}], and let II be the GG-parking function ideal generated by the monomials associated to connected cuts of GG. Write βi(R/I)\beta_i(R/I) for its coarsely graded Betti numbers, and let mpf(Γ)\mathrm{mpf}(\Gamma) denote the number of maximal parking functions of a connected graph Γ\Gamma. For a connected partition π\pi of GG, write G∣πG\vert_{\pi} for the corresponding contracted graph.

Wilmes' conjecture. For all i≥1i\geq 1, one has

βi(R/I)=∑∣π∣=i+1mpf(G∣π),\beta_i(R/I)=\sum_{|\pi|=i+1}\mathrm{mpf}(G\vert_{\pi}),

where the sum is over all connected partitions π\pi of GG with i+1i+1 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

Source: Sam Hopkins, “Another proof of Wilmes' conjecture”, arXiv:1306.2930 (2017).

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.