Analytic methods in asymptotic enumeration
From MaRDI portal
Publication:1917527
DOI10.1016/0012-365X(95)00139-NzbMath0852.05011MaRDI QIDQ1917527
Publication date: 25 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
generating functionsasymptotic enumerationrandom permutationsaddle point methoddegree sequencebinary treesset partitionHaiman-admissible functions
Related Items
Estimating the \(k\)th coefficient of \((f(z))^{n}\) when \(k\) is not too large, Dissecting the Stanley partition function
Cites Work
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- Branching processes in the analysis of the heights of trees
- The average height of binary trees and other simple trees
- Automatic average-case analysis of algorithms
- Explicit Tauberian estimates for functions with positive coefficients
- The height of a random partial order: Concentration of measure
- Asymptotic enumeration by degree sequence of graphs of high degree
- A Generalisation of Stirling's Formula.
- Singularity Analysis of Generating Functions
- Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations
- A note on the height of binary search trees
- Asymptotic Methods in Enumeration
- The Distribution of Heights of Binary Trees and Other Simple Trees
- Analytic analysis of algorithms
- The Asymptotic Behaviour of the Laurent Coefficients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item