🔢 mathematics

Double-scaled SYK from boundary metrics of planar maps

This paper demonstrates that for a specific family of bipartite planar maps with q-deformed face weights arising from the double-scaled SYK model, the weighted enumeration of maps with a fixed boundary metric depends solely on the crossing number of the associated geodesic chord diagram, thereby establishing an exact correspondence between the induced law of these diagrams and the chord diagram representation of the DSSYK model.

Original authors: Timothy Budd

Published 2026-07-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Timothy Budd

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant, tangled ball of string. Now, imagine that instead of just looking at the mess, you are trying to measure the distance between two specific points on the surface of that ball by walking along the string itself. This is the basic idea behind planar maps: they are networks of lines and dots drawn on a flat surface (like a map), and we want to understand the "geometry" of the space they create.

This paper, written by Timothy Budd, connects two very different ways of looking at this tangled string problem. On one side, we have Planar Maps (the string network). On the other side, we have Chord Diagrams (a simpler way to draw the same information using lines connecting points on a circle).

Here is the breakdown of the paper's discovery using simple analogies:

1. The Two Languages

The Planar Map (The City): Imagine a city drawn on a piece of paper. It has streets (edges) and intersections (vertices). The "boundary" is the outer edge of the city. You can measure the distance between any two points on the edge by walking along the streets. This is the "metric" or the map's geometry.
The Chord Diagram (The Dance Floor): Imagine a circle with people standing around the edge. Some people are holding hands with each other, forming lines (chords) across the circle. If two lines cross each other, that's a "crossing." This is a much simpler, 2D drawing.

The Big Question: Can we translate the complex walking distances in the "City" (Planar Map) directly into the simple "crossings" on the "Dance Floor" (Chord Diagram)? Usually, this is incredibly hard. The city might have streets that cross over each other in complicated ways, making the distance calculation a nightmare.

2. The Special "Magic" Recipe

The author found that for a very specific type of city (a special kind of planar map), the translation is surprisingly simple.

Think of the "Planar Map" as a recipe for baking a cake. Usually, the ingredients (weights) are messy and complicated. But the author looked at a specific recipe called the ETH Planar Map model (which comes from a physics theory called DSSYK).

In this specific recipe, the author discovered a "magic trick":

If you count how many times the lines cross in the Chord Diagram (let's call this number $k$ ), the total "weight" or value of the corresponding Planar Map is simply $q^k$ .
It doesn't matter how big the map is, or how many streets it has. It only depends on the number of crossings in the chord diagram.

The Analogy: Imagine you are grading a student's essay. Usually, you have to read every word, check the grammar, and count the paragraphs. But in this specific "magic" system, the grade is determined solely by how many times the student crossed out a word. If they crossed out a word 5 times, the grade is $q^5$ . If they crossed it out 0 times, the grade is $q^0$ (which is 1). The rest of the essay doesn't change the score.

3. The "Shortcut" Trick

How did the author prove this? They used a method called "peeling" or "shortcutting."

Imagine you have a large map. You cut off a piece of the edge.

The Hard Part: Usually, cutting a piece off changes the distances between the remaining points in a very complicated way.
The Discovery: In this specific "magic" model, cutting off a piece of the map corresponds to a very specific, clean operation on the Chord Diagram. It's like taking a chord diagram, adding a "shortcut" line, and seeing how the crossings change.

The author showed that if you do this operation over and over, the math works out perfectly. The complicated cancellations that usually happen in these calculations (where huge numbers add up to zero) happen automatically because of the special "magic" numbers in the recipe.

4. What This Means for Physics (Without the Jargon)

The paper connects this math to the Sachdev-Ye-Kitaev (SYK) model, which is a famous model in quantum physics used to study black holes and holography (the idea that a 3D universe can be described by a 2D surface).

The Connection: Physicists already knew that the total "score" (partition function) of the DSSYK model matched the total score of these special Planar Maps.
The New Insight: This paper goes deeper. It says: "It's not just the total score that matches. Every single detail matches."
- If you ask, "What is the distance between point A and point B on the map?" the answer is exactly the same as asking, "How many lines cross the path between A and B in the chord diagram?"
- This means the "geometry" of the quantum world (as described by DSSYK) is literally encoded in the "crossings" of these chord diagrams.

5. A Catchy Limitation

The paper also notes a small catch. The "magic recipe" uses numbers that sometimes flip between positive and negative (like $+1, -1, +1$ ).

In the world of pure math (formal series), this works perfectly.
But if you try to treat these as real-world probabilities (where you can't have a negative chance of something happening), it gets tricky. The math only works as a "real" probability if the parameter $q$ is very small. If $q$ gets too big (close to 1), the numbers start to blow up, and the "probability" interpretation breaks down.

Summary

Timothy Budd proved that for a specific, highly tuned model of random maps, the complex geometry of the map is perfectly mirrored by the simple crossing number of a chord diagram.

Complex Map Geometry $\leftrightarrow$ Simple Chord Crossings.
Distance on the Map $\leftrightarrow$ Number of lines crossed.

This provides a precise dictionary between a messy, random geometric world and a clean, combinatorial one, offering a new way to understand the "holographic" nature of quantum gravity models like DSSYK.

Technical Summary: Double-scaled SYK from boundary metrics of planar maps

Problem Statement
The enumeration of planar maps with control over their boundary metric—the pseudometric induced on the outer face by the bulk graph distance—is generally a difficult combinatorial problem. While exact results exist for specific distance statistics (e.g., geodesic 2-point or 3-point functions) on the sphere or disk, controlling distances between all pairs of boundary vertices simultaneously is typically intractable, especially when the realizing geodesics intersect. This difficulty is compounded in models where face weights are complex or alternating in sign.

This work addresses this problem within the specific context of the double-scaled Sachdev-Ye-Kitaev (DSSYK) model. DSSYK admits a combinatorial formulation via chord diagrams with a parameter $q \ge 0$ , interpreted as a Boltzmann weight for chord crossings. It is known that the DSSYK partition function matches the large- $N$ limit of a specific Hermitian 1-matrix model (the ETH 1-matrix model), which enumerates a special family of bipartite planar maps (ETH planar maps) with $q$ -deformed face weights. The central question is whether the correspondence between DSSYK and these planar maps extends beyond the partition function to the level of detailed metric statistics, specifically relating the crossing number of chord diagrams to the graph distances between boundary vertices in the maps.

Methodology
The paper employs a combination of combinatorial bijections, recursive enumeration techniques, and orthogonal polynomial theory.

Geodesic Chord Diagrams: The authors define a mapping $\text{Geod}(\mathfrak{m})$ from a bipartite planar map $\mathfrak{m}$ to a chord diagram $\chi$ . This is achieved by analyzing the Voronoi diagram of the corners on the outer face of $\mathfrak{m}$ with respect to the graph distance. The resulting chord diagram $\chi$ encodes the boundary pseudometric $d_\mathfrak{m}$ such that $d_\mathfrak{m} = d_\chi$ , where $d_\chi(a,b)$ is the number of chords crossing the interval between $a$ and $b$ .
Shortcutting Operations: To relate maps of different perimeters, the authors introduce a "shortcutting" operation on chord diagrams, denoted $\text{Short}_{n,p}$ . This operation corresponds to adding an edge across the outer face of a planar map, which acts as a shortcut for the boundary metric. The paper classifies all chord diagrams $\chi'$ that map to a specific $\chi$ under this operation.
Refined Tutte Equations: The enumeration of the planar maps is governed by Tutte equations (loop equations). The authors derive refined versions of these equations for the "geodesic disk functions" $F(t; \chi)$ , which sum the weights of all maps with a fixed geodesic chord diagram $\chi$ .
Orthogonal Polynomials and $q$ -Combinatorics: The proof relies heavily on the properties of the specific weight sequence $t(q)$ associated with DSSYK. The authors utilize the orthogonality of renormalized $q$ -Hermite polynomials and the combinatorial properties of $q$ -Stirling numbers (of the first and second kind). A key step involves showing that the refined Tutte equation, when applied to the specific weights of the ETH model, reduces to an identity involving the orthogonality of these polynomials, leading to massive cancellations.

Key Contributions and Results

Theorem 1 (Main Result): For the ETH planar map model with weights $t(q)$ derived from the DSSYK potential, the geodesic disk function $F(t(q); \chi)$ depends only on the crossing number $i(\chi)$ of the chord diagram:
$F(t(q); \chi) = q^{i(\chi)}$
This identity holds as a formal power series in $q$ .
Refined Correspondence: This result provides a significant refinement of the known equality between the DSSYK partition function and the ETH map partition function. It establishes that the joint moments of the pseudometric observables (graph distances between arbitrary boundary points) in the planar map model exactly match the corresponding chord number statistics in the DSSYK chord diagram model. Specifically, for any function $f$ of distances:
$\sum_{\mathfrak{m} \in M_{2n}} f(d_\mathfrak{m}(\dots)) w_{t(q)}(\mathfrak{m}) = \sum_{\chi \in C_{2n}} f(d_\chi(\dots)) q^{i(\chi)}$
Probabilistic Interpretation (Corollary 2): The authors analyze the convergence of these series for real $q$ . They show that for sufficiently small $q$ ( $q \lesssim 0.042$ ), the absolute values of the weights form an admissible sequence, allowing for a probabilistic interpretation involving Boltzmann planar maps. In this regime, the difference between the probabilities of even and odd vertex counts in maps with a fixed geodesic chord diagram $\chi$ is proportional to $q^{i(\chi)}$ .
Enumeration of Chord Diagrams: The proof introduces a new refined enumeration of chord diagrams (Proposition 8) involving "strongly geodesic" segments, which connects to $q$ -Stirling numbers of the second kind.

Significance and Claims
The paper claims that this work provides the first example of enumerative control over planar maps involving many crossing geodesics simultaneously. While previous exact results for graph distances in planar maps were limited to non-crossing geodesics (e.g., 2-point or 3-point functions), this result demonstrates that for the specific ETH model, the complex geometry of intersecting geodesics is exactly captured by the simple crossing number of a chord diagram.

The authors note that this correspondence elucidates the discreteness of bulk geodesic lengths in the holographic dual of DSSYK, identifying them directly with graph distances in the planar map. They explicitly state that the result is non-probabilistic a priori due to the alternating signs of the weights, though a probabilistic interpretation exists in a restricted regime of small $q$ . The paper concludes by posing open questions regarding the $q \to 1$ limit (connection to JT gravity and Weil-Petersson volumes) and the extension of these results to higher genus surfaces, but does not claim to have resolved these extensions.