Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions

From MaRDI portal
Revision as of 10:31, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1838962

DOI10.1016/0097-3165(83)90062-6zbMath0511.05003OpenAlexW2026252457MaRDI QIDQ1838962

Edward A. Bender, L. Bruce Richmond

Publication date: 1983

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(83)90062-6




Related Items (38)

A generalization of Canfield's formulaAsymptotic distributions and a multivariate Darboux method in enumeration problemsDistribution of tree parameters by martingale approachTuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplersLongest alternating subsequences of permutationsOccupancy urn models in the analysis of algorithmsNumbers with fixed sum of digits in linear recurrent number systemsExtended admissible functions and Gaussian limiting distributionsThe Distribution of Heights of Binary Trees and Other Simple TreesThe asymptotic enumeration of rooted convex polyhedraAsymptotics of bivariate analytic functions with algebraic singularitiesOn the number of matchings of a treeCoefficient asymptotics of algebraic multivariable generating functionsAsymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)Asymptotics of multivariate sequences. IV: Generating functions with poles on a hyperplane arrangementEffective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systemsAsymptotics of multivariate sequences. III: Quadratic pointsHigher dimensional quasi-power theorem and Berry-Esseen inequalityMarking in combinatorial constructions: Generating functions and limiting distributionsSteepest descent method and limiting distributions in combinatorial analysisAsymptotic normality of a class of discrete power series distributionsThe Hamming weight of the non-adjacent-form under various input statisticsCentral and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functionsGeneral combinatorial schemas: Gaussian limit distributions and exponential tailsUnnamed ItemD?E?K=(1000)8On a multivariate contraction method for random recursive structures with applications to QuicksortVertices of given degree in series-parallel graphsCentral and local limit theorems applied to asymptotic enumeration. III. Matrix recursionsThe Distribution of Patterns in Random TreesLinear $k$-Chord DiagramsAnalytic analysis of algorithmsThe asymptotic number of rooted maps on a surface. II: Enumeration by vertices and facesUnnamed ItemStatistical properties of lambda termsAnalytic combinatorics of non-crossing configurationsA survey of the asymptotic behaviour of mapsAsymptotics of multivariate sequences. I: Smooth points of the singular variety



Cites Work


This page was built for publication: Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions