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

Bousquet-Melou, Mireille and Claesson, Anders and Dukes, Mark and Kitaev, Sergey (2010) (2+2)-free posets, ascent sequences and pattern avoiding permutations. Journal of Combinatorial Theory Series A, 117 (7). pp. 884-909. (https://doi.org/10.1016/j.jcta.2009.12.007)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Bousquet-Melou, Mireille, Claesson, Anders ORCID logoORCID: https://orcid.org/0000-0001-5797-8673, Dukes, Mark ORCID logoORCID: https://orcid.org/0000-0002-2779-2680 and Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647;
CORE (COnnecting REpositories)