The Lyndon basis conjecture for multiple zeta values via multiple tt-values

Let Zk\mathcal{Z}_k be the weight-kk space of ordinary multiple zeta values. For a sequence (k1,,kr)(k_1,\ldots,k_r), call it Lyndon when every proper right subsequence is greater than the full sequence in lexicographical order. The multiple tt-value basis conjecture. (1) A linear basis of Zk\mathcal{Z}_k is

{t(2)nt(k1,,kr)n,r0, ki odd, ki3, 2n+k1++kr=k}.\{t(2)^n t(k_1,\ldots,k_r)\mid n,r\geq 0,\ \forall k_i\text{ odd},\ k_i\geq 3,\ 2n+k_1+\cdots+k_r=k\}.

(2) An algebra basis of Z\mathcal{Z} is given by t(2)t(2) and the values t(k1,,kr)t(k_1,\ldots,k_r) with every kik_i odd and at least 33, where (k1,,kr)(k_1,\ldots,k_r) is Lyndon. The conjecture seeks linear and algebraic bases of ordinary multiple zeta values in terms of multiple tt-values; the source records numerical evidence and notes related results of Murakami.

Sources & referencesView supporting material

Primary source

Masanobu Kaneko and Hirofumi Tsumura, “On a variant of multiple zeta values of level two”, arXiv:1903.03747 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.