arXiv Analytics

Sign in

arXiv:0711.2684 [math.CO]AbstractReferencesReviewsResources

Bijections from Dyck paths to 321-avoiding permutations revisited

David Callan

Published 2007-11-16Version 1

There are (at least) three bijections from Dyck paths to 321-avoiding permutations in the literature, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How different are they? Denoting them B,K,M respectively, we show that M = B \circ L = K \circ L' where L is the classical Kreweras-Lalanne involution on Dyck paths and L', also an involution, is a sort of derivative of L. Thus K^{-1} \circ B, a measure of the difference between B and K, is the product of involutions L' \circ L and turns out to be a very curious bijection: as a permutation on Dyck n-paths it is an nth root of the "reverse path" involution. The proof of this fact boils down to a geometric argument involving pairs of nonintersecting lattice paths.

Related articles: Most relevant | Search more
arXiv:math/0002200 [math.CO] (Published 2000-02-24)
Permutations with restricted patterns and Dyck paths
arXiv:math/0611698 [math.CO] (Published 2006-11-22)
A bijection on Dyck paths and its cycle structure
arXiv:2408.06923 [math.CO] (Published 2024-08-13)
Skeletal generalizations of Dyck paths, parking functions, and chip-firing games