Analytic combinatorics of non-crossing configurations

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

Publication date: 29 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00372-0

zbMATH Keywords

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

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Enumeration in graph theory (05C30)

Related Items

Classes of graphs embeddable in order-dependent surfaces, Configurations of non-crossing rays and related problems, Noncrossing trees are almost conditioned Galton–Watson trees, Quadri-algebras, Extremal problems for ordered hypergraphs: small patterns and some enumeration, A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set, On the number of plane geometric graphs, Dissecting the circle, at random, Unnamed Item, Enumeration of bipartite non-crossing geometric graphs, On planar path transformation, Number of Crossing-Free Geometric Graphs vs. Triangulations, Extensions of the linear bound in the Füredi-Hajnal conjecture, The CRT is the scaling limit of random dissections, Random non-crossing plane configurations: A conditioned Galton-Watson tree approach, On the number of crossing-free partitions, New production matrices for geometric graphs, Consecutive pattern avoidances in non-crossing trees, Locally oriented noncrossing trees, Analytic combinatorics of chord and hyperchord diagrams with $k$ crossings, A decomposition algorithm for noncrossing trees, Characteristic polynomials of production matrices for geometric graphs, Consecutive patterns in permutations, Noncrossing partitions, noncrossing graphs, and $q$-permanental equations, A refinement of leaves on noncrossing trees, Counting quiddities of polygon dissections, A QPTAS for the base of the number of crossing-free structures on a planar point set, Non-crossing Tree Realizations of Ordered Degree Sequences, Exceptional sequences over path algebras of type $A_n$ and non-crossing spanning trees., Enumerating a class of lattice paths, Formulae and Asymptotics for Coefficients of Algebraic Functions, From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices, On the Congruences of Some Combinatorial Numbers, Analytic solution of Hedin’s equations in zero dimensions, Unnamed Item, Generating All Patterns of Graph Partitions Within a Disparity Bound, Random stable laminations of the disk, Counting Plane Graphs: Cross-Graph Charging Schemes, Dyck paths with coloured ascents, Symbolic dynamical scales: modes, orbitals, and transversals, On properties of random dissections and triangulations, Extremal statistics on non-crossing configurations, Counting polygon triangulations is hard, Counting Plane Graphs with Exponential Speed-Up, Enumeration and limit laws for series-parallel graphs, Fast enumeration algorithms for non-crossing geometric graphs, On the number of labeled outerplanar $k$-cycle blocks, Combalgebraic structures on decorated cliques, Combinatorics of the categories of noncrossing partitions, Flips in planar graphs, 2-binary trees: bijections and related issues, Production matrices for geometric graphs, Counting polygon dissections in the projective plane, Bijections for a class of labeled plane trees, Enumerating combinatorial classes of the complex polynomial vector fields in ℂ, Congruences for Catalan and Motzkin numbers and related sequences, Ennea-algebras, Enumeration and limit laws of dissections on a cylinder, Unnamed Item, Vertices of given degree in series-parallel graphs, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, New results on production matrices for geometric graphs, Identities for non-crossing graphs and multigraphs, Linear $k$-Chord Diagrams, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs, Transition operations over plane trees, Operads of decorated cliques. I: Construction and quotients, Decomposition and merging algorithms for noncrossing forests, Gray codes for non-crossing partitions and dissections of a convex polygon, On Collinear Sets in Straight-Line Drawings, Partitions of unity in $\mathrm{SL}(2,\mathbb Z)$, negative continued fractions, and dissections of polygons, Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees, 2-noncrossing trees and 5-ary trees, A new lower bound on the maximum number of plane graphs using production matrices, Enveloping Operads and Bicolored Noncrossing Configurations, Counting triangulations and other crossing-free structures approximately, Lower bounds on the maximum number of non-crossing acyclic graphs, Counting triangulations and other crossing-free structures via onion layers

Uses Software

Cites Work