M. Bousquet-mélou, A. Claesson, M. Dukes, and S. Kitaev, <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn mathvariant="bold">2</mml:mn><mml:mo>+</mml:mo><mml:mn mathvariant="bold">2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-free posets, ascent sequences and pattern avoiding permutations, Journal of Combinatorial Theory, Series A, vol.117, issue.7, pp.884-909, 2010.
DOI : 10.1016/j.jcta.2009.12.007

A. Claesson and S. Linusson, $n!$ matchings, $n!$ posets, Proceedings of the American Mathematical Society, vol.139, issue.02, pp.435-449, 2011.
DOI : 10.1090/S0002-9939-2010-10678-0
URL : https://hal.archives-ouvertes.fr/hal-01186245

A. Garsia and S. Milne, Method for constructing bijections for classical partition identities, Proc. Nat. Acad. Sci. USA, pp.2026-2028, 1981.
DOI : 10.1073/pnas.78.4.2026

M. Jones and J. , Pattern Matching in the Cycle Structures of Permutations