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 show that, for any graph or matroid, there is a tree that simultaneouslydistinguishes its maximal tangles, and, for each maximal tangle $\mathcal{T}$that satisfies an additional robustness condition, displays all of thenon-trivial separations relative to $\mathcal{T}$, up to a natural equivalence.

Displaying tangles and non-sequential separations