ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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. Wilmes originally formulated the corresponding statement for the topppling ideal, of which II is a distinguished monomial initial ideal; the supplied source gives no evidence of resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.