Application of the Berry-Esseen inequality to combinatorial estimates

DOI10.1016/0097-3165(80)90056-4zbMath0429.05007MaRDI QIDQ1137580

E. Rodney Canfield

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90056-4

zbMATH Keywords

enumeration; central limit theorem; Berry-Esseen inequality; local limit theorem; log concave sequence; proper log concavity

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

05A15: Exact enumeration problems, generating functions

41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)

05A20: Combinatorial inequalities

26C99: Polynomials, rational functions in real analysis

Related Items

Asymptotic normality of a class of discrete power series distributions, Generation of a random partition of a finite set by an urn model, On the asymptotic number of tournament score sequences, Maximum antichains of rectangular arrays, The global theory of flows in networks, Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers, On sets not containing arithmetic progressions of a certain kind, A note on unimodality and asymptotic normality, On a problem of Rota, Maximum antichains in the partition lattice, Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones, On rational structures and their asymptotics, Matching behaviour is asymptotically normal, Large deviations for combinatorial distributions. I: Central limit theorems, Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees

Cites Work

• Unnamed Item
• Central and local limit theorems for the coefficients of polynomials of binomial type
• Central and local limit theorems applied to asymptotic enumeration