Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings

DOI10.1016/S0196-8858(02)00528-6MaRDI QIDQ1398290zbMATH OpenFDO

Authors Martin Klazar

Publication date 29 July 2003

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-8858(02)00528-6

zbMATH Keywords

crossing graphgenerating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Recommendations

• Noncrossing matchings with fixed points
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Analytic combinatorics of chord and hyperchord diagrams with k crossings
• Linear k-chord diagrams
• Crossings and nestings of matchings and partitions

Cites work

• A bijective proof of a Touchard-Riordan formula
• A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
• Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Padé-Borel resummation.
• Contribution a L'etude Du Probleme Des Timbres Poste
• Counting Even and Odd Partitions
• Counting non-isomorphic chord diagrams
• Differentiably finite power series
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Exact number of chord diagrams and an estimation of the number of spine diagrams of order \(n\)
• scientific article; zbMATH DE number 3143813 (Why is no real title available?)
• scientific article; zbMATH DE number 3752846 (Why is no real title available?)
• scientific article; zbMATH DE number 1226995 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1504583 (Why is no real title available?)
• scientific article; zbMATH DE number 3229764 (Why is no real title available?)
• scientific article; zbMATH DE number 3054984 (Why is no real title available?)
• On a class of linked diagrams. I: Enumeration
• On a class of linked diagrams. II: Asymptotics
• On the number of chord diagrams
• On the Vassiliev knot invariants
• Plane algebraic curves. Transl. from the German by Leslie Kay
• Proportions of Irreducible Diagrams
• Proportions of Irreducible Diagrams
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Symmetric functions and P-recursiveness
• The combinatorics of q-Hermite polynomials and the Askey-Wilson integral
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• The enumeration of connected graphs and linked diagrams

Cited in

(13)

• Bell numbers, their relatives, and algebraic differential equations
• Noncrossing monochromatic subtrees and staircases in 0-1 matrices
• Noncrossing normal ordering for functions of boson operators
• Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
• Four-regular graphs with rigid vertices associated to DNA recombination
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Annular non-crossing matchings
• The anisotropic generating function of self-avoiding polygons is not D-finite
• Analytic combinatorics of chord and hyperchord diagrams with k crossings
• Partitions and partial matchings avoiding neighbor patterns
• Symbol Separation in Double Occurrence Words
• The normal distribution is \(\boxplus\)-infinitely divisible
• Non-perturbative completion of Hopf-algebraic Dyson-Schwinger equations

This page was built for publication: Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings

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