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 prove a conjecture of Guo and Poznanovi\'{c} concerning chains in certain01-fillings of moon polyominoes. A key ingredient of our proof is acorrespondence between words $w$ and pairs $(\mathcal{W}(w), \mathcal{M}(w))$of increasing tableaux such that $\mathcal{M}(w)$ determines the lengths of thelongest strictly increasing and strictly decreasing sequences in everysubinterval of $w$. We define this correspondence by using Thomas and Yong'sK-infusion operator and then use it to obtain the bijections that prove theconjecture of Guo and Poznanovi\'{c}. In constructing our bijections weintroduce new variants of the RSK correspondence and Knuth equivalence.

Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanovi\'c