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 (only showing first 100 items - show all)

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 ⋮ 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

This page was built for publication: Asymptotic Methods in Enumeration