Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
From MaRDI portal
Publication:1398290
DOI10.1016/S0196-8858(02)00528-6zbMath1030.05005MaRDI QIDQ1398290
Publication date: 29 July 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Related Items (9)
Bell numbers, their relatives, and algebraic differential equations ⋮ Non-perturbative completion of Hopf-algebraic Dyson-Schwinger equations ⋮ Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite ⋮ Partitions and partial matchings avoiding neighbor patterns ⋮ The normal distribution is \(\boxplus\)-infinitely divisible ⋮ Four-regular graphs with rigid vertices associated to DNA recombination ⋮ Noncrossing normal ordering for functions of boson operators ⋮ The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite ⋮ Symbol Separation in Double Occurrence Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric functions and P-recursiveness
- The combinatorics of q-Hermite polynomials and the Askey-Wilson integral
- The enumeration of connected graphs and linked diagrams
- Differentiably finite power series
- On a class of linked diagrams. I: Enumeration
- On a class of linked diagrams. II: Asymptotics
- Counting non-isomorphic chord diagrams
- Exact number of chord diagrams and an estimation of the number of spine diagrams of order \(n\)
- On the Vassiliev knot invariants
- A bijective proof of a Touchard-Riordan formula
- On the number of chord diagrams
- Proportions of Irreducible Diagrams
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Counting Even and Odd Partitions
- A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
- Proportions of Irreducible Diagrams
- Contribution a L'etude Du Probleme Des Timbres Poste
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Padé-Borel resummation.
This page was built for publication: Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings