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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The Lehmer code is a classical and fundamental permutation code which encodes information about the inversions of a permutation. Denoncourt constructed a poset Mω which is the subposet of joinirreducible elements of the Lehmer codes of the permutations in [en, ω] in the left weak Bruhat order, i.e., the inversion order, on Sn for ω ∈ Sn. In this paper, we investigate the poset structure of Mω in terms of pattern avoidance. First we show that Mω is a B2-free poset if and only if ω is a 3412-3421-avoiding permutation. Next we prove that Mω is poset isomorphic to the corresponding root poset if and only if ω is a 321-avoiding permutation.

Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns