zbMATH — the first resource for mathematics

Another proof of Wilmes’ conjecture. (English) Zbl 1283.05215
Summary: We present a new proof of the monomial case of Wilmes’ conjecture, which gives a formula for the coarsely-graded Betti numbers of the \(G\)-parking function ideal in terms of maximal parking functions of contractions of \(G\). Our proof is via poset topology and relies on a theorem of V. Gasharov et al. [Math. Res. Lett. 6, No. 5–6, 521–532 (1999; Zbl 0970.13004)] that connects the Betti numbers of a monomial ideal to the topology of its lcm-lattice.

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
13D02 Syzygies, resolutions, complexes and commutative rings
Full Text: DOI arXiv
[1] Baker, Matthew; Norine, Serguei, Riemann-Roch and Abel-Jacobi theory on a finite graph, Adv. Math., 215, 766-788, (2007) · Zbl 1124.05049
[2] Benson, Brian; Chakrabarty, Deeparnab; Tetali, Prasad, \(G\)-parking functions, acyclic orientations and spanning trees, Discrete Math., 310, 8, 1340-1353, (2010) · Zbl 1230.05265
[3] Bruns, Winfried; Herzog, Jürgen, (Cohen-Macaulay Rings, Cambridge Studies in Advanced Mathematics, vol. 39, (1993), Cambridge University Press)
[4] Cori, Robert; Rossin, Dominique; Salvy, Bruno, Polynomial ideals for sandpiles and their Gröbner bases, Theoret. Comput. Sci., 276, 1, 1-15, (2002) · Zbl 1002.68105
[5] Dochtermann, Anton; Sanyal, Raman, Laplacian ideals, arrangements, and resolutions, J. Algebraic Combin., (2012), eprint, forthcoming. http://arxiv.org/abs/1212.6244 · Zbl 1303.05217
[6] Gasharov, Vesselin; Peeva, Irena; Welker, Volkmar, The LCM-lattice in monomial resolutions, Math. Res. Lett., 5-6, 521-532, (1999) · Zbl 0970.13004
[7] Horia Mania, Wilmes’ conjecture and boundary divisors, eprint, October 2012. http://arxiv.org/abs/1210.8109.
[8] Manjunath, Madhusudan; Schreyer, Frank-Olaf; Wilmes, John, Minimal free resolutions of the \(G\)-parking function ideal and the toppling ideal, Trans. Amer. Math. Soc., (2012), eprint, forthcoming. http://arxiv.org/abs/1210.7569 · Zbl 1310.13022
[9] Manjunath, Madhusudan; Sturmfels, Bernd, Monomials, binomials and Riemann-Roch, J. Algebraic Combin., 37, 4, 737-756, (2013) · Zbl 1272.13017
[10] Miller, Ezra; Sturmfels, Bernd, (Combinatorial Commutative Algebra, Graduate Texts in Mathematics, vol. 227, (2005), Springer New York) · Zbl 1090.13001
[11] Fatemeh Mohammadi, Farbod Shokrieh, Divisors on graphs, binomial and monomial ideals, and cellular resolutions, eprint, June 2013. http://arxiv.org/abs/1306.5351. · Zbl 1336.05060
[12] Mohammadi, Fatemeh; Shokrieh, Farbod, Divisors on graphs, connected flags, and syzygies, Int. Math. Res. Not., (2013) · Zbl 1294.05092
[13] Novik, Isabella; Postnikov, Alexander; Sturmfels, Bernd, Syzygies of oriented matroids, Duke Math. J., 111, 2, 287-317, (2002) · Zbl 1022.13002
[14] David Perkinson, Jacob Perlman, John Wilmes, Primer for the algebraic geometry of sandpiles, eprint, December 2011. http://arxiv.org/abs/1112.6163. · Zbl 1320.05060
[15] Postnikov, Alexander; Shapiro, Boris, Trees, parking functions, syzygies, and deformations of monomial ideals, Trans. Amer. Math. Soc., 356, 8, 3109-3142, (2004), (electronic) · Zbl 1043.05038
[16] Irena Swanson, Polarization (of monomial ideals), November 2006. Available Online at: http://people.reed.edu/ iswanson/polarization.pdf.
[17] Wachs, Michelle L., Poset topology: tools and applications, (Geometric Combinatorics, IAS/Park City Math. Ser., vol. 13, (2007), Amer. Math. Soc. Providence, RI), 497-615 · Zbl 1135.06001
[18] John Wilmes, Algebraic invariants of the sandpile model, Bachelor’s Thesis, Reed College, 2010.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.