Computations about formal multiple zeta spaces defined by binary extended double shuffle relations
Tomoya Machide

TL;DR
This paper computes the dimensions of formal multiple zeta spaces defined by binary extended double shuffle relations up to weight 22, verifying conjectures and revealing Pascal triangle patterns in their structure.
Contribution
It provides the first extensive computational verification of the dimension conjecture for formal multiple zeta spaces using Gaussian elimination.
Findings
Dimensions follow Pascal triangle patterns in depth-graded spaces
Verification of the dimension conjecture up to weight 22
Computational method using Gaussian forward elimination
Abstract
The formal multiple zeta space we consider with a computer is an -vector space generated by formal symbols for a given weight , where the symbols satisfy binary extended double shuffle relations. Up to weight , we compute the dimensions of the formal multiple zeta spaces, and verify the dimension conjecture on original extended double shuffle relations of real multiple zeta values. Our computations adopt Gaussian forward elimination and give information for spaces filtered by depth. We can observe that the dimensions of the depth-graded formal multiple zeta spaces have a Pascal triangle pattern expected by the Hoffman mult-indices.
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.
Taxonomy
TopicsAdvanced Mathematical Identities · Crystallization and Solubility Studies · Analytic Number Theory Research
