On Solving Dual Conformal Integrals in Coulomb-branch Amplitudes and Their Periods

This paper defines and solves infinite families of all-loop planar dual conformal integrals in ${\cal N}=4$ supersymmetric Yang-Mills theory using differential equations and binary-string-labeled single-valued harmonic polylogarithms, while characterizing their periods as single-valued multiple zeta values that are bounded by the famous "zigzag" and ladder integral cases.

The Gist

Imagine you are trying to solve a massive, cosmic puzzle. In the world of theoretical physics, this puzzle is the behavior of subatomic particles, specifically in a highly symmetrical universe called N=4 Super Yang-Mills theory. Physicists use mathematical tools called Feynman integrals to calculate how these particles interact.

Think of these integrals as recipes. A simple recipe (like a one-loop calculation) is easy to follow. But as you add more ingredients (more "loops" or interactions), the recipe becomes a chaotic, impossible-to-cook stew. Usually, these recipes are so complex that they can't be solved exactly, only approximated.

This paper, by Song He and Xuhang Jiang, is like discovering a secret kitchen where, instead of a chaotic stew, you find infinite families of recipes that are perfectly structured, elegant, and solvable.

Here is the breakdown of their discovery using everyday analogies:

1. The "Binary" Code of the Universe

The authors found a way to organize these complex recipes using a simple code: 0s and 1s.

• Imagine every possible interaction in the particle collision is a string of light switches.
• Some switches are "0" (off) and some are "1" (on).
• The authors discovered a special rule: You can never have two "1s" next to each other. (No "11").
• This rule is called the Steinmann relation. In our kitchen analogy, it's like a rule that says, "You can't put two spicy peppers right next to each other in the recipe, or the dish explodes."

Because of this rule, the number of possible valid recipes follows a famous pattern in math called the Fibonacci sequence (1, 1, 2, 3, 5, 8...). This means the universe is surprisingly orderly, even in its most complex interactions.

2. The Two Extremes: The Ladder and the Zigzag

Within this "binary code" family, the authors identified two extreme types of recipes that act as the bookends for everything else:

• The Ladder (The Simple Path): Imagine a ladder where you only have one rung (a "1") and then a long, straight line of zeros. This represents the simplest, most straightforward interactions. These are the "ladder integrals" physicists have known about for decades. They are easy to solve.
• The Zigzag (The Winding Path): Now imagine a path that goes up and down, up and down, alternating perfectly (1, 0, 1, 0, 1, 0...). This is the "Zigzag" family. These are the most complex, winding paths.
  • The authors found that these Zigzag paths come from a specific geometric shape called an Antiprism (think of two triangles twisted and connected, like a twisted prism).
  • Surprisingly, even though these paths are the most complex, they still have a beautiful, simple answer at the end.

The Big Discovery: The authors showed that every other possible recipe in this binary family lies somewhere between the simple Ladder and the complex Zigzag. They solved the math for the entire family, not just the extremes.

3. The "Periods": The Final Taste

In physics, after you solve a recipe, you often want to know its "Period." Think of the Period as the final flavor or the total energy of the dish.

• For most complex recipes, the flavor is a messy mix of ingredients (complicated numbers).
• However, the authors found that for their special binary family, the flavors are surprisingly clean. They turn out to be specific, famous numbers called Zeta values (like $\pi$, or $\zeta(3)$, which are constants that appear everywhere in math).
• The "Zigzag" Surprise: The most complex Zigzag recipes produce a flavor that is exactly proportional to a single, famous number ($\zeta_{2L+1}$). It's like taking a dish with 100 ingredients and finding out the final taste is just "Pure Vanilla."

4. The "F-Graphs": The Blueprint

How did they find these recipes? They used a tool called F-graphs.

• Imagine the particle interactions as a map or a blueprint made of dots and lines.
• The authors realized that if you draw these blueprints in a specific way (planar, meaning no lines cross over each other), the "binary code" (the 0s and 1s) naturally emerges.
• They used these blueprints to prove that if you have one valid recipe, you can flip the blueprint around, and you get a different valid recipe that tastes exactly the same. This revealed a hidden symmetry in the universe: The order of ingredients doesn't change the final flavor, as long as you follow the binary rules.

Why Does This Matter?

1. Solving the Unsolvables: They provided a method to solve infinite families of these particle interactions exactly, which was previously thought to be impossible for such high levels of complexity.
2. A New Map: They created a "period spectrum." Just as a musician can see all the notes between a low C and a high C, they can now see all the possible "flavors" (periods) between the simple Ladder and the complex Zigzag.
3. Mathematical Beauty: They showed that deep inside the messy, chaotic world of quantum particles, there is a strict, binary code (0s and 1s) and a Fibonacci sequence governing how things interact.

In Summary:
The authors took a chaotic, high-dimensional problem in quantum physics and realized it was actually a giant, organized library of books written in a simple binary code. They found the two extreme books (Ladder and Zigzag), proved that every book in between follows the same rules, and discovered that the "moral of the story" (the period) for the most complex books is surprisingly simple and beautiful. They used a special map (F-graphs) to navigate this library, revealing that the universe is more structured and predictable than we thought.

Technical Summary

1. Problem Statement

The paper addresses the challenge of evaluating infinite families of all-loop planar, dual conformal invariant (DCI) integrals that contribute to four-point amplitudes and correlators in $\mathcal{N}=4$ supersymmetric Yang-Mills (SYM) theory. While specific families like "ladder" integrals are well-understood, there is a lack of systematic methods to solve more complex, infinite families of DCI integrals that arise from the light-like limits of f-graphs (graphical ansatzes for correlator integrands).

Specifically, the authors aim to:

• Identify and solve infinite families of DCI integrals beyond the standard ladder case.
• Characterize the resulting transcendental functions (Single-Valued Harmonic Polylogarithms, or SVHPLs) and their constraints (specifically the Extended Steinmann relations).
• Compute the periods of these integrals (integrated correlators) and understand their relation to Single-Valued Multiple Zeta Values (SVMZVs).
• Establish a correspondence between these integrals, their function space, and the underlying f-graphs.

2. Methodology

The authors employ a combination of differential equation techniques, graphical function theory, and combinatorial analysis:

• Boxing Differential Equations: The core computational tool is the "boxing" differential equation, a second-order differential operator that relates higher-loop integrals to lower-loop ones. The authors solve these equations recursively.
• Graphical Functions & HyperlogProcedures: They utilize the method of graphical functions (as implemented in the HyperlogProcedures package) to solve the differential equations. This allows them to express results in terms of SVHPLs.
• Inverse Boxing: Instead of reducing integrals, they use "inverse boxing" to construct canonical series of DCI integrals starting from a basic box integral, guided by binary strings.
• f-Graphs: They use f-graphs (planar graphs with specific symmetries) as a bridge. By taking light-like limits of specific cycles in f-graphs, they generate the DCI integrals. The periods of these f-graphs are defined by integrating over all external points.
• Combinatorial Constraints: They impose the Extended Steinmann relations, which forbid consecutive singularities in the symbol of the functions. In the context of their binary strings, this translates to a constraint of no consecutive '1's.

3. Key Contributions

A. Definition of "Binary" DCI Integrals

The authors define a new infinite family of DCI integrals labeled by binary strings of 0s and 1s.

• Constraints: The strings must satisfy the Extended Steinmann relations, meaning no two '1's can be consecutive.
• Counting: The number of such independent integrals at loop order $L$ follows the Fibonacci sequence.
• Function Space: These integrals evaluate to a specific subset of SVHPLs called Binary Steinmann SVHPLs.

B. Two Extreme Cases

The binary family interpolates between two well-known extremes:

1. Ladder Integrals: Correspond to strings with a single '1' followed by all '0's (e.g., 1000...).
2. Zigzag Integrals: Correspond to strings with alternating '1's and '0's (e.g., 101010...). These arise uniquely from antiprism f-graphs.

C. Solving via "Inverse Boxing"

The authors provide a constructive algorithm ("inverse boxing") to generate the canonical integrand for any binary string:

• Start with a box.
• Iterate through the string: a '1' implies applying an inverse boxing operator to vertex $x_4$ (with a specific normalization factor $u$), while a '0' implies applying it to vertex $x_1$.
• This generates unique planar DCI integrands for every valid binary string.

D. Periods and SVMZVs

The paper computes the periods (integrated values) of these integrals up to 10 loops.

• Zigzag Periods: The periods of the zigzag integrals (from antiprism f-graphs) are exactly proportional to odd zeta values $\zeta_{2L+1}$.
• Bounds: The authors conjecture and verify that for a fixed loop order $L$, the magnitude of the period for any binary DCI integral lies between the ladder period (maximum magnitude) and the zigzag period (minimum magnitude).
• Basis Enumeration: They enumerate a basis for the periods of binary Steinmann SVHPLs up to $L=10$, showing they saturate the space of single-valued motivic MZVs up to that order.

E. Graph-Function Correspondence

A significant contribution is the proof of Proposition 2: A single weight-preserving f-graph can generate two different binary DCI integrals corresponding to reversed binary strings (e.g., $B_{n_1, \dots, n_r}$ and $B_{n_r, \dots, n_1}$).

• This implies an identity between their periods: $P_{n_1, \dots, n_r} = P_{n_r, \dots, n_1}$.
• This symmetry is derived from the reversibility of the boxing operations on the f-graph diagrams.

4. Key Results

• Explicit Solutions: The authors provide explicit SVHPL expressions and period values for binary DCI integrals up to 10 loops.
• Special Cases: They identify specific non-ladder/non-zigzag integrals (e.g., at 7 loops: $B_{1010010}$) that also evaluate to a single zeta value ($\zeta_{15}$), suggesting a broader class of "pure" periods.
• Conjectures:
  • Conjecture 1: Integrals of the form $P_{2, 3, \dots, 3, 2}$ evaluate to a single zeta value $\zeta_{6m+9}$.
  • Conjecture 2: The period magnitudes are bounded by the ladder and zigzag cases for any given loop order.
• Weight Dropping: They distinguish between "weight-preserving" f-graphs (ending in a box, weight $2L$) and "weight-dropping" f-graphs (ending in a p-integral, weight $<2L$), analyzing how divergences and finite parts relate in the latter case.

5. Significance

• New Solvable Families: This work significantly expands the landscape of solvable Feynman integrals beyond ladders, providing a systematic framework for a vast class of planar DCI integrals.
• Mathematical Structure: It deepens the understanding of the relationship between Extended Steinmann relations, Fibonacci combinatorics, and Single-Valued Multiple Zeta Values.
• Physical Application: The results are directly applicable to the perturbative calculation of four-point correlators and Coulomb-branch amplitudes in $\mathcal{N}=4$ SYM. The periods computed correspond to integrated correlators, which are crucial for testing AdS/CFT correspondence and studying anomalous dimensions.
• Tool Development: The paper demonstrates the power of combining f-graphs (as a combinatorial tool) with graphical functions (as an integration tool) to uncover hidden symmetries and identities among periods that would be difficult to detect via direct integration alone.

In summary, the paper establishes a "binary" classification for a large class of all-loop integrals, solves them recursively, and reveals a rich structure of periods bounded by ladder and zigzag limits, all governed by the combinatorics of f-graphs and Steinmann relations.