Abstract
The main results are as follows:
-
(I)
For the number of chord diagram of ordern, an exact formula is given.
-
(II)
For the number of spine diagrams of ordern, the upper and lower bounds are obtained. These bounds show that the estimation is asymptotically the best.
As a byproduct, an upper bound is obtained, for the dimension of Vassiliev knot invariants of ordern, that is, 1/2(n − 1)! for anyn≥3, and 1/2 (n−1)! −1/2 (n−2)! for biggern. Our upper bound is based on the work of Chmutov and Duzhin and is an improvement of their bound (n − 1)!. Forn = 3, and 4, 1/2(n − 1)! is already the best.
Similar content being viewed by others
References
Arnold, V. I., Vassiliev’s theory of discriminants and knots,Plenary Lecture at the First European Congress of Mathematics. Paris, July, 1992.
Birman, J., Lin, X. S.. Knot polynomials and Vassiliev invariants,Invent. Math., 1993, 111: 225.
Rar-Natan, D., On the Vassiliev knot invariants.Topology. 1995, 34: 423.
Kontsevich, M., Vassiliev’s knot invariants,Adv. in Sov. Math., 1993, 16: 137.
Chmutov, S. V., Duzhin, S. V., An upper bound for the number of Vassiliev knot invariants,J. Knot Th. Ramif., 1994. 3: 141.
Przytycki. J. H.,Vassiliev Gusarov Skein Modules of 3-Manifolds and Criteria for Knot’s Periodicity. Preprint, Dec. 1992.
Author information
Authors and Affiliations
Additional information
The first version of this paper was the preprint titled “The exact number of chord diagrams and an upper bound of Vassiliev knot invariants of ordern”, which was typed in January 1996. and included in the “Bibliography of Vassiliev Invariants” with last updated: Mon Jun 24 09:41:28 IDT 1996. edited by Bar-Natan.
About this article
Cite this article
Li, B., Sun, H. Exact number of chord diagrams and an estimation of the number of spine diagrams of ordern . Chin.Sci.Bull. 42, 705–718 (1997). https://doi.org/10.1007/BF03186960
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03186960