Restricted Dumont permutations, Dyck paths, and noncrossing partitions

Simple item page
dc.creatorBurstein, Alexander
dc.creatorElizalde, Sergi
dc.creatorMansour, Toufik
dc.date2006-10-06
dc.date.accessioned2026-07-07T07:28:48Z
dc.date.available2026-07-07T07:28:48Z
dc.descriptionWe complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.
dc.description20 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0610234
dc.identifierhttp://arxiv.org/abs/math/0610234
dc.identifierDiscrete Mathematics 306 (2006), 2851 to 2869
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117869
dc.subjectCombinatorics
dc.subject05A05, 05A15
dc.titleRestricted Dumont permutations, Dyck paths, and noncrossing partitions
dc.typetext

Files

Collections

arXiv