Divisors on graphs, connected flags, and syzygies

DOI10.1093/IMRN/RNT186zbMATH Open1305.05132arXiv1210.6622OpenAlexW2158604375MaRDI QIDQ2937709FDOQ2937709

Authors: Fatemeh Mohammadi, Farbod Shokrieh 

Publication date: 12 January 2015

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr"obner theory. We give an explicit description of a minimal Gr"obner bases for each higher syzygy module. In each case the given minimal Gr"obner bases is also a minimal generating set. The Betti numbers of the binomial ideal and its natural initial ideal coincide and they correspond to the number of 'connected flags' in the graph. In particular the Betti numbers are independent of the characteristic of the base field. For complete graphs the problem was previously studied by Postnikov and Shapiro and by Manjunath and Sturmfels. The case of a general graph was stated as an open problem.

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

Recommendations

• Divisors on graphs, connected flags, and syzygies
• Divisors on graphs, binomial and monomial ideals, and cellular resolutions
• Divisors on graphs, orientations, syzygies, and system reliability
• Characteristic-independence of Betti numbers of graph ideals
• The graph of monomial ideals

zbMATH Keywords

monomial idealsbinomial idealsminimal Gröbner bases

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02) Computational aspects and applications of commutative rings (13P99)

Cited In (15)

• Divisors on graphs, orientations, syzygies, and system reliability
• Divisors on graphs, binomial and monomial ideals, and cellular resolutions
• Prime splittings of determinantal ideals
• An integer sequence and standard monomials
• Types of signature analysis in reliability based on Hilbert series
• Generalized Riemann functions, their weights, and the complete graph
• Minimal free resolutions of lattice ideals of digraphs
• On the connectivity of fiber graphs
• Fourientations and the Tutte polynomial
• Skeleton ideals of certain graphs, standard monomials and spherical parking functions
• Explicit deformation of lattice ideals via chip-firing games on directed graphs
• Monomials, binomials and Riemann-Roch
• The algebraic method in tree percolation
• Divisors on graphs, connected flags, and syzygies
• Laplacian growth, sandpiles, and scaling limits

This page was built for publication: Divisors on graphs, connected flags, and syzygies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937709)