Abstract
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the graphs whose independence complex is sortable. By using this characterization, we show that the ideal generated by all squarefree monomials corresponding to independent sets of vertices of $G$ of size $t$ (for a given positive integer $t$) has the strong persistence property, when $G$ is a proper interval graph. Moreover, all of its powers have linear quotients.
Highlights
The notion of strong persistence property for an ideal in a Noetherian ring R has been defined in [8]
It is known that any monomial ideal with the strong persistence property has the persistence property
We introduce a new class of monomial ideals associated to proper interval graphs with the strong persistence property
Summary
The notion of strong persistence property for an ideal in a Noetherian ring R has been defined in [8]. We introduce a new class of monomial ideals associated to proper interval graphs with the strong persistence property. To this aim, we introduce the notion of a sortable simplicial complex and show that the independence complex of a graph G is sortable if and only if G is a proper interval graph. We show that for any ideal in this class, all of its powers have linear quotients and linear resolutions
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.