Bijections from Dyck paths to 321-avoiding permutations revisited
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations
Mallows permutations avoiding a length-3 pattern with bias e^{β/n} converge to a non-trivial explicit deterministic permuton depending on the pattern and β, with accompanying LDP and q-Catalan asymptotics.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.