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). |
Year | DOI | Venue |
---|---|---|
2017 | 10.1016/j.endm.2017.06.052 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
lattice paths,excursions,Schnyder woods,Dyck paths,Weyl chambers,Young tableaux,open arc diagrams | Journal | 61 |
ISSN | Citations | PageRank |
1571-0653 | 0 | 0.34 |
References | Authors | |
5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Julien Courtiel | 1 | 0 | 1.01 |
Éric Fusy | 2 | 198 | 21.95 |
Mathias Lepoutre | 3 | 0 | 0.68 |
Marni Mishna | 4 | 57 | 9.84 |