Central and local limit theorems for the coefficients of polynomials of binomial type
From MaRDI portal
Publication:1260425
DOI10.1016/0097-3165(77)90019-XzbMath0412.60032MaRDI QIDQ1260425
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
generating functioncentral limit theoremlocal limit theorempolynomials of binomial typelog-concavity
Central limit and other weak theorems (60F05) Factorials, binomial coefficients, combinatorial functions (05A10)
Related Items (38)
A generalization of Canfield's formula ⋮ Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones ⋮ Polynomials of binomial type and compound Poisson processes ⋮ Current trends in asymptotics: Some problems and some solutions ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ Limiting distributions for the number of distinct component sizes in relational structures ⋮ Asymptotic normality of a class of bivariate-multivariate discrete power series distributions ⋮ On rational structures and their asymptotics ⋮ Large deviations for combinatorial distributions. I: Central limit theorems ⋮ Recurrences for Callan's generalization of Narayana polynomials ⋮ Application of the Berry-Esseen inequality to combinatorial estimates ⋮ Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions ⋮ Classical and almost sure local limit theorems ⋮ A \(q\)-analogue of the Stirling formula and a continuous limiting behaviour of the \(q\)-binomial distribution -- numerical calculations ⋮ The global theory of flows in networks ⋮ On a problem of Rota ⋮ Polynomials of Binomial Type and Renewal Sequences ⋮ Automatic average-case analysis of algorithms ⋮ Counting simsun permutations by descents ⋮ Descents on quasi-Stirling permutations ⋮ Marking in combinatorial constructions: Generating functions and limiting distributions ⋮ Steepest descent method and limiting distributions in combinatorial analysis ⋮ Asymptotic normality of a class of discrete power series distributions ⋮ An algebraic approach to Sheffer polynomial sequences ⋮ General combinatorial schemas: Gaussian limit distributions and exponential tails ⋮ Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones ⋮ Gaussian limiting distributions for the number of components in combinatorial structures ⋮ Analytic analysis of algorithms ⋮ Ascents and descents in random trees ⋮ Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number ⋮ A unified treatment for the asymptotic normality of the coefficients of polynomials related to orthogonal ones ⋮ Large deviations of combinatorial distributions. II: Local limit theorems ⋮ On the asymptotic number of tournament score sequences ⋮ Asymptotic normality of the Ward numbers ⋮ An asymptotic formula for the exponential polynomials and a central limit theorem for their coefficients ⋮ Continuous Stieltjes-Wigert limiting behaviour of a family of confluent \(q\)-Chu-Vandermonde distributions ⋮ Asymptotically minimum variance unbiased estimation for a class of power series distributions ⋮ Limit theorems for numbers satisfying a class of triangular arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Central and local limit theorems applied to asymptotic enumeration
- A Generalisation of Stirling's Formula.
- Asymptotic Methods in Enumeration
- A linear algebra setting for the rota-mullin theory of polynomials of binomial type
- An exposá of the mullin-rota theory of polynomials of binomial type
- Stirling Behavior is Asymptotically Normal
- Asymptotic properties of eulerian numbers
This page was built for publication: Central and local limit theorems for the coefficients of polynomials of binomial type
