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)

• Spanning trees in random series-parallel graphs
• On simulation and properties of the stable law
• On the probability of planarity of a random graph near the critical point
• Spanning forests in regular planar maps
• A refinement of Dyck paths: A combinatorial approach
• Planar maps and continued fractions
• Rates of decay in the classical Katznelson-Tzafriri theorem
• A new generalized Weibull family of distributions: mathematical properties and applications
• XML compression via directed acyclic graphs
• Large deviation analysis of a droplet model having a Poisson equilibrium distribution
• Local probabilities for random permutations without long cycles
• Counting strings at height \(j\) in Dyck paths
• The enumeration of prudent polygons by area and its unusual asymptotics
• Topological classification and enumeration of RNA structures by genus
• The uplift principle for ordered trees
• Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits
• Connectivity for bridge-alterable graph classes
• On the Lyndon dynamical system
• The shape of random tanglegrams
• Parking functions for mappings
• Combinatorics meets potential theory
• Degree distribution in random planar graphs
• Non-D-finite excursions in the quarter plane
• Cut equivalence of \(d\)-dimensional guillotine partitions
• Localization of an inhomogeneous discrete-time quantum walk on the line
• Nicolaas Govert de Bruijn, the enchanter of friable integers
• Counting permutations by alternating descents
• Generalized Stirling permutations, families of increasing trees and urn models
• Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
• Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
• Batcher's odd-even exchange revisited: a generating functions approach
• Towards a realistic analysis of the QuickSelect algorithm
• The height of multiple edge plane trees
• On the spectral dimension of causal triangulations
• Enumeration results for alternating tree families
• Omnibus sequences, coupon collection, and missing word counts
• Graph limits of random unlabelled k-trees
• Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
• Correlation, partitioning and the probability of casting a decisive vote under the majority rule
• The multi-orientable random tensor model, a review
• Enumerations of plane trees with multiple edges and Raney lattice paths
• Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
• On the largest part size of low‐rank combinatorial assemblies
• Exact enumeration of satisfiable 2-SAT formulae
• Random subgroups of Thompson's group \(F\).
• Algebraic dynamic programming for multiple context-free grammars
• Stochastic analysis of the extra clustering model for animal grouping
• A set-operad of formal fractions and dendriform-like sub-operads
• Horizontal runs in domino tilings
• A unified approach to linear probing hashing with buckets
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• Compositions into powers of \(b\): asymptotic enumeration and parameters
• On the cost of fixed partial match queries in \(K\)-d trees
• Nonrepetitive colouring via entropy compression
• Key recovery attacks on iterated Even-Mansour encryption schemes
• A limit process for partial match queries in random quadtrees and 2-d trees
• Limit measures of inhomogeneous discrete-time quantum walks in one dimension
• Random-walk in beta-distributed random environment
• A Chung-Feller property for the generalized Schröder paths
• Rare event asymptotics for a random walk in the quarter plane
• Enumeration formulæ for pattern restricted Stirling permutations
• Maximum likelihood analysis of algorithms and data structures
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Intervals of balanced binary trees in the Tamari lattice
• Pattern avoidance in matchings and partitions
• Isomorphism and symmetries in random phylogenetic trees
• Enumeration and limit laws for series-parallel graphs
• The uncover process for random labeled trees
• Singularity analysis via the iterated kernel method
• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• On the functions counting walks with small steps in the quarter plane
• A bijection for nonorientable general maps
• Expected distance between terminal nucleotides of RNA secondary structures
• The spectral dimension of generic trees
• Towards a realistic analysis of some popular sorting algorithms
• About a possible analytic approach for walks in the quarter plane with arbitrary big jumps
• Combinatorial operads from monoids
• Asymptotic enumeration and limit laws of planar graphs
• Finding regular insertion encodings for permutation classes
• Counting subwords in flattened partitions of sets
• Analytic urns
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)
• A symbolic method to analyse patterns in plant structure
• Necklaces and bracelets in R
• Pattern avoidance in binary trees
• Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
• Asymptotic expansion of the multi-orientable random tensor model
• Markovian retrial queues with two way communication
• Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets
• Inferring sequences produced by elliptic curve generators using Coppersmith's methods
• Acyclic edge-coloring using entropy compression
• Limit theorems for patterns in phylogenetic trees
• \(O(N)\) random tensor models
• Efficient random sampling of binary and unary-binary trees via holonomic equations
• On shuffled-square-free words
• Partitions with fixed differences between largest and smallest parts
• A human proof of Gessel's lattice path conjecture
• Partial match queries in two-dimensional quadtrees: a probabilistic approach

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)