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/

Zendy Plus

Presents the zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

We classify all recurrent configurations of the Abelian sandpile model (ASM)on Ferrers graphs. The classification is in terms of decorations ofEW-tableaux, which undecorated are in bijection with the minimal recurrentconfigurations. We introduce decorated permutations, extending to decoratedEW-tableaux a bijection between such tableaux and permutations, giving a directbijection between the decorated permutations and all recurrent configurationsof the ASM. We also describe a bijection between the decorated permutations andthe intransitive trees of Postnikov, the breadth-first search of whichcorresponds to a canonical toppling of the corresponding configurations.

The Abelian sandpile model on Ferrers graphs -- A classification of recurrent configurations