Analytic combinatorics of non-crossing configurations

DOI10.1016/S0012-365X(98)00372-0zbMath0939.05005MaRDI QIDQ1300975

Marc Noy, Philippe Flajolet

Publication date: 29 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitions; generating functions; enumeration; graphs; trees; singularity analysis; analytic combinatorics; forests; dissections; symbolic methods; singularity perturbation

Mathematics Subject Classification ID

05C05: Trees

05A15: Exact enumeration problems, generating functions

05A18: Partitions of sets

05C30: Enumeration in graph theory

Related Items

Noncrossing trees are almost conditioned Galton–Watson trees, Fast enumeration algorithms for non-crossing geometric graphs, Consecutive pattern avoidances in non-crossing trees, Ennea-algebras, Enumeration and limit laws of dissections on a cylinder, Dyck paths with coloured ascents, Flips in planar graphs, Counting polygon dissections in the projective plane, Bijections for a class of labeled plane trees, Identities for non-crossing graphs and multigraphs, Gray codes for non-crossing partitions and dissections of a convex polygon, 2-noncrossing trees and 5-ary trees, Consecutive patterns in permutations, Enumerating a class of lattice paths, Quadri-algebras, Extremal problems for ordered hypergraphs: small patterns and some enumeration, On the number of plane geometric graphs, On planar path transformation, Enumeration and limit laws for series-parallel graphs, 2-binary trees: bijections and related issues, Congruences for Catalan and Motzkin numbers and related sequences, Extensions of the linear bound in the Füredi-Hajnal conjecture, Counting Plane Graphs with Exponential Speed-Up, Vertices of given degree in series-parallel graphs, On the Congruences of Some Combinatorial Numbers, Analytic solution of Hedin’s equations in zero dimensions

Uses Software

• gfun
• OEIS

Cites Work

• Chords, trees and permutations
• Asymptotics for coefficients of algebraic functions
• Remarks on an asymptotic method in combinatorics
• Properties of random triangulations and trees
• Catalan, Motzkin, and Riordan numbers
• Enumeration of noncrossing trees on a circle
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Enumeration of ladder graphs
• Closed forms for the number of polygon dissections
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Central and local limit theorems applied to asymptotic enumeration
• Combinatorial extreme value distributions
• Singularity Analysis of Generating Functions
• THE ENUMERATION OF A FAMILY OF LADDER GRAPHS PART II: SCHRODER AND SUPERCONNECTIVE RELATIONS
• On the Altitude of Nodes in Random Trees
• Hipparchus, Plutarch, Schroder, and Hough
• GFUN
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item