zbMATH — the first resource for mathematics

Monomials, binomials and Riemann-Roch. (English) Zbl 1272.13017
In the paper under review, the authors state a Riemann-Roch theorem in the context of combinatorial commutative algebra. The role of curves is played by a special type of Artinian monomial ideals, called Riemann-Roch ideals, and the role of divisors is played by Laurent monomials. For a Riemann-Roch ideal \(M\), the authors give a notion of genus, canonical monomial \(\mathbf{x}^{\mathbf{K}}\) and rank of a Laurent monomial \(\mathbf{x}^{\mathbf{b}}\) with respect to \(M\) such that the Riemann-Roch formula \[ \text{rank}(\mathbf{x}^{\mathbf{b}}) - \text{rank}(\mathbf{x}^{\mathbf{K}}/\mathbf{x}^{\mathbf{b}}) = \text{degree}(\mathbf{x}^{\mathbf{b}}) - \text{genus}(M) + 1 \] holds.
The authors apply this technique to finite graphs \(G\) (connected, undirected and without loops) by means of the associated toppling ideal \(I_G\). First, they give a nice description of a set of minimal generators of \(I_G\), which turn out to be a Gröbner basis with respect to a reverse lexicographic order, and of a minimal resolution of \(\mathbb{K}[\mathbf{x}]/I_G\). Second, they prove that the initial ideal \(M_G\) of the toppling ideal \(I_G\) is Riemann-Roch, determining the canonical monomial and the genus of \(M_G\). Finally, they weaken the assumptions, allowing loops in the graph, in order to give a complete new proof of the Riemann-Roch formula for graphs firstly due to M. Baker and S. Norine [Adv. Math. 215, No. 2, 766–788 (2007; Zbl 1124.05049)].

13F55 Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes
05C31 Graph polynomials
05E40 Combinatorial aspects of commutative algebra
13P10 Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Full Text: DOI arXiv
[1] Amini, O., Manjunath, M.: Riemann-Roch for sublattices of the root lattice \(A\)_{\(n\)}. Electron. J. Comb. 17(1) (2010) · Zbl 1277.05105
[2] Asadi, A., Backman, S.: Chip-firing and Riemann-Roch theory for directed graphs. arXiv:1012.0287 · Zbl 1274.05189
[3] Baker, M.; Norine, S., Riemann-Roch and Abel-Jacobi theory on a finite graph, Adv. Math., 215, 766-788, (2007) · Zbl 1124.05049
[4] Baker, M., Shokrieh, F.: Chip-firing games and potential theory on graphs, and spanning trees. arXiv:1107.1313 · Zbl 1408.05089
[5] Benson, B.; Chakrabarty, D.; Tetali, P., \(G\)-parking functions, acyclic orientations and spanning trees, Discrete Math., 310, 1340-1353, (2010) · Zbl 1230.05265
[6] Cori, R.; Rossin, D.; Salvy, B., Polynomial ideals for sandpiles and their Gröbner bases, Theor. Comput. Sci., 276, 1-15, (2002) · Zbl 1002.68105
[7] Joswig, M.; Sturmfels, B.; Yu, J., Affine buildings and tropical convexity, Albanian J. Math., 1, 187-211, (2007) · Zbl 1133.52003
[8] Merino López, C., Chip firing and the Tutte polynomial, Ann. Comb., 1, 253-259, (1997) · Zbl 0901.05004
[9] Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)
[10] Peeva, I.; Sturmfels, B., Generic lattice ideals, J. Am. Math. Soc., 11, 363-373, (1998) · Zbl 0905.13005
[11] Perkinson, D., Perlman, J., Wilmes, J.: Primer for the algebraic geometry of sandpiles. arXiv:1112.6163 · Zbl 1320.05060
[12] Postnikov, A.; Shapiro, B., Trees, parking functions, syzygies, and deformations of monomial ideals, Trans. Am. Math. Soc., 356, 3109-3142, (2004) · Zbl 1043.05038
[13] Scarf, H., Neighbourhood systems for production sets with indivisibilities, Econometrica, 54, 507-532, (1986) · Zbl 0605.90018
[14] Thomas, R., Gröbner bases in integer programming, No. 1, 533-572, (1998), Boston · Zbl 1058.90514
[15] Wilmes, J.: Algebraic invariants of sandpile graphs. Bachelor’s Thesis, Reed College, Portland, OR (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.