Generating Trees and Pattern Avoidance in Alternating Permutations
We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A[subscript 2n](2143) of alternating permutations of length 2n avoiding 2143 and the set of sta...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Electronic Journal of Combinatorics
2014
|
| Online Access: | http://hdl.handle.net/1721.1/89800 |