Asymptotic Methods in Enumeration

DOI10.1137/1016082zbMath0294.05002MaRDI QIDQ4046051

Edward A. Bender

Publication date: 1974

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1016082

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05A15: Exact enumeration problems, generating functions

Related Items

The asymptotic enumeration of rooted convex polyhedra, Marking in combinatorial constructions: Generating functions and limiting distributions, Random trees in queueing systems with deadlines, The specification of 2-trees, Asymptotic expansions for the coefficients of analytic generating functions, Asymptotics for coefficients of algebraic functions, Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort, Remarks on an asymptotic method in combinatorics, Partitions of multisets. II, On a recurrence involving Stirling numbers, Chromatic sums of general maps on the sphere and the projective plane, Average case analysis of DJ graphs, A modified HOL priority scheduling discipline: performance analysis, On the number of matchings of a tree, On the number of deepest nodes in ordered trees, Morse functions statistics, Combinatorial properties of a general domination problem with parity constraints, On an asymptotic evaluation of the cycle index of the symmetric group, Local limits and harmonic functions for nonisotropic random walks on free groups, A survey of the asymptotic behaviour of maps, Random walks on amalgams, On the average internal path length of m-ary search trees, Resurrecting the asymptotics of linear recurrences, Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent, The asymptotic number of rooted maps on a surface, The resolvent for simple random walks on the free product of two discrete groups, Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials, Some asymptotic results useful in enumeration problems, Monotonically labelled Motzkin trees, Approximating the distribution of an extreme value statistic based on estimates from a generating function, Context-free languages and random walks on groups, A logical approach to asymptotic combinatorics I. First order properties, Some methods for computing component distribution probabilities in relational structures, On the distribution of the number of optimal elements for various generalized weak orders, A note on the number of leftist trees, Limit theorem concerning random mapping patterns, The asymptotic number of rooted nonseparable maps on a surface, Enumerating phylogenetic trees with multiple labels, Random triangulations of the plane, Face sizes of 3-polytopes, Counting permutations, Inserting a new element into a heap, Periodic oscillations of coefficients of power series that satisfy functional equations, On numbers related to partitions of unlike objects and occupancy problems, The average height of binary trees and other simple trees, The number of rooted triangular maps on a surface, The number of order-preserving maps of fences and crowns, The number of rooted 2-connected triangular maps on the projective plane, The asymptotic number of rooted 2-connected triangular maps on a surface, Asymptotic expansions for second-order linear difference equations, The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line, FCFS-scheduling in a hard real-time environment under rush-hour conditions, Numerical inversion of probability generating functions, Some investigations on FCFS scheduling in hard real time applications, Distributions on bicoloured binary trees arising from the principle of parsimony, On a class of linked diagrams. II: Asymptotics, The asymptotic number of labeled graphs with given degree sequences, On some new sequences generalizing the Catalan and Motzkin numbers, Central and local limit theorems for the coefficients of polynomials of binomial type, The expected additive weight of trees, On two classes of permutations with number-theoretic conditions on the lengths of the cycles, Combinatorics of RNA secondary structures, Underdiagonal lattice paths with unrestricted steps, Arithmetical semigroups related to trees and polyhedra, Dyck path enumeration, The number of degree restricted maps on general surfaces, A pattern for the asymptotic number of rooted maps on surfaces, Permutations with \(p^ l\)th roots, Riordan arrays and combinatorial sums, Enumeration of 2-connected loopless 4-regular maps on the plane, Exact satisfiability, a natural extension of set partition, and its average case behavior, The expected complexity of analytic tableaux analyses in propositional calculus. II, Enumeration of noncrossing trees on a circle, Asymptotic properties of keys and functional dependencies in random databases, A strip-like tiling algorithm, Asymptotics of multivariate sequences. I: Smooth points of the singular variety, The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces, Enumeration of labeled, connected, homeomorphically irreducible graphs, On an asymptotic method in enumeration, Labelled and unlabelled enumeration of \(k\)-gonal 2-trees, Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions, Enumeration of loopless maps on the projective plane, 4-regular maps on the Klein bottle, The number of loopless \(4\)-regular maps on the projective plane, On the robustness of interconnections in random graphs: a symbolic approach., The \(t\)-intersection problem in the truncated Boolean lattice, Forbidden subgraphs in connected graphs, Integer partitions and the Sperner property, The random generation of underdiagonal walks, Return probabilities for random walk on a half-line, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, Analytic methods in asymptotic enumeration, The number of clone orderings, Random permutations on a set with a binary relation, Taxonomic classes of sets, A convergent quadratic-time lattice algorithm for pricing European-style Asian options, Enumeration of algebras close to absolutely free algebras and binary trees, Protected points in ordered trees, The butterfly decomposition of plane trees, Random \(A\)-permutations: convergence to a Poisson process, On the average minimal prefix-length of the generalized semi-Dycklanguage, Unnamed Item, Counting finite models, Asymptotics for logical limit laws: When the growth of the components is in an RT class, Uniform asymptotic estimates of transition probabilities on combs, On the inner structure of multidimensional simply generated trees, On the inner structure of multidimensional simply generated trees, On the expected number of edges in a maximum matching of an (r,s)-tree, Elements with Square Roots in Finite Groups, On the combinatorics of leftist trees, Enumerating near-4-regular maps on the sphere and the torus, Fair division of indivisible items among people with similar preferences, Asymptotic enumeration of RNA secondary structure, General combinatorics of RNA secondary structure, An efficient convergent lattice algorithm for European Asian options, A logical approach to asymptotic combinatorics. II: Monadic second-order properties, Enumeration of polyominoes using Macsyma, Current trends in asymptotics: Some problems and some solutions, Unnamed Item, Counting 5-connected planar triangulations, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Approxmating the distribution of the maximum of a dependent stationary sequence based on estimatimates from a genrating function, RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP, Some useful preservation theorems, An undecidable problem in finite combinatorics, Random walks on free products, quotients and amalgams, Sequence Alignments with Matched Sections, The asymptotics of 𝑒^{𝑃(𝑧)} and the number of elements of each order in 𝑆_{𝑛}, Counting Interval Graphs, Asymptotic Limits for a Two-Dimensional Recursion, Stirling Number Asymptotics from Recursion Equations Using the Ray Method, Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums