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/

Zendy Plus

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

Zendy Tools

Zendy Open

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) isthe clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flowmin-cut property and that its edge ideal is normally torsion free. We provethat edge ideals of complete admissible uniform clutters are normally torsionfree. The normality of a monomial ideal is expressed in terms of blockingpolyhedra and the integer decomposition property. For edge ideals of cluttersthis property completely determine their normality

Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals