The 1-box pattern on pattern-avoiding permutations
Kitaev, Sergey and Remmel, Jeffrey (2014) The 1-box pattern on pattern-avoiding permutations. Journal of Integer Sequences, 17 (3). 14.3.3.
Full text not available in this repository.Request a copy from the Strathclyde authorAbstract
This paper is continuation of the study of the 1-box pattern in permutations in- troduced previously by the authors. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and then study some of its coefficients providing a link to the Fibonacci numbers. We also find the number of separable permutations with two and three occurrences of the 1-box pattern.
Creators(s): |
Kitaev, Sergey ![]() | Item type: | Article |
---|---|
ID code: | 49880 |
Keywords: | 1-box pattern, pattern avoidance, pattern avoiding permutation, Electronic computers. Computer science, Discrete Mathematics and Combinatorics |
Subjects: | Science > Mathematics > Electronic computers. Computer science |
Department: | Faculty of Science > Computer and Information Sciences |
Depositing user: | Pure Administrator |
Date deposited: | 17 Oct 2014 10:13 |
Last modified: | 01 Jan 2021 11:05 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/49880 |
Export data: |
CORE (COnnecting REpositories)