Preprint
Article

Finite and Symmetric Euler Sums and Multiple T-Values

Altmetrics

Downloads

90

Views

31

Comments

0

This version is not peer-reviewed

Submitted:

19 February 2024

Posted:

20 February 2024

You are already at the latest version

Alerts
Abstract
Euler sums are alternating (or level two) extension of multiple zeta values (MZVs). Kaneko and Tsumura initiated the study of multiple T-values (MTVs), another level two generalization, by restricting the summation indices in the definition of MZVs to a fixed parity pattern. In this paper, we shall study finite MTVs and their alternating versions which are level two and level four variations of finite MZVs, respectively. We conjecture that all finite MZVs are in the Q-span of finite MTVs which in turn apparently lie in the span of finite Euler sums, and the inclusions are both proper. We shall first provide some structural results for Euler sums of small weights, guided by the author's previous conjecture that the finite Euler sum space of weight w is isomorphic to a quotient Euler sum space of weight w. Then, by utilizing some well-known properties of the classical alternating MTVs, we shall derive a few important Q-linear relations among the finite alternating MTVs, including the reversal, linear shuffle and sum relations. We then compute the upper bound for the dimension of the Q-span of weight w finite (alternating) MTVs for w<9, both rigorously using the newly discovered relations and numerically aided by computers.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory

1. Introduction

In [10] Kaneko and Tsumura proposed to study the multiple T-values (MTVs)
T ( s ) : = n 1 > > n d > 0 n j d j + 1 ( mod 2 ) j = 1 d 1 n j s j , s = ( s 1 , , s d ) N d ,
as level two variations of multiple zeta values which in turn were first studied by Zagier [26] and Hoffman [3] independently:
ζ ( s ) : = n 1 > > n d > 0 j = 1 d 1 n j s j , s = ( s 1 , , s d ) N d ,
where N is the set of positive integers. These series converge if and only if s 1 2 in which case we say s is admissible. As usual, we call | s | : = s 1 + + s d the weight and d the depth. The main motivation to consider MTVs is that they have the following iterated integral expressions
T ( s ) = 0 1 d t t s 1 1 d t 1 t 2 d t t s d 1 d t 1 t 2
which equips the MTVs with a Q -algebra structure because of the shuffle product property satisfied by the iterated integral multiplication (see, e.g., [25, Lemma 2.1.2(iv)]).
Besides MTVs, many other variants of multiple zeta values have been studied due to their important connections to a varieties of objects in both mathematics and theoretical physics (see, e.g., [2,6,10,22]). On the other hand, the congruence properties of the partial sums of MZVs were first considered by Hoffman [5] and the author [24] independently. Contrary to the classical cases, only a few variants of these sums exist (see, e.g., [9,16,23]). In this paper, we will concentrate on the finite analog of MTVs defined by (1).
Let P be the set of primes and put
A : = p P ( Z / p Z ) / p P ( Z / p Z ) .
Then we can define the finite multiple zeta values (FMZVs) by the following:
ζ A ( s ) : = p > n 1 > > n d > 0 j = 1 d 1 n j s j ( mod p ) p P A .
Nowadays, the main motivation to study FMZVs is to understand a deep conjecture proposed by Kaneko and Zagier around 2014 (see Conjecture 1.1 below for a generalization). Although this conjecture is far from being proved many parallel results have been shown to hold for both MZVs and FMZVs simultaneously (see, e.g., [12,13,14]). In particular, for each positive integer w 2 , the element
β w : = B p w w w < p P A
is the finite analog of ζ ( w ) , where B n ’s are the Bernoulli numbers defined by
t e t 1 = n 0 B n t n n ! .
And the connection goes even further to their alternating versions—the Euler sums and finite Euler sums. For s 1 , , s d N and σ 1 , , σ d = ± 1 , we define the Euler sums
ζ ( s 1 , , s d ; σ 1 , , σ d ) : = n 1 > > n d > 0 j = 1 d σ j n j n j s j .
To save space, if σ j = 1 then s ¯ j will be used and if a substring S repeats n times in the list then { S } n will be used. For example, the finite analog of ζ ( 1 ¯ ) = ζ ( 1 ; 1 ) = log 2 is the Fermat quotient
q 2 : = 2 p 1 1 p ( mod p ) 3 p P A .
Put sgn ( s ¯ ) = 1 and | s ¯ | = s if s N . For s 1 , , s d D : = N N ¯ we can define the finite Euler sums by
ζ A ( s ) : = p > n 1 > > n d > 0 j = 1 d sgn ( s j ) n j n j | s j | ( mod p ) p P A .
In [25, Conjecture 8.6.9] we extended Kakeko–Zagier conjecture to the setting of the Euler sums. For s = ( s 1 , , s d ) D d , define the symmetric version of the alternating Euler sums
ζ S ( s ) : = i = 0 d j = 1 i ( 1 ) | s j | sgn ( s j ) ζ ( s i , , s 1 ) ζ ( s i + 1 , , s d )
where ζ ( = or ⧢) are regularized values (see [25, Proposition 13.3.8]). They are called ♯-regularized symmetric Euler sums. If s N d then they are called ♯-regularized symmetric multiple zeta values (SMZVs).
Conjecture 1.1. (cf. [25, Conjecture 8.6.9]) For any w N , let FES w (resp. ES w ) be the Q -vector space generated by all finite Euler sums (resp. Euler sums) of weight w. Then there is an isomorphism
f ES : FES w ES w ζ ( 2 ) ES w 2 , ζ A ( s ) ζ S ( s ) ,
where = or ⧢.
We remark that ζ S ( s ) ζ S ( s ) always lies in ζ ( 2 ) ES w 2 , see [25, Exercise 8.7]. Thus it does not matter which version of symmetric Euler sums is used in the conjecture.
Problem 1.2.
What is the correct generalization of [25, Theorem 6.3.5] for symmetric Euler sums? Or extension of [25, Theorem 8.5.10] to finite Euler sums?
Our primary motivation to study finite (alternating) MTVs is to better understand this mysterious relation f ES . We now briefly describe the content of this paper. We will start the next section by defining finite MTVs and symmetric MTVs, which can be shown to appear on the two sides of Conjecture 1.1, respectively. The most useful property of MTVs is that they have the iterated integral expressions (3) satisfying the shuffle multiplication. This leads us to the discovery of the linear shuffle relations for the finite MTVs (and their alternating version) in section 3 and some interesting applications of these relations. In the last section, we will consider both the finite MTVs and their alternating version by computing the dimension of the weight w piece for w < 9 and then compare these data to their Archimedean counterparts obtained by Xu and the author [19,20].

2. Symmetric and finite multiple T-values

It turns out that the finite MTVs are closely related to another variant called finite MSVs. For all admissible s = ( s 1 , , s d ) N d , we define the finite multiple T-values (FMTVs) and the finite multiple S-values (FMSVs) by
F A ( s ) : = p > n 1 > > n d > 0 n j d j + 1 ( mod 2 ) if F = T , n j d j ( mod 2 ) if F = S j = 1 d 1 n j s j ( mod p ) p P A .
It is clear that
F A ( s ) = 1 2 d σ 1 , , σ d = ± 1 1 j d 2 | d j if F = T 2 d j if F = S σ j ζ A ( s ; σ ) .
Motivated by Conjecture 1.1, we provide the following definition.
Definition 2.1.
Let d N and s = ( s 1 , , s d ) N d . Let F = S or T. We define the ♯-regularized MTVs ( = or ⧢) and MSVs by
F ( s ) : = 1 2 d σ 1 , , σ d = ± 1 1 j d 2 | d j if F = T 2 d j if F = S σ j ζ ( s ; σ ) ( F = T or S ) .
We define the ♯-symmetric multiple T-values (SMTVs) and ♯-symmetric multiple S-values (SMSVs) by
F S ( s ) : = i = 0 d = 1 i ( 1 ) s F ( s i , , s 1 ) F ( s i + 1 , , s d ) , if d is even ; i = 0 d = 1 i ( 1 ) s F ˜ ( s i , , s 1 ) F ( s i + 1 , , s d ) , if d is odd ,
where F ˜ = S + T F and we set as usual = 1 0 = 1 .
Proposition 2.1.
Suppose f ES is defined as in Conjecture 1.1. Let = or . Then for all s = ( s 1 , , s d ) N d we have f ES T A ( s ) = T S ( s ) and f ES S A ( s ) = S S ( s ) modulo ζ ( 2 ) .
Proof. 
Suppose d is even and s N d . Then modulo ζ ( 2 )
f ES T A ( s ) = 1 2 d ε 1 , , ε d = ± 1 1 j d j d ( mod 2 ) ε j f ES ζ A s ε = 1 2 d ε 1 , , ε d = ± 1 1 j d 2 | j ε j ζ S s ε = 1 2 d ε 1 , , ε d = ± 1 1 j d 2 | j ε j i = 0 d = 1 i ( 1 ) s ε ζ s i , , s 1 ε i , , ε 1 ζ s i + 1 , , s d ε i + 1 , , ε d = 1 2 d i = 0 d = 1 i ( 1 ) s ε 1 , , ε d = ± 1 1 j d 2 | j ε j = 1 i ε ζ s i , , s 1 ε i , , ε 1 ζ s i + 1 , , s d ε i + 1 , , ε d = 1 2 d i = 0 d = 1 i ( 1 ) s ε 1 , , ε i = ± 1 1 j i 2 j ε j ζ s i , , s 1 ε i , , ε 1 × ε 1 , , ε i = ± 1 i < j d 2 | j ε j ζ s i + 1 , , s d ε i + 1 , , ε d = 1 2 d i = 0 d = 1 i ( 1 ) s T ( s i , , s 1 ) T ( s i + 1 , , s d ) = T S ( s ) .
The MSVs and the odd d cases can all be computed similarly and are left to the interested reader. □
Hence, we expect that whenever certain relation hold on the finite side then the same relations should hold for the symmetric version, at least modulo ζ ( 2 ) , and vice versa. Sometimes, they are valid for the symmetric version even without modulo ζ ( 2 ) . For example, the following reversal relations hold for both types of sums (see [23, Proposition 2.8 and 2.9]). For s = ( s 1 , , s d ) we put s = ( s d , , s 1 ) .
Proposition 2.2.(Reversal Relations) For all s N d , if d is even then
T A ( s ) = ( 1 ) | s | T A ( s ) and S A ( s ) = ( 1 ) | s | S A ( s ) ,
T S ( s ) = ( 1 ) | s | T S ( s ) and S S ( s ) = ( 1 ) | s | S S ( s ) ,
and if d is odd then
T A ( s ) = ( 1 ) | s | S A ( s ) and S A ( s ) = ( 1 ) | s | T A ( s ) ,
T S ( s ) = ( 1 ) | s | S S ( s ) and S S ( s ) = ( 1 ) | s | T S ( s ) .

3. Linear shuffle relations for finite multiple T-values (FMTVs)

One of the most important tools to study MZVs and Euler sums is to consider the double shuffle relations which are produced by two ways to express these sums: one as series by definition, the other by iterated integrals. This idea will play the key role in the following discovery of the linear shuffle relations for FMTVs and their alternating version.
The linear shuffle relations for Euler sums are given by [25, Theorem 8.4.3]. First, we extend MTVs and FMTVs to their alternating version. For all admissible ( s , σ ) N d × { ± 1 } d (i.e. ( s 1 , σ 1 ) ( 1 , 1 ) ), we define the alternating multiple T-values by
T ( s ; σ ) : = n 1 > > n d > 0 n j d j + 1 ( mod 2 ) j = 1 d σ j ( n j d + j 1 ) / 2 n j s j .
This is basically the same definition we used in [20,21] except for a possible sign difference. If we denote by T ( s ; σ ) the version in loc. cit., then
T ( s ; σ ) = T ( s ; σ ) d j 0 , 1 ( mod 4 ) σ j .
We changed to our new convention in this paper because of the significant simplification in this special case. However, the old convention is still superior to treat the general alternating multiple mixed values. Similar to the convention for Euler sums, we will save space by putting a bar on top of s j if σ j = 1 . For example,
T ( 2 ¯ , 1 ) = n > m > 0 ( 1 ) n 1 ( 2 n 2 ) 2 ( 2 m 1 ) .
In order to study the alternating MTVs, it is to our advantage to consider the alternating multiple T-functions of one variable as follows. For any real number x, define
T ( s ; σ ; x ) : = n 1 > > n d > 0 n j d j + 1 ( mod 2 ) x n 1 j = 1 d σ j ( n j d + j 1 ) / 2 n j s j .
In the non-alternating case, this function is the A-function (up to a power of 2) used by Kaneko and Tsumura in [10]. For all η 1 , , η d = ± 1 , it is then easy to evaluate the iterated integral
0 x d t t s 1 1 d t 1 η 1 t 2 d t t s d 1 d t 1 η d t 2 = k 1 > > k d > 0 x 2 ( k 1 + + k d ) + d j = 1 d η j k j ( 2 k j + 2 k j + 1 + + 2 k d + d j + 1 ) s j .
Let
y 0 = d t t , y 1 = d t 1 t 2 , y 1 : = d t 1 + t 2 .
By the change of indices n j = 2 k j + 2 k j + 1 + + 2 k d + d j + 1 we immediately get
T ( s ; σ ; x ) = 0 x p y 0 s 1 1 y σ 1 y 0 s d 1 y σ d : = 0 x y 0 s 1 1 y η 1 y 0 s d 1 y η d ,
where η j = σ 1 σ j for all j 1 and p , q represent the conversions between the series and the integral expressions of alternating MTVs:
p ( u ) : = y 0 s 1 1 y σ 1 y 0 s j 1 y σ 1 σ j y 0 s d 1 y σ 1 σ d ,
q ( u ) : = y 0 s 1 1 y σ 1 y 0 s j 1 y σ j / σ j 1 y 0 s d 1 y σ d / σ d 1 .
Namely, p pushes a word used in the series definition to a word used in the integral expression while q goes backwards. See [21] for more details.
To state the linear shuffle relations among FMTVs and their alternating version, we first quickly review the algebra setup and the corresponding results for Euler sums. Let A 1 (resp. A 2 ) be the Q -algebra of words on { x 0 , x 1 } (resp. { x 0 , x 1 , x 1 } ) with concatenation as the product. Let A j 1 ( j = 1 , 2 ) be the subalgebra generated by the words not ending with x 0 . Then for each word u = x 0 s 1 1 x η 1 x 0 s d 1 x η d A 2 1 , we define
ζ A ( u ) : = ζ A ( s 1 , , s d ; σ 1 , , σ d )
where σ 1 = η 1 and σ j = η j / η j 1 for all j 2 . Set τ ( 1 ) = 1 and
τ ( x 0 s 1 1 x 1 x 0 s d 1 x 1 ) = ( 1 ) s 1 + + s r x 0 s d 1 x 1 x 0 s 1 1 x 1 .
Theorem 3.1.
([25, Theorem 8.4.3]) For all words w , u A 1 1 , v A 2 1 , and s N , we have
(i)
ζ A ( u v ) = ζ A ( τ ( u ) v ) ,
(ii)
ζ A ( ( w u ) v ) = ζ A ( u τ ( w ) v ) ,
(iii)
ζ A ( ( x 0 s 1 x 1 u ) v ) = ( 1 ) s ζ A ( u ( x 0 s 1 x 1 v ) ) .
For alternating MTVs, we can similarly let T 1 (resp. T 2 ) be the Q -algebra of words on { y 0 , y 1 } (resp. { y 0 , y 1 , y 1 } ) with concatenation as the product. Let T j 1 ( j = 1 , 2 ) be the subalgebra generated by the words not ending with y 0 . Then for each word u = y 0 s 1 1 y σ 1 y 0 s d 1 y σ d A 2 1 , let p , q : A 2 1 A 2 1 be the two maps defined by (18) and (19). Then we can extend the definition of alternating MTVs and their corresponding one-variable functions to the word level:
F ( u ) : = F ( s ; σ ) , F ( u ) : = F q ( u ) , F ( u ) = F p ( u ) ,
where F ( ) can be either T ( ) , or T A , or T ( ; x ) or ⧢ even their partial sums such as
T n ( s ; σ ) : = n > n 1 > > n d > 0 n j d j + 1 ( mod 2 ) j = 1 d σ j ( n j d + j 1 ) / 2 n j s j .
For all words w T 2 1 we set T A ( w ) : = T A , ( w ) = T A , q ( w ) . Further, set τ ( 1 ) = 1 and
τ ( y 0 s 1 1 y 1 y 0 s d 1 y 1 ) = ( 1 ) s 1 + + s r y 0 s d 1 y 1 y 0 s 1 1 y 1 .
Theorem 3.2.
For all words w , u T 1 1 , v T 2 1 and s N , we have
(i)
T A ( u v ) = T A ( τ ( u ) v ) if dep ( u ) + dep ( v ) is even,
(ii)
T A ( ( w u ) v ) = T A ( u τ ( w ) v ) if dep ( u ) + dep ( v ) + dep ( w ) is even,
(iii)
T A ( ( y 0 s 1 y 1 u ) v ) = ( 1 ) s T A ( u ( y 0 s 1 y 1 v ) ) if dep ( u ) + dep ( v ) is odd.
Proof. 
Taking u = and then setting w = u we see that (ii) implies (i). Decomposing w into strings of the type y 0 s 1 y 1 we see that (iii) implies (ii). So we only need to prove (iii).
For simplicity, write a = y 0 and b = y 1 for the rest of this proof. Observe that for any odd prime p, the coefficient of x p of T ( s ; σ ; x ) is nontrivial if and only if dep ( s ) is odd. Therefore, if the depth d of the word w is even the coefficient of x p in T q ( b w ) ; x is given by
Coeff x p T q ( b w ) ; x = Coeff x p T b w ; x = 1 p T p , ( w )
since q ( b w ) = b q ( w ) . Observe that
b ( a s 1 b u ) v ( 1 ) s u ( a s 1 b v ) = i = 0 s 1 ( 1 ) i ( a s 1 i b u ) ( a i b v ) .
Hence, if dep ( u ) + dep ( v ) is odd, then by first applying T ( ; x ) to the above and then extracting the coefficients of x p from both sides we get
1 p T p , ( a s 1 b u ) v ( 1 ) s T p , u ( a s 1 b v ) = i = 0 s 1 ( 1 ) i Coeff x p T ( a s 1 i b u ; x ) T ( a i b v ; x ) = i = 0 s 1 ( 1 ) i j = 1 p 1 Coeff x j T ( a s 1 i b u ; t ) · Coeff x p j T ( a i b v ; t )
by the shuffle product property of iterated integrals. Now the last sum is p-integral since p j < p and j < p and therefore we get
T p , ( a s 1 b u ) v ) ( 1 ) s T p , ( u ( a s 1 b v ) ) ( mod p )
which completes the proof of (iii). □
Remark 3.3.
In [8], Jarossay showed that the corresponding results of Theorem 3.1 hold for SMZVs. Theorem 3.2, Conjecture 1.1 and Proposition 2.1 clearly imply that similar statements also hold true for SMTVs when the depth conditions are satisfied as in Theorem 3.2. However, it is possible to prove this unconditionally using the generalized Drinfeld associator Ψ 2 and consider the words of the form x 0 s 1 1 ( x 1 + x 1 ) x 0 s d 1 ( x 1 + x 1 ) in [25, Theorem 13.4.1]. The details of this work will appear in a future paper.
We can now derive a sum formula for FMTVs.
Theorem 3.4.
Suppose d N is odd. For all s 1 , , s d N we have
T A ( 1 , s ) + T A ( s , 1 ) + j = 1 d a = 1 s j + 1 T A ( s 1 , , s j 1 , a , s j + 1 a , s j + 1 , , s d ) = 0
by taking s 0 = 1 and u = 1 in Theorem 3.2(iii).
Proof. 
This follows immediately from the linear shuffle relation
T A ( y 1 y 0 s 1 1 y 1 y 0 s d 1 y 1 ) = T A ( y 1 y 0 s 1 1 y 1 y 0 s d 1 y 1 ) .
The following conjecture is supported by all k 9 numerically.
Conjecture 3.5.
For all k N we have
T A ( 2 , { 1 } k ) = ( 1 ) k 2 k 1 T A ( 1 , k + 1 ) , T S ( { 1 } w ) = ( 1 ) k 2 k 1 T S ( 1 , k + 1 ) .
Proposition 3.6.
If k is odd then for all k we have
T A ( { 1 } , 2 , { 1 } k ) = ( 1 ) + 1 k + 1 T A ( 2 , { 1 } k ) .
If in addition we assume Conjecture 3.5 holds then
T A ( { 1 } , 2 , { 1 } k ) = ( 1 ) + k 2 k 1 ( + 1 ) k + 1 T A ( 1 , k + 1 ) .
Proof. 
For all k , by linear shuffle relations
T A ( y 1 y 1 y 0 y 1 k ) = y 1 + 1 y 0 y 1 k .
Thus, setting a = T A ( { 1 } , 2 , { 1 } k ) we get
( + 2 ) a + 1 + ( k + 1 ) a = 0 .
Hence
a + 1 = k + 1 + 2 a = ( k + 1 ) ( k + 2 ) ( + 2 ) ( + 1 ) a 1 = = ( 1 ) 1 ( k + 1 ) ( k + 2 ) ( k + 1 ) ( + 2 ) ( + 1 ) 2 a 0 = ( 1 ) 1 ( k + 1 ) ! ( + 2 ) ! ( k ) ! a 0 = ( 1 ) 1 + 2 k + 1 + 1 a 0 ,
which yields (20). Then (21) follows immediately if we assume Conjecture 3.5. □

3.1. Values at small depths/weights

First we observe that since ζ A ( s ) = 0 for all s N , by [25, Theorem 8.2.7],
S A ( s ) = T A ( s ) = 1 2 ζ A ( s ¯ ) = q 2 , if s = 1 ; ( 2 1 s 1 ) β s , if s 2 ,
where q 2 is the Fermat quotient (8) and β s is given by (6). Further, in depth two, by [23, Proposition 2.6] we see that for all a , b N , if w = a + b is odd then
S A ( a , b ) = T A ( a , b ) = ( 1 ) a 2 1 2 w w a β w .
The depth three case is already complicated and we do not have a general formula. This is expected since such formula does not exist for FMZVs. In the rest of this section we will deal with some special cases.
Next, we prove a proposition which improves a result Tauraso and the author obtained more than a decade ago, by applying the newly discovered linear shuffle relations above.
Proposition 3.7.
We have
ζ A ( 1 , 1 , 1 ) = 0 , ζ A ( 1 ¯ , 1 ¯ , 1 ¯ ) = 4 3 q p 3 β 3 2 , ζ A ( 1 , 1 , 1 ¯ ) = ζ A ( 1 ¯ , 1 , 1 ) = q 3 3 7 8 β 3 , ζ A ( 1 ¯ , 1 , 1 ¯ ) = 0 , ζ A ( 1 , 1 ¯ , 1 ) = 2 q 3 3 + β 3 4 , ζ A ( 1 ¯ , 1 ¯ , 1 ) = ζ A ( 1 , 1 ¯ , 1 ¯ ) = q p 3 21 8 β 3 .
Proof. 
It follows immediately from [18, Proposition 7.3 and Proposition 7.6] that
ζ A ( 1 ¯ , 1 ¯ , 1 ¯ ) = 4 3 q p 3 1 2 β 3 , ζ A ( 1 , 1 ¯ , 1 ) = 2 ζ A ( 1 ¯ , 1 , 1 ) 3 2 β 3 , ζ A ( 1 ¯ , 1 , 1 ¯ ) = 0 , ζ A ( 1 , 1 , 1 ¯ ) = ζ A ( 1 ¯ , 1 , 1 ) , ζ A ( 1 ¯ , 1 ¯ , 1 ) = ζ A ( 1 , 1 ¯ , 1 ¯ ) = q p 3 21 8 β 3 .
By the linear shuffle relations for finite Euler sums we have
ζ A ( b c c ) = ζ A ( b c c ) = ζ A ( b c c ) + ζ A ( c b c ) + ζ A ( c c b )
which readily yields the identity
2 ζ A ( 1 , 1 ¯ , 1 ) + ζ A ( 1 ¯ , 1 ¯ , 1 ¯ ) + ζ A ( 1 ¯ , 1 , 1 ¯ ) = 0 .
This quickly implies all the evaluations in the proposition. □
Corollary 3.8.
We have
T A ( 1 , 1 , 1 ) = S A ( 1 , 1 , 1 ) = 3 16 β 3 .
Proof. 
The corollary is an immediate consequence by the definitions using Proposition 3.7. Or we can prove it directly as follows. Since ζ A ( 1 , 1 ¯ , 1 ¯ ) = ζ A ( 1 ¯ , 1 ¯ , 1 ) by reversal and ζ A ( 1 , 1 , 1 ) = 0 we get
8 T A ( 1 , 1 , 1 ) = ζ A ( 1 ¯ , 1 , 1 ¯ ) + ζ A ( 1 ¯ , 1 ¯ , 1 ¯ ) + ζ A ( 1 , 1 ¯ , 1 ) ζ A ( 1 , 1 , 1 ¯ ) ζ A ( 1 ¯ , 1 , 1 ) = ζ A ( 1 , 1 ¯ , 1 ) 2 ζ A ( 1 , 1 , 1 ¯ ) ( by ( 24 ) ) = ζ A ( 2 ¯ , 1 ) + ζ A ( 1 ¯ , 2 ) ζ A ( 1 ) ζ A ( 1 , 1 ¯ ) ( by stuffle ) = 3 2 β 3 .
by [25, Theorem 8.6.4]. □
Proposition 3.9.
We have
T S ( 1 , 1 , 1 ) = S S ( 1 , 1 , 1 ) = 3 16 ζ ( 3 ) .
Proof. 
The weight three Euler sums are all expressible in terms of ζ ( 2 ¯ , 1 ) , ζ ( 1 ¯ , 1 , 1 ) and ζ ( 1 ¯ , 2 ) by [25, Proposition 14.2.7]. Hence one easily deduces that
ζ S ( 1 , 1 , 1 ) = ζ S ( 1 ¯ , 1 , 1 ¯ ) = 0 , ζ S ( 1 ¯ , 1 , 1 ) = ζ S ( 1 , 1 , 1 ¯ ) = ζ ( 1 ¯ , 1 , 1 ) + ζ ( 1 ¯ ) ζ ( 1 , 1 ) ζ ( 1 , 1 ¯ ) ζ ( 1 ) + ζ ( 1 , 1 , 1 ¯ ) = ζ ( 1 ¯ , 1 , 1 ) + ζ ( 1 ¯ ) T 2 2 ζ ( 1 ¯ ) T ζ ( 1 ¯ , 1 ¯ ) T + ζ ( 1 ¯ ) T 2 2 ζ ( 1 ¯ , 1 ¯ ) T + ζ ( 1 ¯ , 1 ¯ , 1 ) = ζ ( 1 ¯ , 1 , 1 ) + ζ ( 1 ¯ , 1 ¯ , 1 ) , ζ S ( 1 ¯ , 1 ¯ , 1 ) = ζ S ( 1 , 1 ¯ , 1 ¯ ) = 3 ζ ( 1 ¯ , 1 ¯ , 1 ) + 3 ζ ( 1 ¯ , 1 , 1 ) , ζ S ( 1 , 1 ¯ , 1 ) = 2 ζ ( 1 , 1 ¯ , 1 ) 2 ζ ( 1 ¯ , 1 ) ζ ( 1 ) = 2 ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) 2 ζ ( 1 ¯ , 1 , 1 ¯ ) , ζ S ( 1 ¯ , 1 ¯ , 1 ¯ ) = 2 ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) + 2 ζ ( 1 ¯ ) ζ ( 1 ¯ , 1 ¯ ) = 4 ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) + 4 ζ ( 1 ¯ , 1 , 1 ¯ ) .
By [25, Proposition 14.2.7]
ζ ( 3 ) = 8 ζ ( 2 ¯ , 1 ) , ζ ( 1 ¯ , 1 ¯ , 1 ) = ζ ( 1 ¯ , 2 ) 5 ζ ( 2 ¯ , 1 ) + ζ ( 1 ¯ , 1 , 1 ) , ζ ( 1 ¯ , 1 , 1 ¯ ) = ζ ( 2 ¯ , 1 ) + ζ ( 1 ¯ , 1 , 1 ) , ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) = ζ ( 1 ¯ , 2 ) + ζ ( 1 ¯ , 1 , 1 ) .
Thus, we get
T S ( 1 , 1 , 1 ) = 1 4 ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) + ζ ( 1 ¯ , 1 , 1 ¯ ) ζ ( 1 ¯ , 1 , 1 ) ζ ( 1 ¯ , 1 ¯ , 1 ) = 6 4 ζ ( 2 ¯ , 1 ) = 3 16 ζ ( 3 ) , S S ( 1 , 1 , 1 ) = 1 4 ζ ( 1 ¯ , 1 ¯ , 1 ¯ ) + ζ ( 1 ¯ , 1 , 1 ¯ ) ζ ( 1 ¯ , 1 , 1 ) ζ ( 1 ¯ , 1 ¯ , 1 ) = 3 16 ζ ( 3 ) ,
as desired. □
Turning to the finite Euler sums in general, we can use linear shuffles to derive many relations. For examples,
b a c b : 2 ζ A ( 1 , 2 ¯ , 1 ¯ ) + ζ A ( 2 , 1 ¯ , 1 ¯ ) + 2 ζ A ( 2 ¯ , 1 ¯ , 1 ) = 0 , b a c c : 2 ζ A ( 1 , 2 ¯ , 1 ) + ζ A ( 2 , 1 ¯ , 1 ) + ζ A ( 2 ¯ , 1 ¯ , 1 ¯ ) + ζ A ( 2 ¯ , 1 , 1 ¯ ) = 0 , a b b c : 3 ζ A ( 2 , 1 , 1 ¯ ) + ζ A ( 2 , 1 ¯ , 1 ¯ ) + ζ A ( 1 , 2 ¯ , 1 ¯ ) + ζ A ( 1 , 2 , 1 ¯ ) + ζ A ( 1 , 1 ¯ , 2 ¯ ) = 0 , a b c b : 2 ζ A ( 2 , 1 ¯ , 1 ¯ ) + 2 ζ A ( 2 ¯ , 1 ¯ , 1 ) + 2 ζ A ( 1 ¯ , 2 ¯ , 1 ) + ζ A ( 1 ¯ , 1 ¯ , 2 ) = 0 , a b c c : 2 ζ A ( 2 , 1 ¯ , 1 ) + ζ A ( 2 ¯ , 1 ¯ , 1 ¯ ) + ζ A ( 2 ¯ , 1 , 1 ¯ ) + ζ A ( 1 ¯ , 2 ¯ , 1 ¯ ) + ζ A ( 1 ¯ , 2 , 1 ¯ ) + ζ A ( 1 ¯ , 1 , 2 ¯ ) = 0 , b b a c 2 : 3 ζ A ( 1 , 1 , 2 ¯ , 1 ) + ζ A ( 1 , 2 , 1 ¯ , 1 ) + ζ A ( 1 , 2 ¯ , 1 ¯ , 1 ¯ ) + ζ A ( 1 , 2 ¯ , 1 , 1 ¯ ) = 0 , b c 4 : 2 ζ A ( 1 , 1 ¯ , 1 3 ) + ζ A ( 1 ¯ 3 , 1 , 1 ) + ζ A ( 1 ¯ , 1 , 1 ¯ 2 , 1 ) + ζ A ( 1 ¯ , 1 2 , 1 ¯ 2 ) + ζ A ( 1 ¯ , 1 3 , 1 ¯ ) = 0 .
We can also use reversal and stuffle relations to express all finite Euler sums of weight up to 6 by explicitly given basis in each weight. Aided by Maple computation we arrive at the following main theorem on the structure of finite Euler sums of lower weight.
Theorem 3.10.
Let FES w be the Q -vector space generated by finite Euler sums of weight w. Then we have the following generating sets for w < 7 :
FES 1 = q 2 , FES 2 = q 2 2 , FES 3 = q 2 3 , β 3 , FES 4 = q 2 4 , q 2 β 3 , ζ A ( 1 , 3 ¯ ) , FES 5 = q 2 5 , q 2 2 β 3 , β 5 , ζ A ( 1 ¯ , 2 , 2 ) , ζ A ( 1 ¯ , 2 ¯ , 2 ) , FES 6 = q 2 6 , q 2 3 β 3 , β 3 2 , q 2 β 5 , ζ A ( 1 ¯ , 1 , 2 , 2 ) , ζ A ( 1 ¯ , 2 , 2 , 1 ) , ζ A ( 1 ¯ , 2 , 1 , 2 ) , ζ A ( 1 ¯ , { 1 } 3 , 2 ) .
Let { F k } k 0 be the Fibonnacci sequence defined by F 0 = F 1 = 1 and F k = F k 1 + F k 2 for all k 2 . Then Theorem 3.10 provides strong support for the next conjecture.
Conjecture 3.11.
For every positive integer w the Q -space FES w has the following basis:
ζ A ( 1 ¯ , b 2 , , b d ) : d 0 , b j = 1 o r 2 , 1 + b 2 + + b d = w .
Consequently, dim Q FES w = F w 1 for all w 1 .
One may compare to this to the conjecture on the ordinary Euler sums proposed by Zlobin [25, Conjecture 14.2.3]
Conjecture 3.12.
For every positive integer w the Q -space ES w has the following basis:
ζ ( b 1 ¯ , b 2 , , b d ) : d 1 , b j = 1 o r 2 , b 1 + b 2 + + b d = w .
Consequently, dim Q ES w = F w for all w 1 .
Theorem 3.10 implies that the set in Conjecture 3.11 is a generating set for all w < 7 since
ζ A ( 1 ¯ , 1 ) = 2 q 2 , ζ A ( 1 ¯ , 1 ) = q 2 2 , ζ A ( 1 ¯ , 2 ) = 3 4 β 3 , ζ ( [ 1 , 1 ¯ , 1 ) = 2 4 q 2 3 + 1 4 β 3 , ζ A ( 1 ¯ , 1 , 2 ) = 9 4 q 2 β 3 ζ A ( 1 , 3 ¯ ) , ζ A ( 1 ¯ , { 1 } 3 ) = 1 12 q 2 4 + 7 8 q 2 β 3 + 1 4 ζ A ( 1 , 3 ¯ ) , ζ A ( 1 ¯ , 2 , 1 ) = 1 2 ζ A ( 1 , 3 ¯ ) 12 4 q 2 β 3 , ζ A ( 1 ¯ , 2 , 1 , 1 ) = 695 128 β 5 5 4 ζ A ( 1 ¯ , 2 , 2 ) 2 ζ A ( 1 ¯ , 1 , 1 , 2 ) 9 4 q 2 2 β 3 , ζ A ( { ¯ 1 } 4 , 1 ) = 1 60 q 2 5 23 24 q 2 2 β 3 1 8 ζ A ( 1 ¯ , 2 , 2 ) 1 2 ζ A ( 1 ¯ , 1 , 1 , 2 ) 25 256 β 5 , ζ A ( 1 ¯ , 1 , 2 , 1 ) = 33 8 q 2 2 β 3 555 128 β 5 + 5 4 ζ A ( 1 ¯ , 2 , 2 ) + 2 ζ A ( 1 ¯ , 1 , 1 , 2 ) , ζ A ( 1 ¯ , 1 , 2 , 1 , 1 ) = 1 2 A + 2 B + C + D + 9 4 β 3 2 + 5 8 q 2 3 β 3 + 205 64 q 2 β 5 , ζ A ( { ¯ 1 } 4 , 2 ) = 3 4 A + 19 8 B + 1 4 C + D + 201 32 β 3 2 + q 2 3 β 3 645 256 q 2 β 5 , ζ A ( 1 ¯ , 2 , { 1 } 3 ) = 1 2 A 19 8 B 5 4 C 2 D 1113 256 β 3 2 5 4 q 2 3 β 3 1685 256 q 2 β 5 , ζ A ( 1 ¯ , { 1 } 5 ) = 1 4 A 13 16 B 1 8 C 1 2 D 1 6 q 2 3 β 3 + 817 512 q 2 β 5 811 512 β 3 2 + 1 360 q 2 6 ,
where A = ζ A ( 1 ¯ , 1 , 2 , 2 ) , B = ζ A ( 1 ¯ , 2 , 1 , 2 ) , C = ζ A ( 1 ¯ , 2 , 1 , 2 ) , and D = ζ A ( 1 ¯ , 2 , 2 , 1 ) .
Using the evaluations of finite Euler sums, we can find all FMTVs of weight less than 7. For example, we have
T A ( 1 , 1 , 2 ) = 1 8 ζ A ( 1 , 3 ¯ ) 21 16 q 2 β 3 , T A ( 1 , 2 , 2 ) = 1605 256 β 5 + 9 2 q 2 2 β 3 + 3 ζ A ( 1 ¯ , 1 , 1 , 2 ) .
We then have the following structural theorem for these FMTVs.
Theorem 3.13.
Let FMT w be the Q -vector space generated by FMTVs of weight w. Then we have the following generating sets for w < 7 :
FMT 1 = q 2 , FMT 2 = 0 , FMT 3 = β 3 , FMT 4 = q 2 β 3 , ζ A ( 1 , 3 ¯ ) , FMT 5 = β 5 , ζ A ( 1 ¯ , 2 , 2 ) , ζ A ( 1 ¯ , 1 , 1 , 2 ) , FMT 6 = β 3 2 , q 2 β 5 , ζ A ( 1 ¯ , 2 , 1 , 2 ) .
Moreover, by using numerical computation aided by Maple (see [25, Appendix D] for the pseudo codes) we can find a generating set of FMT w for every w 13 . We will list the corresponding dimensions at the end of this paper.

3.2. Homogeneous cases

In this subsection, we will compute finite Euler sums ζ ( s ) when s is homogeneous, i.e., s = ( { s } d ) for some s D . Then we will consider the corresponding results for FMTVs.
Proposition 3.14.
Let N odd be the set of odd positive integers. For any d , s N , we have
ζ A ( { s ¯ } d ) k 0 N , k 1 , , k N odd δ s , 1 k 0 + k 1 + + k = d q 2 δ s , 1 k 0 β s k j β s k j Q ,
where δ s , 1 is the Kronecker symbol. In particular, ζ A ( { s ¯ } d ) = 0 for all even s.
Proof. 
Let Π = ( P 1 , , P ) [ d ] denote any partition of ( 1 , , d ) into odd parts, i.e., all of | P j | ’s are odd numbers, where | P j | is the cardinality of the set P j . Put
C ( Π ) = ( 1 ) d ( | P 1 | 1 ) ! ( | P | 1 ) ! .
Observe that ζ A ( n ¯ ) = ζ A ( n ) = 0 if n is even. Then it follows easily from [4, (18)] that
ζ A ( s ¯ ) = Π = ( P 1 , , P ) [ d ] C ( Π ) ζ A s | P 1 | ¯ ζ A s | P | ¯ .
The proposition follows from (22) immediately. □
Example 3.15.
There are following ways to partition 6 elements, say { a 1 , , a 6 } into odd parts: one way to get ( { 1 } 6 ) , 6 5 ways to get ( 1 , 5 ) (e.g. { a 2 } , { a 1 , a 3 , , a 6 } ), 6 3 / 2 ways to get ( 3 , 3 ) , and 6 3 ways to get ( 1 , 1 , 1 , 3 ) . Hence,
ζ A ( { 1 ¯ } 6 ) = 4 45 q 2 6 + 3 4 q 2 β 5 + 1 8 β 3 2 + 2 3 q 2 3 β 3
by using the formula in (22). We would like to point out that the term 3 q p B p 5 / 20 (corresponding to the second term 3 4 q 2 β 5 on the right-hand side above) was accidentally dropped from the right-hand side of [18, (36)].
One may compare the next corollary to the well-known result that ζ A ( { 1 } d ) = 0 for all d N (see, e.g., [25, Theorem 8.5.1]).
Proposition 3.16.
For all d N we have
T A ( { 1 } 2 d ) = 0 .
Proof. 
Taking s = ( { 1 } 2 d 1 ) in Theorem 3.4 yields the proposition at once. □
We now derive the symmetric MTV version of Proposition 3.16.
Proposition 3.17.
For all d N we have
T S ( { 1 } 2 d ) = 0 .
Proof. 
For any N we have the relation for the regularized value (see, e.g., [7])
0 ε d t 1 t 2 = 1 ! 0 ε d t 1 t 2 = 1 ! 1 2 0 ε d t 1 t + d t 1 + t .
This implies that
T ( { 1 } ) = 1 ! 2 ζ ( 1 ) + log 2 .
By the definition,
T S ( { 1 } 2 d ) = i = 0 2 d ( 1 ) i T ( { 1 } i ) T ( { 1 } 2 d i ) = 1 2 2 d i = 0 2 d ( 1 ) i ! ( 2 d ) ! ζ ( 1 ) + log 2 2 d = 0
as desired. □
By extensive numerical experiments, we found the following relations must be valid.
Conjecture 3.18.
For all odd w N we have
T A ( { 1 } w ) = S A ( { 1 } w ) = 2 w 1 1 2 2 w 2 β w , T S ( { 1 } w ) = S S ( { 1 } w ) = 2 w 1 1 2 2 w 2 ζ ( w ) .
The conjecture holds when w = 3 by Corollary 3.8 and Proposition 3.9. Aided by Maple, we can also rigorously prove the conjecture for w = 5 and w = 7 by using tables of values of finite Euler sums produced by reversal, stuffle and linear shuffle relations, and the table of values for Euler sums available online [1].
Moreover, Conjecture 3.18 still holds true for T A ( { 1 } w ) = T S ( { 1 } w ) = 0 when w is even because of Propositions 3.16 and 3.17. But for S-values, we have another conjecture.
Conjecture 3.19.
For all even w N , there are rational numbers c j Q , 1 j w / 2 , such that
S A ( { 1 } w ) = j = 1 w / 2 c j S A ( j , w j ) , S S ( { 1 } w ) = j = 1 w / 2 c j S S ( j , w j ) .
Moreover, S A ( j , w j ) , 1 j w / 2 , are Q -linearly independent, and S S ( j , w j ) , 1 j w / 2 , are Q -linearly independent.
Note that S A ( j , w j ) A while S S ( j , w j ) are all real numbers.

4. Alternating multiple T-values

We now turn to the alternating version of MTVs and derive some relations among them. These values are intimately related to the colored MZVs of level 4 (i.e., multiple polylogarithms evaluated at 4th roots of unity). We refer the interested reader to [19,20] for the fundamental results concerning these values.
Recall that for any ( s , σ ) N d × { ± 1 } d , we have defined the finite alternating multiple T-values by
T ( s ; σ ) : = p > n 1 > > n d > 0 n j d j + 1 ( mod 2 ) j = 1 d σ j ( n j d + j 1 ) / 2 n j s j p P A .
We have seen from Theorem 3.2 in Section 3 that these values satisfy the linear shuffle relations. It is also not hard to get the reversal relations when the depth is even, as shown below.
Proposition 4.1.(Reversal Relations of finite alternating MTVs) Let s N d for some even d N . Then
T A ( s , σ ) = ( σ 1 , , σ d ) ( p 1 d ) / 2 ( 1 ) | s | T A ( s , σ ) ,
where the element ( 1 ) ( p 1 d ) / 2 = ( 1 ) ( p 1 d ) / 2 ( mod p ) 3 P A .
Proof. 
Let p be an odd prime. Then by change of indices n j p n j we get
T p ( s , σ ) : = p > n 1 > > n d > 0 n j d j + 1 ( mod 2 ) j = 1 d σ j ( n j d + j 1 ) / 2 n j s j ( 1 ) | s | p > n d > > n 1 > 0 p n j d j + 1 ( mod 2 ) j = 1 d σ j ( n j p + d j + 1 ) / 2 n j s j ( mod p ) .
Let t j = s d + 1 j , ε j = σ d + 1 j , and k j = n d + 1 j . Then we get by the change of indices j d + 1 j (since d is even)
T p ( s , σ ) ( 1 ) | s | p > n 1 > > n d > p k j j ( mod 2 ) j = 1 d ε j ( k j p + j ) / 2 k j t j ( 1 ) | s | p > n 1 > > n d > p k j j ( mod 2 ) ( σ 1 σ d ) ( d p + 1 ) / 2 j = 1 d ε j ( k j d + j 1 ) / 2 k j t j ( σ 1 σ d ) ( d p + 1 ) / 2 ( 1 ) | s | p > k 1 > > k d > k j d j + 1 ( mod 2 ) j = 1 d ε j ( k j d + j 1 ) / 2 k j t j ( σ 1 σ d ) ( d p + 1 ) / 2 ( 1 ) | s | T p ( t , ε ) ( σ 1 σ d ) ( d p + 1 ) / 2 ( 1 ) | s | T p ( s , σ )
as desired. □
It should be clear to the attentive reader that T-values are always intimately related to the S-values when the depth is odd because of the reversal relations. Even though we did not consider this in the above, it plays the key role in the proof of the next result.
Proposition 4.2.
Let q 2 ( p ) = ( 2 p 1 1 ) / 2 for all p > 2 . Then we have
S A ( 1 ¯ ) = q 2 / 2 , T A ( 1 ¯ ) = ( 1 ) p 1 2 q 2 ( p ) / 2 ( mod p ) p > 2 A .
Proof. 
Recall that
S p ( 1 ) : = p > k > 0 , 2 | k 1 k , S p ( 1 ¯ ) : = p > k > 0 , 2 | k ( 1 ) k / 2 k .
By [17, Theorem 3.2] we see that
S p ( 1 ) + S p ( 1 ¯ ) = p > k > 0 , 2 | k 1 k + ( 1 ) k / 2 k = p > k > 0 , 4 | k 2 k 3 2 q p ( 2 ) ( mod p ) .
Since S p ( 1 ) = ζ p ( 1 ¯ ) / 2 = q p ( 2 ) we see immediately that S A ( 1 ¯ ) = q 2 / 2 . Taking reversal, we get
T p ( 1 ¯ ) = p > k > 0 , 2 k ( 1 ) ( k 1 ) / 2 k = p > k > 0 , 2 | k ( 1 ) ( p k 1 ) / 2 p k ( 1 ) p 1 2 S p ( 1 ¯ ) ( 1 ) p 1 2 q p ( 2 ) 2 ( mod p ) ,
as desired. □
As we analyzed on [25, p. 239], there is an overwhelming evidence that q 2 0 in A . In [15, Theorem 1], Silverman even showed that, if abc-conjecture holds then
| p X : q 2 ( p ) 0 ( mod p ) | = O ( log ( X ) ) as X .
In fact we are sure the following conjecture is true.
Conjecture 4.3.
For every pair of positive integers m > a > 0 , gcd ( m , a ) = 1 , there are infinitely many primes p a ( mod m ) such that q2 (p) Preprints 99337 i001 0 (mod p).
Theorem 4.4.
If Conjecture 4.3 holds for m = 4 , then T A ( 1 ) and T A ( 1 ¯ ) are Q -linearly independent.
Proof. 
If c 1 T A ( 1 ) + c 2 T A ( 1 ¯ ) = 0 in A for some c 1 , c 2 Q , then by Proposition 4.2 we see that ( c 1 + c 2 ) q p ( 2 ) 0 ( mod p ) for infinitely many primes p 1 ( mod 4 ) . If Conjecture 4.3 holds form m = 4 then c 1 + c 2 0 ( mod p ) for infinitely many primes p 1 ( mod 4 ) . This would force c 1 + c 2 = 0 . Similar consideration for primes p 3 ( mod 4 ) implies that c 1 c 2 = 0 . Hence, we must have c 1 = c 2 = 0 which shows that T A ( 1 ) and T A ( 1 ¯ ) are Q -linearly independent. □
Define the finite Catalan’s constant by
G A : = E p 3 2 3 < p P A .
Proposition 4.5.
Let FAT w be the vector space generated by finite alternating MTVs over Q . We have the following generating sets of FAT w for w < 3 :
FAT 1 = q 2 , ( 1 ) p q 2 , FAT 2 = G A , ( 1 ) p G A .
Proof. 
The w = 1 case is trivial. For w = 2 , we already know T A ( 1 , 1 ) = T A ( 2 ) = 0 by Theorem 3.13. Let a = y 0 , b = y 1 and c = y 1 in the rest of the proof. For alternating values, we first have the linear shuffle relation
T A ( b c ) = T A ( b c ) 2 T A ( b c ) + T A ( c b ) 2 T A ( 1 , 1 ¯ ) + T A ( 1 ¯ , 1 ¯ ) = 0 .
By complicated computation (see [23, Proposition 4.4] and notice (16)) we have the additional relation
T A ( 2 ¯ ) = G A = 2 T A ( 1 , 1 ¯ ) .
Then by the reversal relation (26) we see easily that T A ( 1 ¯ , 1 ) = ( 1 ) p T A ( 1 , 1 ¯ ) . This completes the proof of the proposition. □

5. Dimensions of FMT and AT

We first need to point out that it is possible to study the alternating MTVs by converting them to colored MZVs of level 4 and then applying the setup in [16]. For example,
T ( 2 ¯ , 3 ¯ ) = n 1 > n 2 > 0 ( 1 ) n 1 2 ( 1 ) n 2 1 ( 2 n 1 2 ) 2 ( 2 n 2 1 ) 3 = k 1 > k 2 > 0 i k 1 ( 1 + ( 1 ) k 1 ) i k 2 1 ( 1 ( 1 ) k 2 ) k 1 2 k 2 3 = i L i 2 , 3 ( i , i ) + L i 2 , 3 ( i , i ) L i 2 , 3 ( i , i ) L i 2 , 3 ( i , i ) .
The caveat is that we need to extend our scalars to Q [ i ] in general. At the end of [16] we observed that dim Q FCMZ w 4 2 w for all w 1 , where FCMZ w 4 is the space spanned by all colored MVZ of level 4 and weight w over Q . By the following, we expect that the
dim Q FAT w dim Q FAM w 2 w ,
where FAM is the space spanned by all the finite multiple mixed values. Here, according to [19], the multiple mixed values means we allow all possible even/odd combinations in the definition of such series instead of a fixed pattern such as that has appeared in MTVs and MSVs).
Conjecture-Principle-Philosophy 5.1. 
Let S be a set of colored MZVs (including MZVs and Euler sums) or (alternating) multiple mixed valuess (or their variations/analogs such as finite, symmetric, interpolated versions etc.) Then the following statements should hold.
(1)
Suppose all elements in S have the same weight. If they are linearly independent over Q , then they are algebraically independent over Q .
(2)
If the weights of the values in S are all different then the values are linearly independent over Q (but of course may not be algebraically independent over Q ).
(3)
If there is only one nonzero element in S, then it is transcendental over Q .
For example, we expect that ζ ( n ) ’s are not only irrational but also transcendental for all n 2 . We also expect that q 2 and β k are transcendental for all odd k 3 , and are all algebraically independent over Q
Recall that MT w (resp. FMT w ) is the Q -vector space generated by MTVs (resp. finite MTVs) of weight w. Similarly, we denote by AT (resp. FAT ) the space generated by alternating MTVs (resp. finite alternating MTVs) of weight w. From numerical computation, we conjecture the following upper bounds for the dimensions of FMT w and FAT w . To compare to the classical case, we tabulate the results together.
Table 1. Conjectural Dimensions of FMT , FAT , MT , AT , and FAM .
Table 1. Conjectural Dimensions of FMT , FAT , MT , AT , and FAM .
w 0 1 2 3 4 5 6 7 8 9 10 11 12 13
FMT w 0 1 0 1 2 3 3 6 9 15 17 32 44 76
MT w 1 0 1 1 2 2 4 5 9 10 19 23 42 49
FAT w 0 2 2 6 12 20 40 76
AT w 0 1 2 4 7 13 24 44 81
FAM w 0 1 2 4 8 16
With strong numerical support, Xu and the author conjecture that { dim Q AT w } w 1 form the tribonacci sequence (see [20]). For MTVs, Kaneko and Tsumura conjecture that, for all k 1
dim Q MT 2 k = dim Q MT 2 k 1 + dim Q MT 2 k 2 .
See [10, p. 216]. From numerical computation we can formulate its finite analog as follows.
Conjecture 5.2.
For all k 1 ,
dim Q FMT 2 k + 1 = dim Q FMT 2 k + dim Q FMT 2 k 1 .

Acknowledgments

The author is supported by the Jacobs Prize from The Bishop’s School.

References

  1. J. Blümlein, D.J. Broadhurst and J.A.M. Vermaseren, The multiple zeta value data mine. Comput. Phys. Commun. 2010, 181, 582–625. [CrossRef]
  2. F. Brown, S. Carr, and L. Schneps, Algebra of cell-zeta values. Compositio Math. 2010, 146, 731–771, arXiv:0910.0122.. [CrossRef]
  3. M.E. Hoffman, Multiple harmonic series. Pacific J. Math. 1992, 152, 275–290. [CrossRef]
  4. M.E. Hoffman, The Hopf algebra structure of multiple harmonic sums. Nuclear Phys. B (Proc. Suppl.) 2004, 135, 214–219.
  5. M.E. Hoffman, Quasi-symmetric functions and mod p multiple harmonic sums. Kyushu J. Math. 2015, 69, 345–366. [CrossRef]
  6. M.E. Hoffman, An odd variant of multiple zeta values. Commun. Number Theory Phys. 2019, 13, 529–567. [CrossRef]
  7. K. Ihara, M. Kaneko and D. Zagier, Derivation and double shuffle relations for multiple zeta values. Compos. Math. 2006, 142, 307–338. [CrossRef]
  8. D. Jarossay, Double mélange des multizêtas finis et multizêtas symétrisés (in French). C. R. Acad. Sci. Paris, Ser. I 2014, 352, 767–771. [CrossRef]
  9. M. Kaneko, T. Murakami, and A. Yoshihara, On finite multiple zeta values of level two. Pure Appl. Math Quarterly 2023, 19, 267–280. [CrossRef]
  10. M. Kaneko and H. Tsumura, On multiple zeta values of level two. Tsukuba J. Math. 2020, 44, 213–234.
  11. M. Kaneko and D. Zagier, Finite multiple zeta values, in preparation.
  12. H. Murahara and S. Saito, Restricted sum formula for finite and symmetric multiple zeta values. Pacific J. Math. 2019, 303, 325–335. [CrossRef]
  13. S. Saito and N. Wakabayashi, Sum formula for finite multiple zeta values. J. Math. Soc. Japan 2015, 67, 1069–1076.
  14. K. Sakurada, Duality for finite/symmetric multiple zeta values of fixed weight, depth, and height. Int. J. Number Theory 2023, 19, 2299–2307. [CrossRef]
  15. J. H. Silverman, Wieferich’s criterion and the abc-conjecture. J. Number Theory 1988, 30, 226–237. [CrossRef]
  16. J. Singer and J. Zhao, Finite and symmetrized colored multiple zeta values. Finite Fields and Their Applications 2020, 65. [CrossRef]
  17. Z.-W. Sun, Congruences involving Bernoulli and Euler numbers. J. Number Thy. 2008, 128, 280–312. [CrossRef]
  18. R. Tauraso and J. Zhao, Congruences of alternating multiple harmonic sums. J. Comb. Number Theory 2010, 2, 129–159.
  19. C. Xu and J. Zhao, Variants of multiple zeta values with even and odd summation indices. Math. Zeit. 2022, 300, 3109–3142. [CrossRef]
  20. C. Xu and J. Zhao, Alternating multiple T-values: weighted sums, duality, and dimension conjecture. Ramanujan J. Math. 2024, 63, 13–54. [CrossRef]
  21. C. Xu, L. Yan and J. Zhao, Alternating multiple mixed values, regularization, parity and dimension conjecture. arXiv:2208.09593.
  22. S. Yamamoto, Interpolation of multiple zeta and zeta-star values. J. Algebra 2013, 385, 102–114. [CrossRef]
  23. J. Zhao, Finite multiple mixed values (with an Appendix by. Jeremy Feng, Angelina Kim, Sienna Li, Ryan Qin, Logan Wang and J. Zhao). arXiv:2402.08160.
  24. J. Zhao, Wolstenholme type Theorem for multiple harmonic sums. Intl. J. of Number Theory 2008, 4, 73–106. [CrossRef]
  25. J. Zhao, Multiple Zeta Functions. In Multiple Polylogarithms and Their Special Values; 620 pp.; Series on Number Theory and Its Applications; Volume 12, World Scientific Publishing, 2016.
  26. D. Zagier, Values of zeta functions and their applications. In First European Congress of Mathematics; (Paris, 1992), Vol. II, A. Joseph et al. Eds.; Birkhäuser: Basel, 1994; pp. 497–512.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated