Asymptotic normality in t-stack sortable permutations
DOI10.1017/S0013091520000334zbMATH Open1455.05001OpenAlexW3097888451MaRDI QIDQ5145117FDOQ5145117
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
Permutations, words, matrices (05A05) Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Factorials, binomial coefficients, combinatorial functions (05A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limiting distribution of the coefficients of the š-Catalan numbers
- On linear transformations preserving the Pólya frequency property
- On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations
- A unified approach to polynomial sequences with only real zeros
- Central and local limit theorems applied to asymptotic enumeration
- Stirling Behavior is Asymptotically Normal
- A bijective census of nonseparable planar maps
- Asymptotic normality of Laplacian coefficients of graphs
- Some open questions about random walks, involutions, limiting distributions, and generating functions
- A survey of stack-sorting disciplines
- Schur positivity and the \(q\)-log-convexity of the Narayana polynomials
- 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)\)!)
- Multi-static enumeration of two-stack sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Permutations sortable by \(n - 4\) passes through a stack
- The real-rootedness of Eulerian polynomials via the Hermite-Biehler theorem
- Asymptotic properties of eulerian numbers
- The Narayana distribution
- The fundamental limit theorems in probability
- The limiting distribution of the \(q\)-derangement numbers
- Counting 3-stack-sortable permutations
- Preimages under the stack-sorting algorithm
- Log-concavity and strong q-log-convexity for Riordan arrays and recursive matrices
- An asymptotic distribution theory for Eulerian recurrences with applications
Cited In (3)
This page was built for publication: Asymptotic normality in t-stack sortable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145117)