nLab
chord diagram

This entry is about standard round chord diagrams. For linear chord diagrams or horizontal chord diagrams or Jacobi diagrams or Sullivan chord diagrams see there.


Contents

Idea

A chord diagram is a finite trivalent undirected graph with an embedded oriented circle and all vertices on that circle, regarded modulo cyclic identifications, if any.

A typical chord diagram looks like this:

graphics from Sati-Schreiber 19c

Chord diagrams are a basic object of study in combinatorics with remarkably many applications in mathematics and physics, notably in knot theory and Chern-Simons theory.

If also (trivalent) internal vertices are considered, one speaks of Jacobi diagrams.

Definitions

Chord diagrams can be defined both in topological terms, which formalize the graphical intuition, as well as in purely combinatorial terms. We present only the combinatorial definition here, starting from rooted chord diagrams and using those to define unrooted chord diagrams, rather than the other way around.

(For topological definitions of both unrooted and rooted chord diagrams, see for example Chapter 6 of Lando and Zvonkin, or Definition 1.5 of Bar-Natan 1995 for the unrooted case.)

A combinatorial definition

Rooted chord diagrams

If we would label the points of a chord diagram,

A B C F E D

then the chords can be seen as describing a matching (or equivalently, an involution) on the set of marked points which pairs (or equivalently, swaps) AA with CC, BB with DD, and EE with FF.

A subtle point is that a chord diagram can have non-trivial symmetries when considered up to this action of rotation. For that reason, in many situations it is useful to equip the circle with a distinguished basepoint (distinct from the marked points), the result being called a rooted chord diagram. Rooted chord diagrams may be conveniently visualized by “cutting open” the circle at the basepoint. For example, here we have rooted the chord diagram above at a basepoint lying on the interval AF, and opened up the circle:

A B C F E D

The marked points of a rooted chord diagram are intrinsically equipped with a linear order (A<B<C<D<E<FA \lt B \lt C \lt D \lt E \lt F) rather than a cyclic order.

Finally, it is also at times useful to consider chord diagrams with marked points which are not attached to any chord; if we think of the diagram as representing an involution, then this allows for the possibility of representing involutions with fixed points.

Definition

A rooted chord diagram of order nn is a surjective monotone function

D:[0,1]++[0,1]ntimes[0,2n1] D : \underset{n\,\text{times}}{\underbrace{[0,1] + \dots + [0,1]}} \twoheadrightarrow [0,2n-1]

from the nn-fold coproduct of the walking arrow (seen as a 2-element poset) into the linear order [0,2n1]={0<<2n1}[0,2n-1] = \{ 0 \lt \dots \lt 2n-1 \}. The symmetric group S nS_n acts freely on the domain [0,1]++[0,1][0,1] + \dots + [0,1] of a rooted chord diagram of order nn, and we consider two rooted chord diagrams to be isomorphic if they only differ by precomposition with such a permutation action.

Equivalently, a rooted chord diagram of order nn is a way of arranging the elements of [0,2n1][0,2n-1] into a collection of (necessarily mutually disjoint) ordered pairs (D 10,D 11),,(D n0,D n1)(D_{10}, D_{11}), \dots, (D_{n0},D_{n1}), where D i0<D i1D_{i0} \lt D_{i1} for each 1in1 \le i \le n.

Equivalently, a rooted chord diagram of order nn is a shuffle of nn distinct 2-letter words x¯x\bar x x, y¯y\bar y y, z¯z\bar z z, etc., considered up to alpha-conversion. Under this view, rooted chord diagrams are also sometimes referred to as double-occurrence words. (For example, the rooted chord diagram in the illustration above can be encoded as the double-occurrence word x¯y¯xyz¯z\bar x \bar y x y \bar z z.)

Unrooted chord diagrams

Intuitively, the cyclic group C 2nC_{2n} acts on rooted chord diagrams

D:[0,1]++[0,1]ntimes[0,2n1] D : \underset{n\,\text{times}}{\underbrace{[0,1] + \dots + [0,1]}} \twoheadrightarrow [0,2n-1]

by acting on the codomain [0,2n1][0,2n-1] via the map τ n=xx1(mod2n)\tau_n = x \mapsto x-1\,(\mod{2n}). This is not quite well-typed, however, since the composite function τ nD\tau_n \circ D is not quite order-preserving. It is easiest to define the action of C 2nC_{2n} in terms of the view of a rooted chord diagram DD as a collection of ordered pairs (D 10,D 11),,(D n0,D n1)(D_{10}, D_{11}), \dots, (D_{n0},D_{n1}). The action of τ n\tau_n is defined on each pair by

τ n(x,y)={(x1,y1) x>0 (y1,2n1) x=0 \tau_n(x,y) = \begin{cases}(x-1,y-1) & x\gt 0 \\ (y-1,2n-1) & x = 0 \end{cases}

and this extends to an action on rooted chord diagrams by acting independently on the pairs.

Definition

An unrooted chord diagram of order nn is a rooted chord diagram of order nn, considered up to the action of τ n\tau_n.

4T relation and weight systems

Often one is interested in chord diagrams only modulo the 4T relation:

For RR \in CRing a commutative ring, let R𝒟 cR\langle \mathcal{D}^c \rangle denote the RR-linear span of the set 𝒟 c\mathcal{D}^c of chord diagrams.

Then one traditionally writes

(1)𝒜 cR𝒟 c/4T \mathcal{A}^c \;\coloneqq\; R\langle \mathcal{D}^c \rangle/4T

for the quotient spaces of the linear span of chord diagrams by the 4T relations:

Hence:

graphics from Sati-Schreiber 19c

A linear function

w:𝒜 cR, w \;\colon\; \mathcal{A}^c \longrightarrow R \,,

– hence a plain RR-valued function on the set 𝒟 c\mathcal{D}^c of chord diagrams which is invariant under the 4T relation

is called a framed weight system. See there for more.

Trace from horizontal chord diagrams

Given a horizontal chord diagram on nn strands and given any choice of cyclic permutation of nn elements, the trace of horizontal to round chord diagrams is the round chord diagram obtained by gluing the ends of the strands according to the cyclic permutation, and retaining the chords in the evident way.

The following graphics shows basic examples of the trace operation for cyclic permutation of strands one step to the right:

graphics from Sati-Schreiber 19c

This defines a function

tr:𝒞 pb𝒞 c tr \;\colon\; \mathcal{C}^{pb} \longrightarrow \mathcal{C}^c

from the set of horizontal chord diagrams to the set of round chord diagrams.

Properties

Representation as involutions

Every rooted chord diagram

D:[0,1]++[0,1]ntimes[0,2n1] D : \underset{n\,\text{times}}{\underbrace{[0,1] + \dots + [0,1]}} \twoheadrightarrow [0,2n-1]

uniquely determines a fixed point free involution

i D:{0,,2n1}{0,,2n1} i_D : \{0,\dots,2n-1\} \to \{0,\dots,2n-1\}

swapping the elements of each chord,

i D(x)={y (x,y)D y (y,x)D i_D(x) = \begin{cases}y & (x,y) \in D \\ y & (y,x) \in D\end{cases}

and conversely, any such involution uniquely determines a rooted chord diagram up to isomorphism. In particular, there are a double-factorial number

(2n1)!!=(2n1)(2n3)1 (2n-1)!! = (2n-1)(2n-3)\cdots 1

of distinct isomorphism classes of rooted chord diagrams of order nn.

Symmetries

Every rooted chord diagram uniquely determines a chord diagram simply by forgetting the basepoint. Conversely, an unrooted chord diagram of order nn can be rooted in up to 2n2n different ways (corresponding to the 2n2n intervals between the marked points), but might also have fewer rootings in the case of symmetries.

Relation to Jacobi diagrams

chord diagrams modulo 4T are Jacobi diagrams modulo STU:

graphics from Sati-Schreiber 19c

Gauss diagrams of ordinary (virtual) knots

Any knot diagram can be represented faithfully by a certain kind of chord diagram with some extra structure, known as a Gauss diagram (Polyak and Viro 1994).

Recall that classically, a knot is defined as an embedding of the circle S 1S^1 into 3\mathbb{R}^3, which can be represented two-dimensionally by projecting onto the plane 2\mathbb{R}^2 and marking each double point as either an over-crossing or an under-crossing. One obtains a chord diagram from this knot diagram by considering the original immersing circle and connecting the preimages of each double point by a chord. Then, information about crossings can be represented by orienting the chords from over-crossing to under-crossing, while information about the local writhe of each crossing (in the case of a framed knot) may be encoded by assigning each chord an additional positive or negative sign. Finally, fixing a base point on the original knot gives rise to a Gauss diagram whose underlying chord diagram is naturally rooted.

Once again, this geometric object can be abstracted into a purely combinatorial one, called the Gauss code of the knot (diagram). To construct the Gauss code, begin by assigning arbitrary labels to the crossings, then run the length of the knot (starting at some arbitrary base point) and output the name of each crossing as you visit it, together with a bit (or two bits in the case of a framed knot) specifying whether you are at an over-crossing or an under-crossing (of positive or negative writhe). The underlying (rooted) chord diagram of the knot is thus encoded as a double-occurrence word.

Polyak and Viro called these “Gauss diagrams” after Carl Gauss, who apparently studied the question of which chord diagrams arise from immersions of circles (see the chapter titled “Gauss is back: curves in the plane” of Ghys’s A singular mathematical promenade). This question also played a foundational role in virtual knot theory — indeed, according to Kauffman (1999), the “fundamental combinatorial motivation” for the definition of virtual knots was the idea that it should be possible to interpret an arbitrary Gauss diagram as encoding a knot, now no longer seen as an embedding of S 1S^1 into 3\mathbb{R}^3, but into a thickened surface of arbitrary genus.

Chord diagrams of singular knots

By an analogous mechanism, any singular knot KK with nn simple double points (i.e., points where the knot intersects itself transversally) gives rise to a chord diagram c(K)c(K) with nn chords, by connecting the preimages of these double points. This chord diagram c(K)c(K) of course does not faithfully represent the original knot KK (e.g., it does not include any information about over-crossings and under-crossings). However, such chord diagrams nonetheless play an important role in the theory of Vassiliev invariants, by the theorem that the value of a Vassiliev invariant vv of degree n\le n on any singular knot KK with nn simple double points depends only on the chord diagram c(K)c(K).

chord diagramsweight systems
linear chord diagrams,
round chord diagrams
Jacobi diagrams,
Sullivan chord diagrams
Lie algebra weight systems,
stringy weight system,
Rozansky-Witten weight systems


knotsbraids
chord diagram,
Jacobi diagram
horizontal chord diagram
1T&4T relation2T&4T relation/
infinitesimal braid relations
weight systemhorizontal weight system
Vassiliev knot invariantVassiliev braid invariant
weight systems are associated graded of Vassiliev invariantshorizontal weight systems are cohomology of loop space of configuration space

References

General

Original articles:

Textbook accounts:

Lecture notes:

For chord diagrams and arc diagrams from the perspective of combinatorics, see:

  • Jacques Touchard, Sur un problème de configurations et sur les fractions continues Canadian Journal of Mathematics 4 (1952), 2-25. (doi)

  • Philippe Flajolet and Marc Noy, Analytic combinatorics of chord diagrams, INRIA technical report 3914, March 2000. (pdf)

  • A. Khruzin, Enumeration of chord diagrams arXiv:math/0008209, August 2000. (arxiv)

For the relationship to Gauss diagrams in classical and virtual knot theory, see:

  • Michael Polyak and Oleg Viro, Gauss diagram formulas for Vassiliev invariants, International Mathematics Research Notes 1994:11. pdf

  • Louis Kauffman, Virtual Knot Theory, European Journal of Combinatorics (1999) 20, 663-691. pdf

  • Oleg Viro, Virtual Links, Orientations of Chord Diagrams and Khovanov Homology, Proceedings of 12th Gökova Geometry-Topology Conference, pp. 184–209, 2005. pdf

  • Gauss codes at the Knot Atlas.

For the connection to Vassiliev invariants of singular knots, see:

The following book contains an extensive discussion of chord diagrams associated to singular points of analytic curves:

On Vassiliev invariants of braids via chord diagrams:

Relation to spherical curves?:

Weight systems on chord diagrams in Physics

We discuss occurrences of weight systems on chord diagrams/Jacobi diagrams in physics, specifically as correlators/Feynman amplitudes/quantum observables.

  1. In Chern-Simons theory

  2. For single trace operators in AdS/CFT-duality

    1. In AdS2/CFT1, JT-gravity/SYK-model

    2. In Dp-D(p+2) brane intersections

In Chern-Simons theory

Since weight systems are the associated graded of Vassiliev invariants, and since Vassiliev invariants are knot invariants arising as certain correlators/Feynman amplitudes of Chern-Simons theory in the presence of Wilson lines, there is a close relation between weight systems and quantum Chern-Simons theory.

Historically this is the original application of chord diagrams/Jacobi diagrams and their weight systems, see also at graph complex and Kontsevich integral.

Reviewed in:

Applied to Gopakumar-Vafa duality:

  • Dave Auckly, Sergiy Koshkin, Introduction to the Gopakumar-Vafa Large NN Duality, Geom. Topol. Monogr. 8 (2006) 195-456 (arXiv:0701568)

See also

For single trace operators in AdS/CFT duality

Interpretation of Lie algebra weight systems on chord diagrams as certain single trace operators, in particular in application to black hole thermodynamics

In AdS 2/CFT 1AdS_2/CFT_1, JT-gravity/SYK-model

Discussion of (Lie algebra-)weight systems on chord diagrams as SYK model single trace operators:

  • Antonio M. García-García, Yiyang Jia, Jacobus J. M. Verbaarschot, Exact moments of the Sachdev-Ye-Kitaev model up to order 1/N 21/N^2, JHEP 04 (2018) 146 (arXiv:1801.02696)

  • Yiyang Jia, Jacobus J. M. Verbaarschot, Section 4 of: Large NN expansion of the moments and free energy of Sachdev-Ye-Kitaev model, and the enumeration of intersection graphs, JHEP 11 (2018) 031 (arXiv:1806.03271)

  • Micha Berkooz, Prithvi Narayan, Joan Simón, Chord diagrams, exact correlators in spin glasses and black hole bulk reconstruction, JHEP 08 (2018) 192 (arxiv:1806.04380)

following:

  • László Erdős, Dominik Schröder, Phase Transition in the Density of States of Quantum Spin Glasses, D. Math Phys Anal Geom (2014) 17: 9164 (arXiv:1407.1552)

which in turn follows

  • Philippe Flajolet, Marc Noy, Analytic Combinatorics of Chord Diagrams, pages 191–201 in Daniel Krob, Alexander A. Mikhalev,and Alexander V. Mikhalev, (eds.), Formal Power Series and Algebraic Combinatorics, Springer 2000 (doi:10.1007/978-3-662-04166-6_17)

With emphasis on the holographic content:

  • Micha Berkooz, Mikhail Isachenkov, Vladimir Narovlansky, Genis Torrents, Section 5 of: Towards a full solution of the large NN double-scaled SYK model, JHEP 03 (2019) 079 (arxiv:1811.02584)

  • Vladimir Narovlansky, Slide 23 (of 28) of: Towards a Solution of Large NN Double-Scaled SYK, 2019 (pdf)

and specifically in relation, under AdS2/CFT1, to Jackiw-Teitelboim gravity:

In Dpp/D(p+2)(p+2)-brane intersections

Discussion of weight systems on chord diagrams as single trace observables for the non-abelian DBI action on the fuzzy funnel/fuzzy sphere non-commutative geometry of Dp-D(p+2)-brane intersections (hence Yang-Mills monopoles):

graphics from Sati-Schreiber 19c

Last revised on April 29, 2020 at 02:40:31. See the history of this page for a list of all contributions to it.