Wilmes' conjecture on Betti numbers of graph parking function ideals
Statement
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. Wilmes originally formulated the corresponding statement for the topppling ideal, of which 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.