Abstract
In Proposition 2.1.3 we proved that the number of 231-avoiding n-permutations is given by the n-th Catalan number, \( C_{n}=\frac{1}{n+1}(^{2n}_{n}).\)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kitaev, S. (2011). Bijections between 321- and 132-avoiding permutations. In: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17333-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17332-5
Online ISBN: 978-3-642-17333-2
eBook Packages: Computer ScienceComputer Science (R0)