On a family of conjectures of Joel Lewis on alternating permutations
From MaRDI portal
Publication:2014704
Abstract: We prove generalized versions of some conjectures of Joel Lewis on the number of alternating permutations avoiding certain patterns. Our main tool is the perhaps surprising observation that a classic bijection on pattern avoiding permutations often preserves the alternating property.
Recommendations
- Counting 1324, 4231-avoiding permutations
- Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns
- Counting 1324-avoiding permutations
- The number of permutations avoiding a set of generalized permutation patterns
- A new upper bound for 1324-avoiding permutations
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- On (shape-)Wilf-equivalence for words
- scientific article; zbMATH DE number 1504635
- Using functional equations to enumerate 1324-avoiding permutations
- Alternating, pattern-avoiding permutations
Cites work
Cited in
(10)- On pattern avoiding alternating permutations
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations
- On refinements of Wilf-equivalence for involutions
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- A conjecture of Stanley on alternating permutations
- Even permutations not representable in the form of a product of two permutations of given order
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
- Pattern avoiding alternating involutions
- On a refinement of Wilf-equivalence for permutations
This page was built for publication: On a family of conjectures of Joel Lewis on alternating permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014704)
