Analytic combinatorics of non-crossing configurations

DOI10.1016/S0012-365X(98)00372-0zbMATH Open0939.05005OpenAlexW2152141013MaRDI QIDQ1300975FDOQ1300975

Authors: Philippe Flajolet, Marc Noy 

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

Recommendations

• scientific article; zbMATH DE number 2232270
• Publication:4502588
• scientific article; zbMATH DE number 1789915
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings

zbMATH Keywords

partitionsgraphstreesenumerationgenerating functionsforestssingularity analysisanalytic combinatoricsdissectionssymbolic methodssingularity perturbation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (84)

• The CRT is the scaling limit of random dissections
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• On planar path transformation
• On properties of random dissections and triangulations
• Bijections for a class of labeled plane trees
• Consecutive pattern avoidances in non-crossing trees
• Counting polygon dissections in the projective plane
• Analytic solution of Hedin’s equations in zero dimensions
• Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees.
• Noncrossing trees are almost conditioned Galton–Watson trees
• Configurations of non-crossing rays and related problems
• Combalgebraic structures on decorated cliques
• Partitions of unity in \(\mathrm{SL}(2,\mathbb Z)\), negative continued fractions, and dissections of polygons
• Dyck paths with coloured ascents
• Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations
• Ennea-algebras
• Extremal statistics on non-crossing configurations
• On collinear sets in straight-line drawings
• Extremal problems for ordered hypergraphs: small patterns and some enumeration
• Dissecting the circle, at random
• Enumeration of \(k\)-noncrossing trees and forests
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Number of crossing-free geometric graphs vs. Triangulations
• Title not available (Why is that?)
• Locally oriented noncrossing trees
• Lower bounds on the maximum number of non-crossing acyclic graphs
• Enumeration of bipartite non-crossing geometric graphs
• Enumeration and limit laws for series-parallel graphs
• Enveloping operads and bicolored noncrossing configurations
• Quadri-algebras
• Counting triangulations and other crossing-free structures via onion layers
• Congruences for Catalan and Motzkin numbers and related sequences
• New results on production matrices for geometric graphs
• A decomposition algorithm for noncrossing trees
• On the number of labeled outerplanar \(k\)-cycle blocks
• Consecutive patterns in permutations
• Vertices of given degree in series-parallel graphs
• On the number of plane geometric graphs
• Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
• Enumerating combinatorial classes of the complex polynomial vector fields in \(\mathbb C\)
• Enumerating a class of lattice paths
• Fast enumeration algorithms for non-crossing geometric graphs
• 2-binary trees: bijections and related issues
• A refinement of leaves on noncrossing trees
• Combinatorics of the categories of noncrossing partitions
• Title not available (Why is that?)
• 2-noncrossing trees and 5-ary trees
• Characteristic polynomials of production matrices for geometric graphs
• On the number of crossing-free partitions
• On the Congruences of Some Combinatorial Numbers
• Title not available (Why is that?)
• A QPTAS for the base of the number of crossing-free structures on a planar point set
• Random stable laminations of the disk
• Gray codes for non-crossing partitions and dissections of a convex polygon
• Production matrices for geometric graphs
• Enumeration and limit laws of dissections on a cylinder
• Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
• Extremal statistics on non-crossing configurations
• Flips in planar graphs
• Identities for non-crossing graphs and multigraphs
• Counting plane graphs: cross-graph charging schemes
• Counting triangulations and other crossing-free structures approximately
• Formulae and asymptotics for coefficients of algebraic functions
• Title not available (Why is that?)
• Counting plane graphs with exponential speed-up
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
• Linear \(k\)-chord diagrams
• A finite difference approach to counting quadrangles in a circle
• Symbolic dynamical scales: modes, orbitals, and transversals
• Non-crossing tree realizations of ordered degree sequences
• A new lower bound on the maximum number of plane graphs using production matrices
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
• New production matrices for geometric graphs
• Title not available (Why is that?)
• Operads of decorated cliques. I: Construction and quotients
• Counting polygon triangulations is hard
• Decomposition and merging algorithms for noncrossing forests
• Classes of graphs embeddable in order-dependent surfaces
• Counting quiddities of polygon dissections
• Generating all patterns of graph partitions within a disparity bound
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

Uses Software

• gfun
• OEIS

This page was built for publication: Analytic combinatorics of non-crossing configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300975)