Analytic combinatorics

zbMATH Open1165.05001MaRDI QIDQ3549563FDOQ3549563

Authors: Robert Sedgewick, Philippe Flajolet 

Publication date: 5 January 2009

Recommendations

• Analytic combinatorics in several variables.
• An invitation to analytic combinatorics. From one to several variables
• scientific article; zbMATH DE number 815575
• Analytic methods
• Analytic Combinatorics

zbMATH Keywords

generating functionssingularity analysisrandom structurescombinatorial structuresenumeration methodscomplex asymptotics

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cited In (only showing first 100 items - show all)

• Geometric grid classes of permutations
• Some enumerations on non-decreasing Motzkin paths
• Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
• A Boltzmann approach to percolation on random triangulations
• Enumerations of rational non-decreasing Dyck paths with integer slope
• On graphs with few disjoint \(t\)-star minors
• Edge flipping in graphs
• A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
• Enumeration of bipartite graphs and bipartite blocks
• Counting the palstars
• In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
• Asymptotics of quantum spin networks at a fixed root of unity
• On the Wiener index of random trees
• Two remarks on the adjoint polynomial
• Computational aspects of sturdy and flimsy numbers
• Unified bijections for maps with prescribed degrees and girth
• The depinning transition in presence of disorder: a toy model
• Uniform asymptotics of area-weighted Dyck paths
• Enumerating several aspects of non-decreasing Dyck paths
• Inflations of geometric grid classes of permutations
• A bijection for triangulations, quadrangulations, pentagulations, etc.
• On the critical exponents of generalized ballot sequences in three dimensions and large tandem walks
• The enumeration of permutations avoiding 3124 and 4312
• Multiple pattern matching: a Markov chain approach
• Asymptotic behavior and the moderate deviation principle for the maximum of a Dyck path
• Counting polygon dissections in the projective plane
• Growth constants of minor-closed classes of graphs
• The shape of unlabeled rooted random trees
• Partitions into distinct parts with bounded largest part
• Renormalized asymptotic enumeration of Feynman diagrams
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• On irreducible maps and slices
• A unifying approach for proving hook-length formulas for weighted tree families
• On the number of summands in a random prime partition
• On some expansions for the Euler gamma function and the Riemann zeta function
• Spectral dimension of trees with a unique infinite spine
• Bijections for planar maps with boundaries
• Title not available (Why is that?)
• Condensation in nongeneric trees
• Large deviations and ratio limit theorems for pattern-avoiding permutations
• On the parity of the Wiener index
• Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Periods of iterations of mappings over finite fields with restricted preimage sizes
• Generalized barred preferential arrangements
• Enumerating symmetric peaks in non-decreasing Dyck paths
• Mutant number distribution in an exponentially growing population
• Constructing set-operads from monoids
• The run transform
• Context-free pairs of groups. II: Cuts, tree sets, and random walks
• Successions in words and compositions
• On the expected number of perfect matchings in cubic planar graphs
• Width and mode of the profile for some random trees of logarithmic height
• On averages of randomized class functions on the symmetric groups and their asymptotics
• Counting glycans revisited
• On the sub-permutations of pattern avoiding permutations
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• Comments on: ``Queueing models for the analysis of communication systems
• Queueing models for the analysis of communication systems
• Computable convergence bounds of series expansions for infinite dimensional linear-analytic systems and application
• Longest run of equal parts in a random integer composition
• The degree profile of random Pólya trees
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Fine costs for Euclid's algorithm on polynomials and Farey maps
• Cardinality of Rauzy classes
• A general theory of Wilf-equivalence for Catalan structures
• Ascents of size less than \(d\) in compositions
• The random connection model on the torus
• Combinatorics of RNA-RNA interaction
• Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding
• The height and width of bargraphs
• An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
• The maximum degree of random planar graphs
• Enumeration of weighted plane trees
• Hadamard products of algebraic functions
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Set partition asymptotics and a conjecture of Gould and Quaintance
• Average site perimeter of directed animals on the two-dimensional lattices
• Combinatorics of \((q,y)\)-Laguerre polynomials and their moments
• Generating functions, Fibonacci numbers and rational knots
• Counting lattice paths with four types of steps
• Enumerations of peaks and valleys on non-decreasing Dyck paths
• On tessellations of random maps and the \(t_g\)-recurrence
• On tessellations of random maps and the \(t_g\)-recurrence
• Growth rates of geometric grid classes of permutations
• Matrices induced by arithmetic functions, primes and groupoid actions of directed graphs
• Optimal online selection of a monotone subsequence: a central limit theorem
• Intuitionistic vs. Classical Tautologies, Quantitative Comparison
• Unfair permutations
• Definability of combinatorial functions and their linear recurrence relations
• On the dynamics of the glass transition on Bethe lattices
• On the value set of small families of polynomials over a finite field. II
• Tail asymptotics of the stationary distribution of a two-dimensional reflecting random walk with unbounded upward jumps
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Noncontiguous pattern containment in binary trees
• Bias of a nonparametric entropy estimator for Markov measures
• Exact tail asymptotics for a two-stage queue: complete solution
• Asymptotics of waiting time distributions in the accumulating priority queue
• Counting directed acyclic and elementary digraphs

This page was built for publication: Analytic combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549563)