Bijections for walks ending on an axis, using open arc diagrams

From MaRDI portal
(Redirected from Publication:1689930)



Abstract: In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-off between domain and endpoint constraints. We present a family of such bijections for simple walks in Weyl chambers which use arc diagrams in a natural way. One consequence is a set of new bijections for standard Young tableaux of bounded height. A modification of the argument in two dimensions yields a bijection between Baxter permutations and walks ending on an axis, answering a recent question of Burrill et al. (2016). Some of our arguments (and related results) are proved using Schnyder woods. Our strategy for simple walks extends to any dimension and yields a new bijective connection between standard Young tableaux of height at most 2k and certain walks with prescribed endpoints in the k-dimensional Weyl chamber of type D.






Describes a project that uses

Uses Software






This page was built for publication: Bijections for walks ending on an axis, using open arc diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689930)