Lattices and Hypergraphs associated to square-free monomial ideals
Abstract
Given a square-free monomial ideal I in a polynomial ring R over a field K, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the hypergraph, and in doing so we provide a sufficient condition for removing higher dimension edges of the hypergraph without impacting the projective dimension of the square-free monomial ideal. We also offer algorithms to compute the projective dimension of a class of square-free monomial ideals built using the new result and previous results of Lin-Mantero.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.