Analytic combinatorics
zbMATH Open1165.05001MaRDI QIDQ3549563FDOQ3549563
Authors: Robert Sedgewick, Philippe Flajolet
Publication date: 5 January 2009
Recommendations
generating functionssingularity analysisrandom structurescombinatorial structuresenumeration methodscomplex asymptotics
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)
- Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
- Set partitions and moments of random variables
- Scaling limits of slim and fat trees
- Acyclic edge coloring through the Lovász local lemma
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- Exact solution of the 2d dimer model: corner free energy, correlation functions and combinatorics
- A functional limit theorem for the profile of random recursive trees
- Topology in colored tensor models via crystallization theory
- The Euler characteristic of out \((F_n)\)
- Counting ascents in generalized Dyck paths
- Hausdorff means and moment sequences
- The sequential occupancy problem through group throwing of indistinguishable balls
- G-degree for singular manifolds
- Hypergeometric functions and Feynman diagrams
- Limit distributions of smallest gap and largest repeated part in integer partitions
- Orbital measures on \(\mathrm{SU}(2)/\mathrm{SO}(2)\)
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- Enumeration of r-smooth words over a finite alphabet
- On the generating functions of pattern-avoiding Motzkin paths
- About an extension of the Mirsky-Newman, Davenport-Rado result to the Herzog-Schönheim conjecture for free groups
- Bijections between directed animals, multisets and Grand-Dyck paths
- Improved upper bounds on the growth constants of polyominoes and polycubes
- On \(1324\)-avoiding permutations
- Exact and asymptotic enumeration of cyclic permutations according to descent set
- Variances and covariances in the central limit theorem for the output of a transducer
- Two-way communication retrial queues with multiple types of outgoing calls
- Branching Brownian motion with absorption and the all-time minimum of branching Brownian motion with drift
- Title not available (Why is that?)
- Removing apparent singularities of linear difference systems
- The zeros of the partition function of the pinning model
- Extremal statistics on non-crossing configurations
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Descents following maximal values in samples of geometric random variables
- Output sum of transducers: limiting distribution and periodic fluctuation
- \(\mathbb C\)-valued functions induced by graphs
- Interval partitions and polynomial factorization
- On the density of the set of known Hadamard orders
- On a conjecture of Cusick concerning the sum of digits of \(n\) and \(n+t\)
- Reflection Cryptanalysis of PRINCE-Like Ciphers
- An exact formulation of the time-ordered exponential using path-sums
- The distribution of the size of the union of cycles for two types of random permutations
- On comparability of bigrassmannian permutations
- On the asymptotic normality of the Legendre-Stirling numbers of the second kind
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Statistics of topological RNA structures
- A novel extension of the Lagrange-Bürmann expansion formula
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Random 2 XORSAT phase transition
- Plane trivalent trees and their patterns
- Enumeration of hypermaps of a given genus
- Asymptotic number of hairpins of saturated RNA secondary structures
- The growth rate of high-dimensional tree polycubes
- Möbius inversion formula for monoids with zero.
- Weakly directed self-avoiding walks
- Enumerating symmetric directed convex polyominoes
- Exact site-percolation probability on the square lattice
- Maximum and records of random walks with stochastic resetting
- Scaling limits of random Pólya trees
- On isomorphism classes of generalized Fibonacci cubes
- Counting subgraphs in hyperbolic graphs with symmetry
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- Arithmetic theory of \(E\)-operators
- On trees invariant under edge contraction
- Uniform measures on braid monoids and dual braid monoids
- Some limit theorems with respect to constrained permutations and partitions
- Analysis of bidirectional ballot sequences and random walks ending in their maximum
- Universal asymptotic clone size distribution for general population growth
- A central limit theorem for additive functionals of increasing trees
- Combinatorial parameters in bargraphs
- Combinatorial design of pseudoknot RNA
- Bilabelled increasing trees and hook-length formulae
- The \(q\)-Catalan numbers: a saddle point approach
- The edge correlation of random forests
- Phase transitions of iterated Higman-style well-partial-orderings
- Sharp threshold for percolation on expanders
- Reflection ciphers
- Bounded height interlaced pairs of parking functions
- The probability that a random multigraph is simple. II
- Schröder's problems and scaling limits of random trees
- Large \(N\) limits in tensor models: towards more universality classes of colored triangulations in dimension \(d\geq 2\)
- A relation between Schröder paths and Motzkin paths
- Tail asymptotics for a generalized two-demand queueing model -- a kernel method
- On the number of fuzzy subgroups of finite Abelian groups.
- Weighted Hurwitz numbers and topological recursion
- Higher dimensional quasi-power theorem and Berry-Esseen inequality
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Geometric random variables: descents following maxima
- Krein-space operators determined by free product algebras induced by primes and graphs
- Integral representation of certain combinatorial recurrences
- Number of appearances of events in random sequences: a new generating function approach to type II and type III runs
- On \(q\)-quasiadditive and \(q\)-quasimultiplicative functions
- An exactly solvable self-convolutive recurrence
- Numerical stability of Grünwald-Letnikov method for time fractional delay differential equations
- Smooth Schubert varieties in the affine flag variety of type \(\tilde{A}\)
- The Hamming weight of the non-adjacent-form under various input statistics
- Moment explosions in the rough Heston model
- Maps preserving moment sequences
- Hiking a generalized Dyck path: a tractable way of calculating multimode boson evolution operators
- An algorithm computing combinatorial specifications of permutation classes
- Words in linear groups, random walks, automata and P-recursiveness
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)