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

Advances in Applied Mathematics

Volumn 30, Issue 1-2, 2003, Pages 126-136

  Klazar, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038066480     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00528-6     Document Type: Review

References (30)

1. D. Bar-Natan, On the Vassiliev knot invariants, Topology 34 (1995) 423-472.
2. http://www.ma.huji.ac.il/drorbn/.
3. D.J. Broadhurst, D. Kreimer, Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Padé-Borel resummation, Phys. Lett. B 475 (2000) 63-70.
4. R. Cori, M. Marcus, Counting non-isomorphic chord diagrams, Theoret. Comput. Sci. 204 (1998) 55-73.
5. G. Fischer, Plane Algebraic Curves, AMS, Providence, RI, 2001.
6. P. Flajolet, M. Noy, Analytic combinatorics of chord diagrams, in: D. Krob, A.A. Mikhalev, A.V. Mikhalev (Eds.), Formal Power Series and Algebraic Combinatorics, 12th International Conference, FPSAC'00, Moscow, Russia, June 2000, Proceedings, Springer-Verlag, Berlin, 2000, pp. 191-201.
7. I.M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A 53 (1990) 257-285.
8. E. Hille, Analytic Function Theory, Vol. I, Ginn, Boston, 1959.
9. W.N. Hsieh, Proportions of irreducible diagrams, Stud. Appl. Math. 52 (1973) 277-283.
10. M.E.H. Ismail, D. Stanton, G. Viennot, The combinatorics of q-Hermite polynomials and the Askey-Wilson integral, European J. Combin. 8 (1987) 379-392.
11. M. Klazar, Counting even and odd partitions, Amer. Math. Monthly, in press.
12. D.J. Kleitman, Proportions of irreducible diagrams, Stud. Appl. Math. 49 (1970) 297-299.
13. B. Li, H. Sun, Exact number of chord diagrams and estimation of the number of spine diagrams of order n, Chinese Sci. Bull. 42 (1997) 705-718.
14. A.I. Markushevich, Theory of Functions of a Complex Variable, Vol. II, Prentice Hall, Englewood Cliffs, NJ, 1965.
15. A. Nijenhuis, H.S. Wilf, The enumeration of connected graphs and linked diagrams, J. Combin. Theory Ser. A 27 (1979) 356-359.
16. J.-G. Penaud, Une preuve bijective d'une formule de Touchard Riordan, Discrete Math. 139 (1995) 347-360.
17. R.C. Read, The chord intersection problem, Ann. NY Acad. Sci. 319 (1979) 444-454.
18. J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp. 29 (1975) 215-222.
19. J.M. Ruiz, The Basic Theory of Power Series, Vieweg, Braunschweig/Wiesbaden, 1993.
20. J. Sawada, A fast algorithm for generating non-isomorphic chord diagrams, submitted.
21. R.P. Stanley, Differentiably finite power series, European J. Combin. 1 (1980) 175-188.
22. R.P. Stanley, Enumerative Combinatorics, Vol. II, Cambridge Univ. Press, Cambridge, UK, 1999.
23. P.R. Stein, On a class of linked diagrams. I. Enumeration, J. Combin. Theory Ser. A 24 (1978) 357-366.
24. P.R. Stein, J.A. Everett, On a class of linked diagrams. II. Asymptotics, Discrete Math. 21 (1978) 309-318.
25. A. Stoimenow, On enumeration of chord diagrams and asymptotics of Vassiliev invariants, PhD thesis, Freie Universität Berlin, Department of Mathematics and Computer Science, Berlin, 1998.
26. A. Stoimenow, Enumeration of chord diagrams and upper bound for Vassiliev invariants, J. Knot Theory Ramifications 7 (1998) 93-114.
27. A. Stoimenow, On the number of chord diagrams, Discrete Math. 218 (2000) 209-233.
28. J. Touchard, Sur un problème de configurations, C. R. Acad. Sci. Paris 230 (1950) 1997-1998.
29. J. Touchard, Contribution à l'étude du problème des timbres-poste, Canad. J. Math. 2 (1950) 385-398.
30. J. Touchard, Sur un problème de configurations et sur les fractions continues, Canad. J. Math. 4 (1952) 2-25.