Restricted Dumont permutations, Dyck paths, and noncrossing partitions (Q860451): Difference between revisions

The authors continue the enumeration of restricted Dumont permutations started in [Ann. Comb. 9, No. 3, 269-280 (2005; Zbl 1073.05004)] by the first author. A permutation \(\pi\in S_{2n}\) is called a Dumont permutation of the first kind if \(\pi(i+1)<\pi(i)\) whenever \(\pi(i)\) is even and \(\pi(i+1)>\pi(i)\) if \(\pi(i)\) is odd, whereas \(\pi\) is called a Dumont permutation of the second kind if \(\pi(i)<i\) whenever \(i\) is even and \(\pi(i)\geq i\) if \(i\) is odd. Let \({\mathfrak D}_{2n}^{1/2}(\tau)\) denote the set of Dumont permutations of length \(2n\) of the first/second kind which avoid the pattern \(\tau\). The authors determine the numbers \(| {\mathfrak D}_{2n}^{2}(4132)| \) and \(| {\mathfrak D}_{2n}^{2}(2143)| \) where the first sequence yields a further example for objects counted by the Catalan numbers. Furthermore explicit bijections between restricted Dumont permutations and Dyck paths or noncrossing partitions are given which allow to study the distribution of certain statistics (such as length of the longest monotone subsequence) on these permutation sets.