On the combinatorial structure of primitive Vassiliev invariants. III: A lower bound (Q2707944)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    On the combinatorial structure of primitive Vassiliev invariants. III: A lower bound
    scientific article

      Statements

      0 references
      4 April 2001
      0 references
      partition
      0 references
      unitrivalent graph
      0 references
      On the combinatorial structure of primitive Vassiliev invariants. III: A lower bound (English)
      0 references
      This paper gives the so far best lower asymptotical bound for the dimension of the space of primitive Vassiliev invariants of given degree. The idea, as in previous papers [\textit{S. Chmutov} and \textit{S. Duzhin}, Topology Appl. 92, No. 3, 201-223 (1999; Zbl 0934.57006)], is to consider a combinatorially defined class of diagrams and then to show that the polynomials in \(N\) induced on them by the weight systems of the HOMFLY polynomial, coming from the Lie algebras \(\text{sl}_N\), are linearly independent. In fact, the diagrams considered here (roughly) correspond to partitions of their degree. Thus the estimate obtained is \(e^{(\sqrt{2/3}\pi- \varepsilon)\sqrt n}\) in degree \(n\) for any \(\varepsilon> 0\). It follows from the classical formula of the number of partitions due to Hardy and Ramanujan. The paper concludes with some remarks and a conjecture about the relation between numbers of specific partitions and the dimension of the subspaces of the diagram algebra \({\mathcal B}\) of [\textit{Dror Bar-Natan}, Topology 34, No. 2, 423-472 (1995; Zbl 0898.57001)] with a given number of univalent vertices.
      0 references

      Identifiers