Canonicalizing zeta generators: genus zero and genus one
Daniele Dorigoni, Mehregan Doroudiani, Joshua Drewitt, Martijn Hidding, Axel Kleinschmidt, Oliver Schlotterer, Leila Schneps, Bram Verbeek

TL;DR
This paper develops a canonical framework for zeta generators in genus zero and one, linking motivic multizeta values, elliptic associators, and modular forms, with explicit high-order computations and resolution of ambiguities.
Contribution
It introduces a canonical choice of polynomials for zeta generators, establishing a systematic connection between genus-zero and genus-one cases and resolving previous ambiguities.
Findings
Canonical isomorphism mapping motivic multizeta values to the f-alphabet
Explicit high-order expansions of genus-one zeta generators
Resolution of ambiguities in non-geometric genus-one zeta generators
Abstract
Zeta generators are derivations associated with odd Riemann zeta values that act freely on the Lie algebra of the fundamental group of Riemann surfaces with marked points. The genus-zero incarnation of zeta generators are Ihara derivations of certain Lie polynomials in two generators that can be obtained from the Drinfeld associator. We characterize a canonical choice of these polynomials, together with their non-Lie counterparts at even degrees , through the action of the dual space of formal and motivic multizeta values. Based on these canonical polynomials, we propose a canonical isomorphism that maps motivic multizeta values into the -alphabet. The canonical Lie polynomials from the genus-zero setup determine canonical zeta generators in genus one that act on the two generators of Enriquez' elliptic associators. Up to a single contribution at fixed degree, the zeta…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
