TL;DR
This paper computes and analyzes Feynman periods of primitive log-divergent $$ graphs up to eleven loops, exploring their structure through conjectures and Galois coaction, and comparing with non-$$ graph periods.
Contribution
It provides the first extensive calculations of $$ periods up to eleven loops and investigates their algebraic structure via Galois coaction conjectures.
Findings
$$ periods exhibit a conjectured Galois coaction structure.
Distinct differences are observed between $$ and non-$$ graph periods.
Explicit period data are provided for future research.
Abstract
We report on calculations of Feynman periods of primitive log-divergent graphs up to eleven loops. The structure of periods is described by a series of conjectures. In particular, we discuss the possibility that periods are a comodule under the Galois coaction. Finally, we compare the results with the periods of primitive log-divergent non- graphs up to eight loops and find remarkable differences to periods. Explicit results for all periods we could compute are provided in ancillary files.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
