Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations
Bousquet-Melou, Mireille and Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2009) Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. In: 21st International Conference on Formal Power Series & Algebraic Combinatorics, 2009-07-20 - 2009-07-24.
Full text not available in this repository.Request a copyAbstract
We present statistic-preserving bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of chord diagrams (or involutions), already appeared in the literature, but were apparently not known to be equinumerous. The third one is a new class of pattern avoiding permutations, and the fourth one consists of certain integer sequences called ascent sequences. We also determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern 31524, and enumerate those permutations, thus settling a conjecture of Pudwell.
ORCID iDs
Bousquet-Melou, Mireille, Claesson, Anders ORCID: https://orcid.org/0000-0001-5797-8673, Dukes, Mark ORCID: https://orcid.org/0000-0002-2779-2680 and Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647;-
-
Item type: Conference or Workshop Item(Paper) ID code: 49975 Dates: DateEvent2009PublishedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 21 Oct 2014 15:03 Last modified: 11 Nov 2024 16:42 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/49975