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.
- Counting non-isomorphic chord diagrams
- Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
- A few weight systems arising from intersection graphs
- Mapping class group orbits of curves with self-intersections
- Bell numbers, their relatives, and algebraic differential equations
- Functions with isolated critical points on the boundary of a nonoriented surface
- Connected chord diagrams and bridgeless maps
- Topology of functions with isolated critical points on the boundary of a 2-dimensional manifold
- Linear chord diagrams with long chords
- Counting unlabelled chord diagrams of maximal genus
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
- Analytic solution of Hedin’s equations in zero dimensions
- Handshakes across a (round) table
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- scientific article; zbMATH DE number 1504583 (Why is no real title available?)
- A chord graph constructed from a ribbon surface-link
- Matrices and diagrams of cords on a punctured plane
- A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
- Linear k-chord diagrams
- On the number of Rumer diagrams
- scientific article; zbMATH DE number 7177983 (Why is no real title available?)
- 2-color chord N-diagrams with one black cycle
- Genus ranges of chord diagrams
- Enumeration of chord diagrams via topological recursion and quantum curve technique
- The expansion of a chord diagram and the Tutte polynomial
- The expansion of a chord diagram and the Tutte polynomial
- Counting Bubbles in Linear Chord Diagrams
- Real eternal PDE solutions are not complex entire: a quadratic parabolic example
- Real-time blow-up and connection graphs of rational vector fields on the Riemann sphere
- Scalar polynomial vector fields in real and complex time
This page was built for publication: On the number of chord diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978157)
