Abstract
This chapter investigates three special cases of monomial ideals that are important for graph theory and combinatorics: the edge ideal of a simple graph and the Stanley-Reisner and facet ideals of a simplicial complex. Each of these cases is a monomial ideal that is “square free”. These ideals are treated, in general, in Section 4.1. Graphs and their edge ideals are introduced in Section 4.2, and the decompositions of edge ideals are described in Section 4.3. Simplicial complexes and their Stanley-Reisner ideals are presented in Section 4.4, and the decompositions of Stanley-Reisner ideals are described in Section 4.5. This includes, as a consequence, a method for finding decompositions of arbitrary square-free monomial ideals. Section 4.6 treats the facet ideals associated to simplicial complexes, and their m-irreducible decompositions. The chapter ends in Section 4.7 with an exploration of Alexander duality, a process that transforms monomial generating sequences to m-irreducible decompositions, and vice versa.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Macaulay2 is open source, but not all its functions are written in the Macaulay2 language. Many of the low-level routines are written in C or C++ and therefore the source code for such functions does not come with the standard distribution. To check out the source code, visit the website https://github.com/Macaulay2/M2.
- 2.
The return value of the code methods isSquareFree command was slightly edited to fit on the page.
- 3.
A container is a programming construct that holds objects.
- 4.
One may feel that the symbol d should be reserved for the dimension of \(\varDelta \). For the sake of consistency, though, we continue using d for the number of variables. See Section 5.1 for a justification of this choice.
- 5.
A Net is a two dimensional string; get it?
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Moore, W.F., Rogers, M., Sather-Wagstaff, S. (2018). Connections with Combinatorics. In: Monomial Ideals and Their Decompositions. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-96876-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-96876-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96874-2
Online ISBN: 978-3-319-96876-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)