Asymptotic Methods in Enumeration

DOI10.1137/1016082zbMath0294.05002OpenAlexW2045390532MaRDI 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

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15)

Related Items

Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent, The asymptotic number of rooted maps on a surface, Riordan arrays and combinatorial sums, 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, Enumeration of 2-connected loopless 4-regular maps on the plane, Approximating the distribution of an extreme value statistic based on estimates from a generating function, Context-free languages and random walks on groups, Exact satisfiability, a natural extension of set partition, and its average case behavior, The expected complexity of analytic tableaux analyses in propositional calculus. II, 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, Chromatic sums of general maps on the sphere and the projective plane, Enumerating phylogenetic trees with multiple labels, Average case analysis of DJ graphs, Random triangulations of the plane, Face sizes of 3-polytopes, The asymptotic enumeration of rooted convex polyhedra, A modified HOL priority scheduling discipline: performance analysis, On the number of matchings of a tree, Enumerative properties of rooted circuit maps, Enumeration of noncrossing trees on a circle, Asymptotics and random sampling for BCI and BCK lambda terms, Asymptotic properties of keys and functional dependencies in random databases, Counting 2-connected 4-regular maps on the projective plane, Restrictive patterns of combinatorial structures via comparative analysis, Counting permutations, Inserting a new element into a heap, On the number of deepest nodes in ordered trees, Periodic oscillations of coefficients of power series that satisfy functional equations, Permutations sortable by two stacks in parallel and quarter plane walks, Asymptotics of the moments of the number of cycles of a random \(A\)-permutation, On numbers related to partitions of unlike objects and occupancy problems, The average height of binary trees and other simple trees, Tail asymptotics for a generalized two-demand queueing model -- a kernel method, 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, Marking in combinatorial constructions: Generating functions and limiting distributions, Random trees in queueing systems with deadlines, Limit theorems for the logarithm of the order of a random \(A\)-mapping, Morse functions statistics, Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits, 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, The specification of 2-trees, Distributions on bicoloured binary trees arising from the principle of parsimony, The average height of directed column-convex polyominoes having square, hexagonal and triangular cells, On the number of transversals in Cayley tables of cyclic groups, Degree distribution in random planar graphs, Efficient pricing of discrete Asian options, The number of nonseparable maps on the projective plane, Combinatorial properties of a general domination problem with parity constraints, On a class of linked diagrams. II: Asymptotics, On the number of \(A\)-mappings, The asymptotic number of labeled graphs with given degree sequences, The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces, Nicolaas Govert de Bruijn, the enchanter of friable integers, 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, Enumeration of labeled, connected, homeomorphically irreducible graphs, On the parity of the Wiener index, Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets, Asymptotic expansions for the coefficients of analytic generating functions, Asymptotics for coefficients of algebraic functions, On two classes of permutations with number-theoretic conditions on the lengths of the cycles, On an asymptotic method in enumeration, Combinatorics of RNA secondary structures, Labelled and unlabelled enumeration of \(k\)-gonal 2-trees, Underdiagonal lattice paths with unrestricted steps, Arithmetical semigroups related to trees and polyhedra, The fine numbers refined, Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions, Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort, Dyck path enumeration, 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, Remarks on an asymptotic method in combinatorics, Partitions of multisets. II, On a recurrence involving Stirling numbers, The number of degree restricted maps on general surfaces, Resurrecting the asymptotics of linear recurrences, A strip-like tiling algorithm, Asymptotics of multivariate sequences. I: Smooth points of the singular variety, A pattern for the asymptotic number of rooted maps on surfaces, Permutations with \(p^ l\)th roots, Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree, Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube, The log-balancedness of generalized derangement numbers, Forbidden subgraphs in connected graphs, Integer partitions and the Sperner property, Stirling Number Asymptotics from Recursion Equations Using the Ray Method, Analysis of exact tail asymptotics for singular random walks in the quarter plane, Combined Analysis of Transient Delay Characteristics and Delay Autocorrelation Function in theGeo^X/G/1Queue, An undecidable problem in finite combinatorics, Analytic combinatorics for computing seeding probabilities, The random generation of underdiagonal walks, Random walks on free products, quotients and amalgams, A convergent quadratic-time lattice algorithm for pricing European-style Asian options, A logical approach to asymptotic combinatorics. II: Monadic second-order properties, Random permutations with cycle lengths in a given finite set, Return probabilities for random walk on a half-line, Enumeration of polyominoes using Macsyma, Enumeration of algebras close to absolutely free algebras and binary trees, Current trends in asymptotics: Some problems and some solutions, Part Sizes of Smooth Supercritical Compositional Structures, Asymptotic Properties of Some Minor-Closed Classes of Graphs, Approxmating the distribution of the maximum of a dependent stationary sequence based on estimatimates from a genrating function, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, Sequence Alignments with Matched Sections, Unnamed Item, Powers in wreath products of finite groups, Analytic methods in asymptotic enumeration, Exact tail asymptotics for a two-stage queue: Complete solution via kernel method, The asymptotics of 𝑒^{𝑃(𝑧)} and the number of elements of each order in 𝑆_{𝑛}, The number of clone orderings, Chromatic sums of nonseparable near-triangulations on the projective plane, Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow, Protected points in ordered trees, Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach, Classical and almost sure local limit theorems, Chromatic sums of biloopless nonseparable near-triangulations on the projective plane, RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP, Counting Interval Graphs, On the average minimal prefix-length of the generalized semi-Dycklanguage, Counting rooted unicursal planar maps, Rumor processes in random environment on \(\mathbb N\) and on Galton-Watson trees, On the expected number of edges in a maximum matching of an (r,s)-tree, Random \(A\)-permutations and Brownian motion, 4-edge-connected 4-regular maps on the projective plane, The butterfly decomposition of plane trees, Unnamed Item, Estimating the inter-occurrence time distribution from superposed renewal processes, Counting finite models, Elements with Square Roots in Finite Groups, Counting 5-connected planar triangulations, Random \(A\)-permutations: convergence to a Poisson process, Asymptotics with remainder term for moments of the total cycle number of random \(A\)-permutation, Asymptotic enumeration of RNA secondary structure, On the combinatorics of leftist trees, Enumerating near-4-regular maps on the sphere and the torus, A limit theorem for the logarithm of the order of a random A-permutation, Fair division of indivisible items among people with similar preferences, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random permutations on a set with a binary relation, Exact tail asymptotics in a priority queue -- characterizations of the preemptive model, Integral Representation and Algorithms for Closed Form Summation, Asymptotics for logical limit laws: When the growth of the components is in an RT class, Taxonomic classes of sets, Generating asymptotics for factorially divergent sequences, Size distribution of the largest component of a random \(a\)-mapping, Generating asymptotics for factorially divergent sequences, Analytic analysis of algorithms, On the inner structure of multidimensional simply generated trees, On the inner structure of multidimensional simply generated trees, On the Order of Random Permutation with Cycle Weights, Weakly protected points in ordered trees, Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums, Distributions of near-4-regular maps on the sphere and the projective plane, Uniform asymptotic estimates of transition probabilities on combs, USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS, Prevalence expansion in NIMFA, On a generalization of class of negative binomial distributions, General combinatorics of RNA secondary structure, Limit Poisson law for the distribution of the number of components in generalized allocation scheme, An efficient convergent lattice algorithm for European Asian options, Enumeration of loopless maps on the projective plane, On a Number of Components in a Random $A$-Mapping, 4-regular maps on the Klein bottle, The number of loopless \(4\)-regular maps on the projective plane, Some useful preservation theorems, Asymptotic Limits for a Two-Dimensional Recursion, On the robustness of interconnections in random graphs: a symbolic approach., Exact tail asymptotics for a discrete-time preemptive priority queue, Statistics of subgroups of the modular group, The \(t\)-intersection problem in the truncated Boolean lattice, Cycle structure of random permutations with cycle weights, On the number of components of fixed size in a random \(A\)-mapping