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

Pattern avoidance in partial permutations

Claesson, Anders and Jelínek, Vit and Jelinkova, Eva and Kitaev, Sergey (2010) Pattern avoidance in partial permutations. In: 22nd International Conference on Formal Power Series & Algebraic Combinatorics, 2010-08-02 - 2010-08-06, San Francisco State University.

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


Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols π=π1π2⋯πn in which each of the symbols from the set {1,2,…,n-k} appears exactly once, while the remaining k symbols of π are ``holes''. We introduce pattern-avoidance in partial permutations and prove that most of the previous results on Wilf equivalence of permutation patterns can be extended to partial permutations with an arbitrary number of holes. We also show that Baxter permutations of a given length k correspond to a Wilf-type equivalence class with respect to partial permutations with (k-2) holes. Lastly, we enumerate the partial permutations of length n with k holes avoiding a given pattern of length at most four, for each n≥k≥1.