Picture of sea vessel plough through rough maritime conditions

Innovations in marine technology, pioneered through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Naval Architecture, Ocean & Marine Engineering based within the Faculty of Engineering.

Research here explores the potential of marine renewables, such as offshore wind, current and wave energy devices to promote the delivery of diverse energy sources. Expertise in offshore hydrodynamics in offshore structures also informs innovations within the oil and gas industries. But as a world-leading centre of marine technology, the Department is recognised as the leading authority in all areas related to maritime safety, such as resilience engineering, collision avoidance and risk-based ship design. Techniques to support sustainability vessel life cycle management is a key research focus.

Explore the Open Access research of the Department of Naval Architecture, Ocean & Marine Engineering. 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

Abstract

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.