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

The interval poset of a permutation is the set of intervals of a permutation,ordered with respect to inclusion. It has been introduced and studied recentlyin [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective ofthe decomposition trees of permutations, describing a procedure to obtain theformer from the latter. We then give alternative proofs of some of the resultsin [B. Tenner, arXiv:2007.06142], and we solve the open problems that it posed(and some other enumerative problems) using techniques from symbolic andanalytic combinatorics. Finally, we compute the M\"obius function on suchposets.

The interval posets of permutations seen from the decomposition tree perspective