English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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.

Sortable Simplicial Complexes and $t$-Independence Ideals of Proper Interval Graphs