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 Open

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 zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In the study of lattice walks there are several examples of enumerativeequivalences which amount to a trade-off between domain and endpointconstraints. We present a family of such bijections for simple walks in Weylchambers which use arc diagrams in a natural way. One consequence is a set ofnew bijections for standard Young tableaux of bounded height. A modification ofthe argument in two dimensions yields a bijection between Baxter permutationsand walks ending on an axis, answering a recent question of Burrill et al.(2016). Some of our arguments (and related results) are proved using Schnyderwoods. Our strategy for simple walks extends to any dimension and yields a newbijective connection between standard Young tableaux of height at most $2k$ andcertain walks with prescribed endpoints in the $k$-dimensional Weyl chamber oftype D.

Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods