Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T00:54:16.993Z Has data issue: false hasContentIssue false

Asymptotic normality in t-stack sortable permutations

Published online by Cambridge University Press:  04 November 2020

Xi Chen
Affiliation:
School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, PR China (wangyi@dlut.edu.cn)
Jianxi Mao
Affiliation:
School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, PR China (wangyi@dlut.edu.cn)
Yi Wang
Affiliation:
School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, PR China (wangyi@dlut.edu.cn)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © The Author(s), 2020. Published by Cambridge University Press on Behalf of The Edinburgh Mathematical Society