On the number of chord diagrams (Q1978157)

From MaRDI portal
Revision as of 08:56, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the number of chord diagrams
scientific article

    Statements

    On the number of chord diagrams (English)
    0 references
    23 January 2001
    0 references
    A chord diagram is an oriented circle with finitely many chords. One obtains a linearized chord diagram by cutting somewhere along the oriented circle and transforming the cut circle into a straight oriented line. This changes the chords into arcs whose endpoints are on the oriented line. A chord diagram or linearized chord diagram is degenerate if it has a chord that does not cross any other chord. A chord diagram is connected if the graph of chords remaining after removing the oriented circle (or line) remains connected. Using combinatorial methods the above defined chord diagrams and other various kinds of chord diagrams are counted depending on the number of chords. One of the reasons that chord diagrams are of mathematical interest is that they are basic objects in the theory of Vassiliev invariants for knots.
    0 references
    0 references
    Vassiliev invariants
    0 references

    Identifiers