On avoidance of V- and ^-patterns in permutations

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

Abstract

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.

ORCID iDs

Kitaev, Sergey

and Pyatkin, Artem;

Item metadata

Item type:	Article
ID code:	49913
Dates:	Date Event October 2010 Published
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:	23 Feb 2021 10:33
Related URLs:	Journal or Publication Related item
URI:	https://strathprints.strath.ac.uk/id/eprint/49913

Export

CORE (COnnecting REpositories)