One-skeleta of $G$-parking function ideals: resolutions and standard monomials
Anton Dochtermann

TL;DR
This paper explores the algebraic and combinatorial properties of the 1-skeleton of $G$-parking function ideals, linking their resolutions and monomials to graph Laplacians and tropical hyperplane arrangements.
Contribution
It introduces and analyzes the 1-skeleton ideals $M_G^{(1)}$, providing new combinatorial interpretations of their resolutions and Betti numbers, especially for complete graphs.
Findings
Dimension of $S/M_G^{(1)}$ relates to the signless Laplacian for complete graphs.
Resolutions are supported on tropical hyperplane arrangements.
Betti numbers have combinatorial interpretations via Euclidean space decompositions.
Abstract
Given a graph , the -parking function ideal is an artinian monomial ideal in the polynomial ring with the property that a linear basis for is provided by the set of -parking functions. It follows that the dimension of is given by the number of spanning trees of , which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of . The ideals and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution of can be constructed from the graphical hyperplane arrangement associated to , providing a combinatorial interpretation of the Betti numbers. Motivated by constructions in the theory of chip-firing on graphs, we study certain `skeleton' ideals generated by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic structures and combinatorial models · Algebraic Geometry and Number Theory
