GeoTriage

GeoTriage reads a Feynman graph and reports the geometry of its maximal cutthe integral with every propagator put on shell; what remains is a polynomial in a few leftover variables, and the curve or surface where it vanishes controls how hard the full integral is: a rational curve, an elliptic curve (and which one), a K3 surface, a Calabi–Yau space, or a curve of higher genus. From that it recommends how the integral should be computed, as a one-letter class A through E, and lists every assumption behind the verdict. It names an elliptic family from Beauville's list of modular elliptic surfaces and tests a K3 surface for complex multiplicationan extra arithmetic symmetry of an elliptic curve or K3 surface present only at special parameter values (CM) with Livné's criterion.

What it does

The cut polynomial defines a curve or surface. The functions and constants that can appear in the integral depend on the type of that variety. GeoTriage reads that type for one graph, before any numerical work. It does not evaluate or reduce any integral.

A short JSON description of the graph goes in and a JSON report comes out. The input lists the edges with their masses, the external legs at each vertex, and the kinematic invariants, in the schema the Landau Alphabet package uses. Two blocks are optional:

The classification goes by the number of residual variables, and then by the type found.

The K3 test is a proof only for the equal-mass three-loop banana, where the $a_p$ come from a known modular form. For any other K3 GeoTriage counts points on a banana-shaped model, subtracts a polynomial background fixed by exact arithmetic, and scans a short list of candidate discriminants $D$. A unique match is reported as a probe verdict with certified: false. When no background fits the counts, is_cm is left null.

The route field of the report is the recommendation.

RouteGeometryHow to compute the integral
AGenus 0, or CM ellipticFit a high-precision numerical evaluation against known constants such as multiple zeta values
BElliptic on $X_1(N)$ with $N\le 10$ or $N=12$, or K3 with CMThe same fit with one boundary constant added, an $L$-value named in ring_conductors (a Dirichlet $L$-value in the elliptic case)
CElliptic on none of those curves, or K3 whose CM status is openA fit alone cannot succeed; solve the differential equations from a known boundary
DCalabi–Yau, or K3 found to be non-CMTransport the periods along the differential equation; no fit is attempted
EGenus two or moreBeyond the routes the toolkit offers

The criterion is proved in one direction only: a C verdict is firm, and an A or B verdict is a hypothesis that the later fit confirms or refutes.

Read the honesty field of the report first. GeoTriage has these limits:

To classify a cut polynomial by discriminant chains without a graph description, see Maxcut. GeoTriage is also the reference implementation behind the $p$-adic Frobenius boundary-constant method, which reads a boundary constant off the Picard–Fuchs operator reduced modulo primes. The Frobenius package is a different tool, for solutions at infinite mass.

Examples

Classify one graph from the command line. The ice-cream-cone fixture supplies its cut polynomial directly, $P=z(z-4)\,((z-w)^2-4tw)$ with residual variable $z$ and modulus $w$, and a fiber point {"w": 5, "t": 3}. With the package set up (see Requirements), run from the package directory tools/geotriage/:

python geotriage.py graph_specs/icc.json --out icc_classify.json

Without --out the report is printed instead of written. In the report variety.type is elliptic, and the fiber signature matches nothing in Beauville's list, so elliptic.level_N is null. cm.is_cm is false because $j$ at the fiber point is a non-integer rational, and route is C. honesty.caveats records that the polynomial was taken from the spec and that no higher-level modular curve was searched.

Call it from Python. The sunrise fixture has no "maxcut" block, so the polynomial is derived from the graph:

from geotriage import classify
rep = classify("graph_specs/sunrise_eq.json")
rep['route']            # 'B'
rep['elliptic']         # {j, kodaira, level_N, on_X1N, congruence_group, ...}
rep['honesty']          # {genus_method, cm_evidence, pf_order_certified, caveats}

rep['elliptic'] gives fiber_signature [1, 2, 3, 6], level_N 6 and congruence_group Gamma_1(6). rep['ring_conductors'] names $\chi_{-3}$, whose $L$-value is the boundary constant. classify also accepts a dict.

Run the self-test suite, from inside the package directory:

python test_geotriage.py

After its unit checks the script classifies six known cases: five fixtures from graph_specs/ and an unequal-mass four-edge banana defined inline. The expected verdicts are:

CaseGeometryRoute
One-loop massless boxGenus 0A
Equal-mass sunriseElliptic with fiber signature (1, 2, 3, 6) on $\Gamma_1(6)$B
Ice-cream coneElliptic on no small $X_1(N)$C
Equal-mass three-loop bananaK3 with CM by $\mathbb{Q}(\sqrt{-15})$B
Three-loop crossed boxGenus 0A
Banana with masses (1, 1, 1, 2)K3 with CM by $\mathbb{Q}(\sqrt{-3})$ from the probeB with a not-certified caveat

Routines

CommandWhat it does
python geotriage.py <spec.json> [--out FILE] [-v]Classifies one graph and writes the report to FILE or prints it; -v prints it in either case
python test_geotriage.pyRuns the self-test suite

The Python functions are loaded with from geotriage import ....

FunctionWhat it returns
classify(spec_or_path, verbose)The report dict, after running every step
baikov_maxcut(spec)The cut polynomial of the top sector, from spec["maxcut"] or the second Symanzik polynomial
classify_variety(mc)Dimension, genus, type (polylog, elliptic, hyperelliptic, K3, CY3, ...), estimated Picard–Fuchs order, genus_method
elliptic_invariants(P, var, modulus)$j$, discriminant, Kodaira fibers, fiber_signature, level_N, on_X1N, congruence_group
cm_check_elliptic(j_expr, modulus, fiber_point, pmax)is_cm, discriminant_D, certified and the evidence, with point counts at primes up to pmax
cm_check_K3(spec, mc, pmax, D_candidates)is_cm, discriminant_D and the evidence, from Livné's test or the point-count probe
k3_ap_probe(raw, D_candidates)locked, background, resid, zero_density, matches, from raw K3 point counts keyed by prime
closure_route(cls)Route A to E with reason, ring_conductors, honesty

Two helper modules check single fibers of a Legendre-form elliptic family $y^2=u(u-1)(u-\lambda)$ by exact arithmetic. Their functions are listed under MEMBERS in GUIDE.md.

Used on this site

Requirements

Source and references

The code is tools/geotriage/ in the BootLoops repository, released under the MIT license. README.md there has the decision table and separates what is certified from what is a probe.

ReferenceWhat it supplies
P. A. Baikov, Phys. Lett. B 385 (1996) 404Maximal cuts in the Baikov representation
Frellesvig and Papadopoulos, JHEP 04 (2017) 083, arXiv:1701.07356The loop-by-loop form of the Baikov representation
KodairaThe types of the singular fibers of an elliptic family
A. Beauville, C. R. Acad. Sci. Paris Sér. I 294 (1982) 657The list of four-cusp rational elliptic surfaces
A. Sebbar, Duke Math. J. 110 (2001) 377The index data, from the classification of torsion-free genus-zero congruence subgroups
R. Livné, Israel J. Math. 92 (1995) 149The CM test for rank-2 K3 motives
Bloch and Vanhove, arXiv:1309.5865; Bloch, Kerr and Vanhove, arXiv:1406.2664, arXiv:1601.08181The elliptic and K3 identifications of the sunrise and banana graphs
FLINT, through python-flintThe exact arithmetic of exactj.py

← back to the tools index