Generating Trees and Pattern Avoidance in Alternating Permutations
Name
Lewis-2012-Generating trees and pattern.pdf
Size
289.77 KB
Format
Adobe PDF
Checksum (MD5)
93f74017a5b4a9164937ec9ca807ec8c
Author(s)
Lewis, Joel Brewster
Date Issued
January 2012
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Lewis, Joel Brewster. "Generating Trees and Pattern Avoidance in Alternating Permutations." Electronic Journal of Combinatorics, Volume 19, Issue 1 (2012).
Version
Final published version
Abstract
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 standard Young tableaux of shape ⟨n,n,n⟩, and between the set A[subscript 2n+1](2143) of alternating permutations of length 2n+1 avoiding 2143 and the set of shifted standard Young tableaux of shape ⟨n+2,n+1,n⟩. We also give a number of conjectures and open questions on pattern avoidance in alternating permutations and generalizations thereof.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/1173
