A Short Proof for the Number of Permutations Containing Pattern 321 Exactly Once

  • Alexander Burstein
DOI: https://doi.org/10.37236/2017

Abstract

We give a short proof for J. Noonan's result on the number of permutations containing pattern 321 exactly once.

Published
2011-09-02
How to Cite
Burstein, A. (2011). A Short Proof for the Number of Permutations Containing Pattern 321 Exactly Once. The Electronic Journal of Combinatorics, 18(2), P21. https://doi.org/10.37236/2017
Issue
Volume 18, Issue 2 (2011-2) (The Zeilberger Festschrift volume)
Article Number
P21