Table of Contents
Fetching ...

Graphical Scattering Equations

Barbara Betti, Viktoriia Borovik, Bella Finkel, Bernd Sturmfels, Bailee Zacovic

TL;DR

This work develops a graph-based generalization of CHY scattering by encoding momentum conservation on a fixed graph $G$ via the kinematic space $\mathcal{K}_G$ and the scattering correspondence $\mathcal{V}_G$. It introduces the scattering matroid $\mathcal{S}(G)$ and four equivalent notions of copiousness (geometric, matroidal, algebraic, topological), linking them to the ML degree $\mu(G)$ through multidegree data and partial compactifications $\mathcal{M}_G$ of $\mathcal{M}_{0,n}$; for many graphs, $\mu(G)$ is computable via topological invariants such as Euler characteristics and chromatic polynomials. The paper develops the scattering ideal $I_G$, establishes cases where it is prime, and connects the ML degree to both algebraic and combinatorial structures, including a conjectured closed-form formula $\mu(G)=\left|\sum_{s=3}^n (-1)^{s-3}(s-3)\!\,\!\!\! (s-3)!\,\pi_G(s)\right|$ counting independent-set partitions. Through extensive computations up to $n\le 9$ and analysis of discriminants and hypertrees (notably bipyramids), the authors illuminate the rich geometry governing graphical scattering, with implications for moduli spaces, very affine varieties, and the combinatorics of ML degrees.

Abstract

The CHY scattering equations on the moduli space $M_{0,n}$ play a prominent role at the interface of particle physics and algebraic statistics. We study the scattering correspondence when the Mandelstam invariants are restricted to a fixed graph on $n$ vertices.

Graphical Scattering Equations

TL;DR

This work develops a graph-based generalization of CHY scattering by encoding momentum conservation on a fixed graph via the kinematic space and the scattering correspondence . It introduces the scattering matroid and four equivalent notions of copiousness (geometric, matroidal, algebraic, topological), linking them to the ML degree through multidegree data and partial compactifications of ; for many graphs, is computable via topological invariants such as Euler characteristics and chromatic polynomials. The paper develops the scattering ideal , establishes cases where it is prime, and connects the ML degree to both algebraic and combinatorial structures, including a conjectured closed-form formula counting independent-set partitions. Through extensive computations up to and analysis of discriminants and hypertrees (notably bipyramids), the authors illuminate the rich geometry governing graphical scattering, with implications for moduli spaces, very affine varieties, and the combinatorics of ML degrees.

Abstract

The CHY scattering equations on the moduli space play a prominent role at the interface of particle physics and algebraic statistics. We study the scattering correspondence when the Mandelstam invariants are restricted to a fixed graph on vertices.

Paper Structure

This paper contains 8 sections, 26 theorems, 57 equations, 1 table.

Key Result

Theorem 1.3

For every graph $G$, the following three conditions are equivalent: These are also equivalent to the following condition for all graphs $G$ with a universal vertex: The implication from 4 to 1,2,3 holds for every graph $G$.

Theorems & Definitions (72)

  • Example 1.1: $n=4$
  • Example 1.2: $n=5$
  • Theorem 1.3
  • Lemma 2.1
  • Proposition 2.2
  • proof
  • Corollary 2.3
  • Corollary 2.3
  • Lemma 2.4
  • proof
  • ...and 62 more