Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations

Mireille Bousquet-Melou, Anders Claesson, Mark Dukes, Sergey Kitaev

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages216-228
Number of pages13
Publication statusPublished - 2009
Event21st International Conference on Formal Power Series & Algebraic Combinatorics - Hagenberg, Austria
Duration: 20 Jul 200924 Jul 2009

Conference

Conference21st International Conference on Formal Power Series & Algebraic Combinatorics
CountryAustria
CityHagenberg
Period20/07/0924/07/09

Keywords

  • (2+2)-free posets
  • interval order
  • pattern avoidance
  • ascent sequences
  • kernel method

Fingerprint Dive into the research topics of 'Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations'. Together they form a unique fingerprint.

  • Cite this

    Bousquet-Melou, M., Claesson, A., Dukes, M., & Kitaev, S. (2009). Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. 216-228. Paper presented at 21st International Conference on Formal Power Series & Algebraic Combinatorics, Hagenberg, Austria.