Picture child's feet next to pens, pencils and paper

Open Access research that is helping to improve educational outcomes for children

Strathprints makes available scholarly Open Access content by researchers in the School of Education, including those researching educational and social practices in curricular subjects. Research in this area seeks to understand the complex influences that increase curricula capacity and engagement by studying how curriculum practices relate to cultural, intellectual and social practices in and out of schools and nurseries.

Research at the School of Education also spans a number of other areas, including inclusive pedagogy, philosophy of education, health and wellbeing within health-related aspects of education (e.g. physical education and sport pedagogy, autism and technology, counselling education, and pedagogies for mental and emotional health), languages education, and other areas.

Explore Open Access education research. Or explore all of Strathclyde's Open Access research...

(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.

Full text not available in this repository. Request a copy from the Strathclyde author

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.