Planar Feynman Graphs in QFT

• Planar Feynman graphs are crossing-free diagrams that simplify the study of scattering amplitudes and integrability in quantum field theory.
• They are rigorously analyzed using combinatorial methods, Laplacian matrices, and dual-variable assignments to test and classify planarity.
• These graphs enable efficient computational techniques and uncover non-local symmetries like Yangian invariance, impacting modern integrable models.

Planar Feynman graphs are the subclass of Feynman diagrams that admit a crossing-free embedding in the plane and are central objects in quantum field theory, scattering amplitudes, and modern mathematical physics. The remarkable presence of non-local symmetries and combinatorial structure makes planar Feynman graphs a primary focus for understanding integrability, amplitude geometry, and new computational techniques in both perturbative quantum field theory and integrable systems.

1. Definition and Classifications of Planar Feynman Graphs

A Feynman graph is called planar if it can be embedded in the plane (or the sphere) such that no two edges cross. At each loop order in, for example, $\phi^4$-theory, some diagrams are planar while others are not. In the context of scalar theories, planar diagrams are those regular graphs where all vertices are connected such that the diagram can be drawn without overlapping edges, corresponding to tilings of the plane by polygons, such as squares in 4D, triangles in 3D, or hexagons in 6D for "fishnet" models (Chicherin et al., 2017), or general trivalent trees in the case of tree-level $\phi^3$ theory (Baadsgaard et al., 2015).

Planarity can be algorithmically tested for a given graph on the basis of its connectivity or momentum-flow structure. Explicit algebraic criteria based on either the Laplacian (adjacency) matrix of the underlying graph or the assignment of dual face-variables can decide planarity for arbitrary Feynman graphs, independent of their pictorial representation. Notably, even when a nonplanar graph can be embedded on higher-genus surfaces (e.g., a torus), the lack of face variables matching the number of propagators precludes standard dual-conformal techniques (Bielas et al., 2013).

2. Key Structures and Family Examples: Fishnets, Zig-Zags, Ladders

Fishnet Graphs

Fishnet graphs are a canonical family of planar Feynman graphs characterized by regular, periodic tilings of the plane:

• 4D "square" fishnets: vertices of degree 4 arranged in a square grid, all edges corresponding to scalar propagators $(1/x_{ij}^2)$ (Chicherin et al., 2017).
• 3D and 6D analogues: triangular and hexagonal tilings, respectively.

These graphs form the building blocks of double-scaling limits of $\gamma$-twisted $\mathcal{N}=4$ SYM or ABJM theory, yielding integrable chiral CFTs where only fishnet graphs survive in the planar limit (Caetano et al., 2016).

Zig-Zag (Ladder) Graphs

Zig-zag graphs are iterative planar Feynman diagrams constructed by alternating propagator "rungs" between two external points, commonly arising in $\phi^4$ theory and as ladders in fishnet models. They admit exact operator spectral solution via conformal triangles and are directly responsible for the dominant contributions to quantities such as the multi-loop $\beta$-function in 4D $\phi^4$ theory (Derkachov et al., 2022, Derkachov et al., 2023). Their measure and spectrum reduce in special cases (e.g., D=4, $\beta=1$) to closed expressions involving Catalan numbers and Riemann zeta values (Broadhurst-Kreimer conjecture, proved for this family).

General Planar Arrays and Positive Geometries

More abstractly, planar Feynman diagrams are fully characterized combinatorially—e.g., planar trivalent trees correspond precisely to triangulations of an $n$-gon, with the space of metrics possessing a direct interpretation in terms of Grassmannians and matroid subdivisions (Early, 2019, Cachazo et al., 2019, Borges et al., 2019). This structure admits generalization to "planar collections" and "planar matrices" for higher $k$ in biadjoint amplitudes, connecting with tropical Grassmannians and the positive geometry program.

3. Non-Local Symmetries: Yangian Invariance and Integrability

A hallmark of fishnet and more general planar Feynman graphs is invariance under non-local symmetries, notably the Yangian of the conformal algebra $\mathfrak{so}(2,D)$. This symmetry plays the role of integrability in higher-dimensional QFT:

• Level-0: Usual conformal Ward identities (dilatation, Lorentz, special conformal transformations) acting on external coordinates (Chicherin et al., 2017).
• Level-1: Non-local bi-local generators (Drinfel'd second realization), e.g., level-one momentum given by

$$\hat{P}^\mu = -i \sum_{j<k} \left[(L_j^{\mu\nu} + \eta^{\mu\nu} D_j)P_{k,\nu} - (j \leftrightarrow k)\right] + \sum_j v_j P_j^\mu.$$

• Full Yangian invariance is realized when both levels annihilate the integral, which holds under constraints on the propagator powers: specifically, the sum of powers around any loop equals the spacetime dimension $D$, generalizing dual-conformal invariance (Loebbert et al., 8 May 2025).

For loom/fishnet graphs constructed as duals to Baxter lattices (arbitrary planar arrangements of non-intersecting lines with associated angle-dependent propagator exponents), Yangian symmetry survives in generality, with explicit monodromy operators built from chains of conformal Lax operators (Kazakov et al., 2023). This construction underpins a broad class of integrable and exactly solvable planar correlators.

The presence of Yangian symmetry leads to new families of Ward identities—differential and integral equations—that dramatically constrain the functional form of planar Feynman integrals (e.g., governing their dependence on conformal cross ratios or external kinematics).

4. Combinatorial and Tropical-Geometric Characterizations

The combinatorial classification of planar diagrams is deeply intertwined with objects from tropical and matroid geometry:

• Planar Feynman graphs correspond to maximal weakly-separated collections in the space of possible "labels", which in the $k=2$ case are precisely triangulations of the $n$-gon (Catalan number $C_{n-2}$).
• The structure generalizes via "planar collections," "matrices," and higher arrays encoding weak separation and non-crossing compatibility to $k>2$ (e.g., $k=3$, $k=4$ amplitudes), corresponding to the combinatorics of tropical Grassmannians and related positive geometries (Cachazo et al., 2019, Borges et al., 2019, Early, 2019).

This classification is algorithmic, relying on planarity-based degenerations ("planar mutations") much in the spirit of cluster algebra mutations and faces of the Dressian.

5. Computational Techniques and Statistics

Planar Feynman graphs admit efficient computation relative to their non-planar counterparts due to their recursive integrable structure, notably in:

• Summation over trivalent planar trees for tree-level $\phi^3$ amplitudes, using combinatorial rules with direct mapping to CHY integrands in the scattering equations formalism, and twistor-string limits (Baadsgaard et al., 2015).
• Operator formalism for graph-building operators (e.g., for ladders and zigzags), providing spectral representations and Mellin-Barnes integral reductions (Derkachov et al., 2023, Derkachov et al., 2022).
• Automated planarity tests via Laplacian/adjacency matrices or dual-variable assignment, implementable in computer algebra systems (Bielas et al., 2013).
• Large-scale period enumeration: statistics of planar graph periods in $\phi^4$ theory reveal rapid asymptotic growth with loop order ($\sim (3/2)^L L^{5/2}$) and heavy-tailed distributions dominated by classes such as zigzags, which give the extremal behavior in both period values and contributions to the $\beta$-function (Balduf, 2023).

6. Parametric Periods, Forbidden Minors, and Algorithmic Obstructions

In the analysis of Feynman parameter integrals, planarity plays a key role in the absence of obstructions in parametric integration algorithms. In particular:

• The property of being "Feynman 5-split"—i.e., no five-invariant obstruction at step five in Francis Brown's integration procedure—is equivalent for 3-connected graphs to planarity along with the non-existence of certain forbidden minors: cube, octahedron, and their $\Delta$--$Y$ transform (a certain 7-vertex trivalent graph) (Black et al., 2013).
• For graphs of arbitrary connectivity, a finite set of enhanced forbidden minors determines the class for which 5-splitting holds, providing a minor-closed combinatorial test for smooth parametric integration.

7. Algebraic Identities and Lie-Theoretic Structures

Planar Feynman graphs are connected to deep enumerative and algebraic structures:

• The Feynman identity expresses the Euler polynomial of a planar graph as an infinite product over signed nonperiodic cycle classes, directly paralleling the denominator identity for free Lie superalgebras generated from the graph (Costa, 2015).
• This product formula connects to the Ihara and Kac–Ward graph zeta functions, encapsulating both the combinatorics of cycles and the algebraic invariants of the underlying planar structure.

Summary Table: Principal Planar Graph Families and Structures

Graph Family/Class	Defining Planarity/Structure	Key Algebraic/Physical Features
Fishnet graphs	Regular polygons (square/triangular/hexagonal)	Yangian invariance, integrability, conformal PDEs
Zig-zag graphs	Spiral/ladder alternating 2-point graphs	Operator diagonalization, Broadhurst–Kreimer formula
Planar trivalent trees	Triangulations of $n$-gon	CHY formalism, scattering equations, cluster algebra
Planar collections/matrices	k-dimensional arrays, compatibility conditions	Tropical Grassmannians, higher $k$ biadjoint amplitudes
Baxter loom graphs	Arbitrary planar Baxter tilings, no crossings	Generalized Lax operator monodromy, integrability

• Yangian symmetry for fishnet graphs and solution techniques (Chicherin et al., 2017).
• Operator and spectral theory for ladders and zigzags (Derkachov et al., 2022, Derkachov et al., 2023).
• Planar arrays, matrices, and amplitude enumerations (Cachazo et al., 2019, Borges et al., 2019, Early, 2019).
• Loom graphs and the universal construction of Yangian Ward identities (Kazakov et al., 2023).
• Algorithmic and algebraic criteria for planarity and parametric integration (Bielas et al., 2013, Black et al., 2013).
• Asymptotic statistics for planar graph periods (Balduf, 2023).
• Algebraic cycle/factorization identities on planar graphs (Costa, 2015).
• Scattering equations/CHY representation for planar graphs (Baadsgaard et al., 2015).
• Non-local Yangian symmetry in planar Feynman integrals (Loebbert et al., 8 May 2025).

Planar Feynman graphs embody the confluence of combinatorics, geometry, integrable systems, and computational techniques, serving as a unifying scaffold for many of the recent advances in QFT amplitudes and mathematical physics.