Trees, parking functions, syzygies, and deformations of monomial ideals

DOI10.1090/S0002-9947-04-03547-0zbMath1043.05038arXivmath/0301110MaRDI QIDQ4813799

Alexander Postnikov, Boris Zalmanovich Shapiro

Publication date: 13 August 2004

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0301110

zbMATH Keywords

monomial ideal; polynomial ring; deformations; spanning trees; abelian sandpile model; Hilbert serie

Mathematics Subject Classification ID

05C05: Trees

13P99: Computational aspects and applications of commutative rings

05A99: Enumerative combinatorics

13D02: Syzygies, resolutions, complexes and commutative rings

Related Items

On the Waring problem for polynomial rings, EXTERNAL ZONOTOPAL ALGEBRA, Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal, Divisors on graphs, binomial and monomial ideals, and cellular resolutions, Parking functions for mappings, Abelian networks. III: The critical group, Parking functions and tree inversions revisited, Types of signature analysis in reliability based on Hilbert series, Involutions on standard Young tableaux and divisors on metric graphs, Hierarchical zonotopal power ideals, Laplacian ideals, arrangements, and resolutions, Zonotopal algebra, Rank-determining sets of metric graphs, Bijections between multiparking functions, Dirichlet configurations, and descending \(R\)-traversals, The critical groups of a family of graphs and elliptic curves over finite fields, Parking functions on nonsingular \(M\)-matrices, Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma, Explicit deformation of lattice ideals via chip-firing games on directed graphs, Abelian networks. II: Halting on all inputs, \(G\)-parking functions, acyclic orientations and spanning trees, A family of bijections between \(G\)-parking functions and spanning trees, Cycle Lemma, parking functions and related multigraphs, Chip-firing and energy minimization on M-matrices, Sandpiles and dominos, Tutte polynomials and \(G\)-parking functions, Directed nonabelian sandpile models on trees, Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs, Monomials, binomials and Riemann-Roch, Riemann-Roch and Abel-Jacobi theory on a finite graph, Extending the parking space, Another proof of Wilmes' conjecture, The Laplacian lattice of a graph under a simplicial distance function, Alexander duals of multipermutohedron ideals, Multiparking functions, graph searching, and the Tutte polynomial, Abelian Networks I. Foundations and Examples, Chip Firing on General Invertible Matrices, Bigraphical arrangements, Combinatorics and geometry of power ideals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une famille de polynômes ayant plusieurs propriétés enumeratives
• Principle of inclusion-exclusion on partially ordered sets
• Generic and cogeneric monomial ideals
• The lcm-lattice in monomial resolutions
• Polynomial ideals for sandpiles and their Gröbner bases
• A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
• Inverse system of a symbolic power. I
• Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications
• Cellular resolutions of monomial modules
• On ring generated by Chern 2-forms on %plane1D;54A;%plane1D;543;n/B
• Self-organized critical state of sandpile automaton models