Perfect Sets and f-Ideals
Abstract
A square-free monomial ideal I is called an f-ideal, if both δF(I) and δN(I) have the same f-vector, where δF(I) (δN(I), respectively) is the facet (Stanley-Reisner, respectively) complex related to I. In this paper, we introduce and study perfect subsets of 2[n] and use them to characterize the f-ideals of degree d. We give a decomposition of V(n, 2) by taking advantage of a correspondence between graphs and sets of square-free monomials of degree 2, and then give a formula for counting the number of f-ideals of degree 2, where V(n, 2) is the set of f-ideals of degree 2 in K[x1,…,xn]. We also consider the relation between an f-ideal and an unmixed monomial ideal.
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.