Analytic combinatorics of non-crossing configurations
From MaRDI portal
(Redirected from Publication:1300975)
Recommendations
Cites work
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 4165039 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3655943 (Why is no real title available?)
- scientific article; zbMATH DE number 45266 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 3508512 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- scientific article; zbMATH DE number 3358536 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- Asymptotics for coefficients of algebraic functions
- Catalan, Motzkin, and Riordan numbers
- Central and local limit theorems applied to asymptotic enumeration
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Chords, trees and permutations
- Closed forms for the number of polygon dissections
- Combinatorial extreme value distributions
- Enumeration of ladder graphs
- Enumeration of noncrossing trees on a circle
- GFUN
- Hipparchus, Plutarch, Schroder, and Hough
- On the Altitude of Nodes in Random Trees
- Properties of random triangulations and trees
- Remarks on an asymptotic method in combinatorics
- Singularity Analysis of Generating Functions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- THE ENUMERATION OF A FAMILY OF LADDER GRAPHS PART II: SCHRODER AND SUPERCONNECTIVE RELATIONS
Cited in
(84)- Counting plane graphs: cross-graph charging schemes
- Formulae and asymptotics for coefficients of algebraic functions
- Analytic combinatorics of chord and hyperchord diagrams with k crossings
- Counting plane graphs with exponential speed-up
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- The CRT is the scaling limit of random dissections
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
- On planar path transformation
- On properties of random dissections and triangulations
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
- Bijections for a class of labeled plane trees
- Consecutive pattern avoidances in non-crossing trees
- Linear \(k\)-chord diagrams
- Counting polygon dissections in the projective plane
- A finite difference approach to counting quadrangles in a circle
- Symbolic dynamical scales: modes, orbitals, and transversals
- Analytic solution of Hedin’s equations in zero dimensions
- Configurations of non-crossing rays and related problems
- Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees.
- Noncrossing trees are almost conditioned Galton–Watson trees
- Combalgebraic structures on decorated cliques
- Dyck paths with coloured ascents
- Partitions of unity in \(\mathrm{SL}(2,\mathbb Z)\), negative continued fractions, and dissections of polygons
- Noncrossing partitions, noncrossing graphs, and q-permanental equations
- Ennea-algebras
- Non-crossing tree realizations of ordered degree sequences
- 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
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Enumeration of \(k\)-noncrossing trees and forests
- A new lower bound on the maximum number of plane graphs using production matrices
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Locally oriented noncrossing trees
- Number of crossing-free geometric graphs vs. Triangulations
- scientific article; zbMATH DE number 6683516 (Why is no real title available?)
- 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
- Lower bounds on the maximum number of non-crossing acyclic graphs
- Enumeration of bipartite non-crossing geometric graphs
- New production matrices for geometric graphs
- Enumeration and limit laws for series-parallel graphs
- Quadri-algebras
- Counting triangulations and other crossing-free structures via onion layers
- Enveloping operads and bicolored noncrossing configurations
- New results on production matrices for geometric graphs
- Congruences for Catalan and Motzkin numbers and related sequences
- A decomposition algorithm for noncrossing trees
- On the number of labeled outerplanar \(k\)-cycle blocks
- Consecutive patterns in permutations
- scientific article; zbMATH DE number 7232750 (Why is no real title available?)
- Operads of decorated cliques. I: Construction and quotients
- Counting polygon triangulations is hard
- Vertices of given degree in series-parallel graphs
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- Decomposition and merging algorithms for noncrossing forests
- On the number of plane geometric graphs
- Enumerating a class of lattice paths
- Enumerating combinatorial classes of the complex polynomial vector fields in \(\mathbb C\)
- 2-binary trees: bijections and related issues
- 2-noncrossing trees and 5-ary trees
- A refinement of leaves on noncrossing trees
- Combinatorics of the categories of noncrossing partitions
- Fast enumeration algorithms for non-crossing geometric graphs
- scientific article; zbMATH DE number 2232270 (Why is no real title available?)
- On the number of crossing-free partitions
- Characteristic polynomials of production matrices for geometric graphs
- Classes of graphs embeddable in order-dependent surfaces
- On the Congruences of Some Combinatorial Numbers
- scientific article; zbMATH DE number 1504631 (Why is no real title available?)
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Random stable laminations of the disk
- 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
- Flips in planar graphs
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Identities for non-crossing graphs and multigraphs
- Generating all patterns of graph partitions within a disparity bound
- Counting quiddities of polygon dissections
- Extremal statistics on non-crossing configurations
- Counting triangulations and other crossing-free structures approximately
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)
