Analytic combinatorics
From MaRDI portal
Publication:3549563
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)
- On quantum percolation in finite regular graphs
- Boltzmann samplers for \(v\)-balanced cycles
- Asymptotics and random sampling for BCI and BCK lambda terms
- The height of two types of generalised Motzkin paths
- \(k\)-protected vertices in binary search trees
- Local limit of labeled trees and expected volume growth in a random quadrangulation
- Residues and telescopers for bivariate rational functions
- Representing prefix and border tables: results on enumeration
- The structure of alternative tableaux
- Large deviation properties for patterns
- Random graphs from a weighted minor-closed class
- The number of fixed points of Wilf's partition involution
- The shape of random pattern-avoiding permutations
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
- Controlled non-uniform random generation of decomposable structures
- Hypergeometric expressions for generating functions of walks with small steps in the quarter plane
- Large genus asymptotic geometry of random square-tiled surfaces and of random multicurves
- Semi-fractional diffusion equations
- Exact tail asymptotics for a discrete-time preemptive priority queue
- Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
- Random unfriendly seating arrangement in a dining table
- Constructing small tree grammars and small circuits for formulas
- Local limit theorems for generalized scheme of allocation of particles into ordered cells
- Divisibility of binomial coefficients by powers of two
- Entropy and drift in word hyperbolic groups
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- On the transient behavior of Ehrenfest and Engset processes
- Exactly solved models
- Random permutation matrices under the generalized Ewens measure
- Integral Representation and Algorithms for Closed Form Summation
- On the number of words with restrictions on the number of symbols
- Enumeration and asymptotic formulas for rectangular partitions of the hypercube
- Protected vertices in Motzkin trees
- A new upper bound for 1324-avoiding permutations
- \(k\)-protected vertices in unlabeled rooted plane trees
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- On long words avoiding Zimin patterns
- A functional limit theorem for the profile of search trees
- Bounds on Kronecker coefficients via contingency tables
- On moment sequences and mixed Poisson distributions
- A new bound on the acyclic edge chromatic number
- Cellular tree classifiers
- Exact solution of a two-type branching process: clone size distribution in cell division kinetics
- Triangles in random cubic planar graphs
- On correlation functions of vertex operator algebras associated to Jordan algebras
- Nature-inspired algorithms for real-world optimization problems
- Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach
- Permutations sortable by two stacks in parallel and quarter plane walks
- Random cubic planar graphs revisited
- Counting configurations of limit cycles and centers
- A generating tree approach to \(k\)-nonnesting partitions and permutations
- Profiles of ordered trees with mutation and associated Riordan matrices
- The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
- A simple model of trees for unicellular maps
- Is the five-flow conjecture almost false?
- Uniform random sampling of planar graphs in linear time
- Cubic surfaces and their invariants: some memories of Raymond Stora
- Algebraic change-point detection
- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
- Expectation values of twist fields and universal entanglement saturation of the free massive boson
- Graph classes with given 3-connected components: asymptotic counting and critical phenomena
- Limiting distributions for the number of inversions in labelled tree families
- ANALYTIC METHODS FOR SELECT SETS
- Analyticity of the planar limit of a matrix model
- Existence of absolutely continuous spectrum for Galton-Watson random trees
- Total progeny in killed branching random walk
- Lifshitz tails on the Bethe lattice: A combinatorial approach
- On urn models, non-commutativity and operator normal forms
- Effective bounds for P-recursive sequences
- Spectral gap of the Erlang A model in the Halfin-Whitt regime
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Monomial bases and pre-Lie structure for free Lie algebras
- The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- Analysis of the ``hiring above the median selection strategy for the hiring problem
- Asymptotic enumeration of extensional acyclic digraphs
- The impact of the \(NT\)-policy on the behaviour of a discrete-time queue with general service times
- On the degrees of polynomial divisors over finite fields
- The generating function of planar Eulerian orientations
- Revisiting the tail asymptotics of the double QBD process: refinement and complete solutions for the coordinate and diagonal directions
- Note on the smallest root of the independence polynomial
- Huge progeny production during the transient of a quasi-species model of viral infection, reproduction and mutation
- Families of prudent self-avoiding walks
- Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
- The poset on connected graphs is Sperner
- Convex hulls of random walks, hyperplane arrangements, and Weyl chambers
- Counting walks in a quadrant: a unified approach via boundary value problems
- Counting trees using symmetries
- Transient behavior of the Halfin-Whitt diffusion
- Random permutations with cycle weights
- Counting colored planar maps: algebraicity results
- Mahler measures, short walks and log-sine integrals
- A representation theorem for (\(q\)-)holonomic sequences
- Enumerative encoding of correlation-immune Boolean functions
- Asymptotic distribution of the zeros of the Ehrhart polynomial of the cross-polytope
- On the connected components of a random permutation graph with a given number of edges
- Operator-based approach for the construction of analytical soliton solutions to nonlinear fractional-order differential equations
- Asymptotic enumeration and limit laws for graphs of fixed genus
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- The number of absorbed individuals in branching Brownian motion with a barrier
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)
