Totally odd depth-graded multiple zeta values and period polynomials
Charlotte Dietze, Chokri Manai, Christian N\"obel, Ferdinand Wagner

TL;DR
This paper investigates the structure and rank of matrices associated with totally odd motivic depth-graded multiple zeta values, providing new proofs and a recursive approach to understanding their relations and conjectures.
Contribution
It offers new proofs for upper bounds on the rank of matrices related to multiple zeta values and introduces a recursive method to analyze their general relations.
Findings
Established new proofs for rank bounds of matrices $C_{N,3}$ and $C_{N,4}$
Proposed a recursive approach reducing the problem to an isomorphism conjecture
Connected the study of multiple zeta values to period polynomials
Abstract
Inspired by a paper of Tasaka, we study the relations between totally odd, motivic depth-graded multiple zeta values. Our main objective is to determine the rank of the matrix defined by Brown. We will give new proofs for (conjecturally optimal) upper bounds on the rank of and , which were first obtained by Tasaka. Finally, we present a recursive approach to the general problem, which reduces evaluating the rank of to an isomorphism conjecture.
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
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Advanced Combinatorial Mathematics
