Published November 11, 2025 | Version 2
Computational notebook Open

Graphical Scattering Equations

  • 1. ROR icon Otto-von-Guericke University Magdeburg
  • 2. ROR icon Max Planck Institute for Mathematics in the Sciences
  • 3. ROR icon University of Wisconsin–Madison
  • 4. EDMO icon University of Michigan
  • 1. ROR icon Max Planck Institute for Mathematics in the Sciences
  • 2. ROR icon Johannes Kepler University of Linz

Description

This page contains auxiliary material for the paper Graphical Scattering Equations by Barbara Betti, Viktoriia Borovik, Bella Finkel, Bernd Sturmfels, and Bailee Zacovic.

The CHY scattering equations on the moduli space $\mathcal{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.

Technical info

The lists of 129 and 2328 copious graphs for $n=7$ and $8$ respectively, as well as the data with ML degrees, multidegrees and degrees of logarithmic discriminants (for graphs with a universal vertex) up to $n=8$ vertices are available in the following files:

  • Data456.pdf
  • Data7.pdf
  • Data8.pdf

The multidegrees for all 129 and 2328 copious graphs for $n=7$ and $8$ are contained in the following files:

  • Multidegrees7.pdf
  • Multidegrees8.pdf

The corresponding csv versions of all these tables are available in the attachments.

Most of our functions are written in $\texttt{Julia}$ and collected in the package ScatteringGraphs.zip.
A Jupyter Notebook with examples of its usage is provided in ScatteringGraphsTutorial.ipynb. This includes numerical solving of scattering equations, ML degree and multidegree computation with monodromy, and a verification if a graph is copious.

Notes

A computer-aided proof of the Corollary 8.6 by Manuel Kauers is available at 

Other

A detailed explanation how to convert a graph with a universal vertex to appropriate gauge fixing to compute the degree of the logarithmic discriminant is available in the Jupyter Notebook in the folder Discriminants.zip. There, it is done for all copious graphs with a universal vertex for $n=8$.

A Macaulay2 code verifying Proposition 4.11 is available in the M2.zip folder.

Files

Data6.csv

Files (3.4 MB)

Name Size Download all
md5:aed6f2bd9188a902eb5b8d437dfe7308
40 Bytes Preview Download
md5:b5af7ecb439f468c88f10c24dace81f7
41.1 kB Preview Download
md5:ec7c6bea8b51f8acf9689dcccc5946c0
65 Bytes Preview Download
md5:1d676dc103794d1a50ff8f2b990898fa
372 Bytes Preview Download
md5:1157f7b64dad64a64f011fadb72a1abf
5.0 kB Preview Download
md5:6fab837fdba4b0e9e1ed4a92dfde4a1a
186.3 kB Preview Download
md5:a035c9415a708c49677daa75fddecabf
127.2 kB Preview Download
md5:982d4d5fab7f7440f8ad85b217d0c1d1
318.2 kB Preview Download
md5:2050c86ed3a5e69c78fc73d1969373b6
47.6 kB Preview Download
md5:b42cfa6da98c80d0782a14ba62a8bb56
5.7 kB Preview Download
md5:d4ead568caa5c7d1a0292444f37453f7
11.0 kB Preview Download
md5:5311969bfd5fe9512dd261e3430da12e
126.0 kB Preview Download
md5:7ddba18779c09ab56d3b697a99d209dd
272.8 kB Preview Download
md5:447b11bc86bc284331ee486976aada2c
2.1 MB Preview Download
md5:0f621d43f5b700020fdfbb1625398336
115.6 kB Preview Download
md5:b2d214fc0869523838bc35a48d4d9b5e
34.3 kB Preview Download
md5:50a1ec37f467d8577a035de741334724
24.0 kB Preview Download

Additional details

Related works

Is supplement to
Preprint: arXiv:2511.07316v2 (arXiv)

Funding

European Commission
UNIVERSE PLUS - Positive Geometry in Particle Physics and Cosmology 101118787

Dates

Created
2025-11-11

Software

Programming language
Julia, Macaulay2