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

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

Research output: Contribution to journalArticle

77 Citations (Scopus)

Abstract

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not known to be equinumerous. We present a direct bijection between them. The third class is a family of permutations defined in terms of a new type of pattern. An attractive property of these patterns is that, like classical patterns, they are closed under the action of the symmetry group of the square. The fourth class is formed by certain integer sequences, called ascent sequences, which have a simple recursive structure and are shown to encode (2+2)-free posets and permutations. Our bijections preserve numerous statistics.

We determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for the class of chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern View the MathML source and use this to enumerate those permutations, thereby settling a conjecture of Pudwell.
Original languageEnglish
Pages (from-to)884-909
Number of pages26
JournalJournal of Combinatorial Theory Series A
Volume117
Issue number7
DOIs
Publication statusPublished - Oct 2010

Keywords

  • (2+2)-free poset
  • ascent sequences
  • pattern avoiding permutation
  • chord diagram
  • involution
  • encode
  • enumerate
  • non-D-finite series

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

Cite this