Article contents
Asymptotic normality in t-stack sortable permutations
Published online by Cambridge University Press: 04 November 2020
Abstract
In this paper, we show that the numbers of t-stack sortable n-permutations with k − 1 descents satisfy central and local limit theorems for t = 1, 2, n − 1 and n − 2. This result, in particular, gives an affirmative answer to Shapiro's question about the asymptotic normality of the Narayana numbers.
Keywords
MSC classification
- Type
- Research Article
- Information
- Proceedings of the Edinburgh Mathematical Society , Volume 63 , Issue 4 , November 2020 , pp. 1062 - 1070
- Copyright
- Copyright © The Author(s), 2020. Published by Cambridge University Press on Behalf of The Edinburgh Mathematical Society
References
- 2
- Cited by