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 copyAbstract
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 ORCID: https://orcid.org/0000-0003-3324-1647 and Pyatkin, Artem;-
-
Item type: Article ID code: 49913 Dates: DateEventOctober 2010PublishedSubjects: 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: 11 Nov 2024 10:49 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/49913
CORE (COnnecting REpositories)