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 construct the first linear strand of the minimal free resolutions of edgeideals of $d$-partite $d$-uniform clutters. We show that the first linearstrand is supported on a relative simplicial complex. In the case that the edgeideals of such clutters have linear resolutions, we give an explicit andsurprisingly simple description of their minimal free resolutions, generalizingthe known resolutions for edge ideals of Ferrers graphs and hypergraphs andco-letterplace ideals. As an application, we show that the Lyubeznik numbersthat appear on the last column of the Lyubeznik table of the cover ideal ofsuch clutters are Betti numbers of certain simplicial complexes. Furthermore,we restate a characterization for edge ideals of $d$-partite $d$-uniformclutters which have linear resolutions based on the recent characterization ofarithmetically Cohen-Macaulay sets of points in a multiprojective space.

Linear strands of edge ideals of multipartite uniform clutters