Photo by thomasw from unsplash
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… Click to show full abstract
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:
asymptotic normality;
stack sortable;
sortable permutations;
normality stack
Journal Title: Proceedings of the Edinburgh Mathematical Society
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Proceedings of the Edinburgh Mathematical Society
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!