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

In [6] Schensted constructed the Schensted algorithm, which gives a bijection between  permutations and pairs of standard tableaux of the same shape.  Stanton and White [8] gave analog of the Schensted algorithm for rim hook tableaux. In this paper we give a generalization of Stanton and White's Schensted algorithm for rim hook tableaux. If $k$ is a fixed positive integer, it shows a one-to-one correspondence between all generalized hook permutations $\mathcal H$ of size $k$ and all pairs $(P,Q)$, where $P$ and $Q$ are semistandard $k$-rim hook tableaux and $k$-rim hook tableaux of the same shape, respectively.

GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX