Asymptotic normality in t-stack sortable permutations
From MaRDI portal
Publication:5145117
DOI10.1017/S0013091520000334zbMath1455.05001OpenAlexW3097888451MaRDI QIDQ5145117
Publication date: 20 January 2021
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0013091520000334
asymptotic normalitycentral limit theoremlocal limit theoremNarayana numbers\(t\)-stack sortable permutations
Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)
Related Items (3)
Recurrences for Callan's generalization of Narayana polynomials ⋮ Analytic properties of combinatorial triangles related to Motzkin numbers ⋮ The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schur positivity and the \(q\)-log-convexity of the Narayana polynomials
- Permutations sortable by \(n - 4\) passes through a stack
- The limiting distribution of the \(q\)-derangement numbers
- On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- A bijective census of nonseparable planar maps
- The Narayana distribution
- Multi-static enumeration of two-stack sortable permutations
- A survey of stack-sorting disciplines
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Asymptotic normality of Laplacian coefficients of graphs
- An asymptotic distribution theory for Eulerian recurrences with applications
- Counting 3-stack-sortable permutations
- Preimages under the stack-sorting algorithm
- A unified approach to polynomial sequences with only real zeros
- Central and local limit theorems applied to asymptotic enumeration
- The Real-rootedness of Eulerian Polynomials via the Hermite--Biehler Theorem
- The limiting distribution of the coefficients of the 𝑞-Catalan numbers
- Log-concavity and strong q-log-convexity for Riordan arrays and recursive matrices
- On linear transformations preserving the Pólya frequency property
- Stirling Behavior is Asymptotically Normal
- Asymptotic properties of eulerian numbers
- The fundamental limit theorems in probability
- Some open questions about random walks, involutions, limiting distributions, and generating functions
This page was built for publication: Asymptotic normality in t-stack sortable permutations