Kitaev, Sergey and Pyatkin, Artem (2010) On avoidance of V- and ^-patterns in permutations. Ars Combinatoria, 97. pp. 203-215.Full text not available in this repository. Request a copy from the Strathclyde author
We study V- and ^-patterns which generalize valleys and peaks, as well as increasing and decreasing runs, in permutations. A complete classi¯cation of permutations (multi)-avoiding V- and ¤-patterns of length 4 is given. We also establish a connection between restricted permutations and matchings in the coronas of complete graphs.
|Keywords:||pattern avoidance, pattern avoiding permutation, valleys, peaks, partially ordered patterns, corona of a complete graph, Electronic computers. Computer science, Mathematics(all)|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||21 Oct 2014 10:30|
|Last modified:||26 Feb 2017 01:09|