Abstract
Baxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
Original language | English |
---|---|
Pages (from-to) | 1430-1440 |
Number of pages | 11 |
Journal | Discrete Applied Mathematics |
Volume | 155 |
Issue number | 11 |
DOIs | |
State | Published - 1 Jun 2007 |
Keywords
- Baxter permutations
- Forbidden subsequences
- Generating trees
- Padovan numbers
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics