In mathematics, the multiple zeta functions are generalizations of the Riemann zeta function, defined by
 and converge when Re(s1) + ... + Re(si) > i for all i. Like the Riemann zeta function, the multiple zeta functions can be analytically continued to be meromorphic functions (see, for example, Zhao  (1999)). When s1, ..., sk are all positive integers (with s1 > 1) these sums are often called multiple zeta values (MZVs) or Euler sums. These values can also be regarded as special values of the multiple polylogarithms.
 The k in the above definition is named the "depth" of a MZV, and the n = s1 + ... + sk is known as the "weight".
 The standard shorthand for writing multiple zeta functions is to place repeating strings of the argument within braces and use a superscript to indicate the number of repetitions. For example,
 Multiple zeta functions arise as special cases of the multiple polylogarithms
 which are generalizations of the polylogarithm functions. When all of the 
  
    
      
        
          μ
          
            i
          
        
      
    
    {\displaystyle \mu _{i}}
  
 are nth roots of unity and the 
  
    
      
        
          s
          
            i
          
        
      
    
    {\displaystyle s_{i}}
  
 are all nonnegative integers, the values of the multiple polylogarithm are called colored multiple zeta values of level 
  
    
      
        n
      
    
    {\displaystyle n}
  
. In particular, when 
  
    
      
        n
        =
        2
      
    
    {\displaystyle n=2}
  
, they are called Euler sums or alternating multiple zeta values, and when 
  
    
      
        n
        =
        1
      
    
    {\displaystyle n=1}
  
 they are simply called multiple zeta values. Multiple zeta values are often written
 and Euler sums are written
 where 
  
    
      
        
          ε
          
            i
          
        
        =
        ±
        1
      
    
    {\displaystyle \varepsilon _{i}=\pm 1}
  
. Sometimes, authors will write a bar over an 
  
    
      
        
          s
          
            i
          
        
      
    
    {\displaystyle s_{i}}
  
 corresponding to an 
  
    
      
        
          ε
          
            i
          
        
      
    
    {\displaystyle \varepsilon _{i}}
  
 equal to 
  
    
      
        −
        1
      
    
    {\displaystyle -1}
  
, so for example
 It was noticed by Kontsevich that it is possible to express colored multiple zeta values (and thus their special cases) as certain multivariable integrals. This result is often stated with the use of a convention for iterated integrals, wherein
 Using this convention, the result can be stated as follows:
 This result is extremely useful due to a well-known result regarding products of iterated integrals, namely that
 To utilize this in the context of multiple zeta values, define 
  
    
      
        X
        =
        {
        a
        ,
        b
        }
      
    
    {\displaystyle X=\{a,b\}}
  
, 
  
    
      
        
          X
          
            ∗
          
        
      
    
    {\displaystyle X^{*}}
  
 to be the free monoid generated by 
  
    
      
        X
      
    
    {\displaystyle X}
  
 and 
  
    
      
        
          
            A
          
        
      
    
    {\displaystyle {\mathfrak {A}}}
  
 to be the free 
  
    
      
        
          Q
        
      
    
    {\displaystyle \mathbb {Q} }
  
-vector space generated by 
  
    
      
        
          X
          
            ∗
          
        
      
    
    {\displaystyle X^{*}}
  
. 
  
    
      
        
          
            A
          
        
      
    
    {\displaystyle {\mathfrak {A}}}
  
 can be equipped with the shuffle product, turning it into an algebra. Then, the multiple zeta function can be viewed as an evaluation map, where we identify 
  
    
      
        a
        =
        
          
            
              d
              t
            
            t
          
        
      
    
    {\displaystyle a={\frac {dt}{t}}}
  
, 
  
    
      
        b
        =
        
          
            
              d
              t
            
            
              1
              −
              t
            
          
        
      
    
    {\displaystyle b={\frac {dt}{1-t}}}
  
, and define
 which, by the aforementioned integral identity, makes
 Then, the integral identity on products gives
 In the particular case of only two parameters we have (with s > 1 and n, m integers):
 Multiple zeta functions are known to satisfy what is known as MZV duality, the simplest case of which is the famous identity of Euler:
 where Hn are the harmonic numbers.
 Special values of double zeta functions, with s > 0 and even, t > 1 and odd, but s+t = 2N+1 (taking if necessary ζ(0) = 0):
 Note that if 
  
    
      
        s
        +
        t
        =
        2
        p
        +
        2
      
    
    {\displaystyle s+t=2p+2}
  
 we have 
  
    
      
        p
        
          /
        
        3
      
    
    {\displaystyle p/3}
  
 irreducibles, i.e. these MZVs cannot be written as function of 
  
    
      
        ζ
        (
        a
        )
      
    
    {\displaystyle \zeta (a)}
  
 only.
 In the particular case of only three parameters we have (with a > 1 and n, j, i integers):
 The above MZVs satisfy the Euler reflection formula:
 Using the shuffle relations, it is easy to prove that:
 This function can be seen as a generalization of the reflection formulas.
 Let 
  
    
      
        S
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        )
        =
        
          ∑
          
            
              n
              
                1
              
            
            ≥
            
              n
              
                2
              
            
            ≥
            ⋯
            
              n
              
                k
              
            
            ≥
            1
          
        
        
          
            1
            
              
                n
                
                  1
                
                
                  
                    i
                    
                      1
                    
                  
                
              
              
                n
                
                  2
                
                
                  
                    i
                    
                      2
                    
                  
                
              
              ⋯
              
                n
                
                  k
                
                
                  
                    i
                    
                      k
                    
                  
                
              
            
          
        
      
    
    {\displaystyle S(i_{1},i_{2},\cdots ,i_{k})=\sum _{n_{1}\geq n_{2}\geq \cdots n_{k}\geq 1}{\frac {1}{n_{1}^{i_{1}}n_{2}^{i_{2}}\cdots n_{k}^{i_{k}}}}}
  
, and for a partition 
  
    
      
        Π
        =
        {
        
          P
          
            1
          
        
        ,
        
          P
          
            2
          
        
        ,
        …
        ,
        
          P
          
            l
          
        
        }
      
    
    {\displaystyle \Pi =\{P_{1},P_{2},\dots ,P_{l}\}}
  
 of the set 
  
    
      
        {
        1
        ,
        2
        ,
        …
        ,
        k
        }
      
    
    {\displaystyle \{1,2,\dots ,k\}}
  
, let 
  
    
      
        c
        (
        Π
        )
        =
        (
        
          |
          
            P
            
              1
            
          
          |
        
        −
        1
        )
        !
        (
        
          |
          
            P
            
              2
            
          
          |
        
        −
        1
        )
        !
        ⋯
        (
        
          |
          
            P
            
              l
            
          
          |
        
        −
        1
        )
        !
      
    
    {\displaystyle c(\Pi )=(\left|P_{1}\right|-1)!(\left|P_{2}\right|-1)!\cdots (\left|P_{l}\right|-1)!}
  
.  Also, given such a 
  
    
      
        Π
      
    
    {\displaystyle \Pi }
  
 and a k-tuple 
  
    
      
        i
        =
        {
        
          i
          
            1
          
        
        ,
        .
        .
        .
        ,
        
          i
          
            k
          
        
        }
      
    
    {\displaystyle i=\{i_{1},...,i_{k}\}}
  
 of exponents, define 
  
    
      
        
          ∏
          
            s
            =
            1
          
          
            l
          
        
        ζ
        (
        
          ∑
          
            j
            ∈
            
              P
              
                s
              
            
          
        
        
          i
          
            j
          
        
        )
      
    
    {\displaystyle \prod _{s=1}^{l}\zeta (\sum _{j\in P_{s}}i_{j})}
  
.
 The relations between the 
  
    
      
        ζ
      
    
    {\displaystyle \zeta }
  
 and 
  
    
      
        S
      
    
    {\displaystyle S}
  
 are:

  
    
      
        S
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        )
        =
        ζ
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            2
          
        
        )
      
    
    {\displaystyle S(i_{1},i_{2})=\zeta (i_{1},i_{2})+\zeta (i_{1}+i_{2})}
  
 and 
  
    
      
        S
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        
          i
          
            3
          
        
        )
        =
        ζ
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            2
          
        
        ,
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        +
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            2
          
        
        +
        
          i
          
            3
          
        
        )
        .
      
    
    {\displaystyle S(i_{1},i_{2},i_{3})=\zeta (i_{1},i_{2},i_{3})+\zeta (i_{1}+i_{2},i_{3})+\zeta (i_{1},i_{2}+i_{3})+\zeta (i_{1}+i_{2}+i_{3}).}
  

 For any real 
  
    
      
        
          i
          
            1
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        >
        1
        ,
      
    
    {\displaystyle i_{1},\cdots ,i_{k}>1,}
  
, 
  
    
      
        
          ∑
          
            σ
            ∈
            
              Σ
              
                k
              
            
          
        
        S
        (
        
          i
          
            σ
            (
            1
            )
          
        
        ,
        …
        ,
        
          i
          
            σ
            (
            k
            )
          
        
        )
        =
        
          ∑
          
            
              partitions 
            
            Π
            
               of 
            
            {
            1
            ,
            …
            ,
            k
            }
          
        
        c
        (
        Π
        )
        ζ
        (
        i
        ,
        Π
        )
      
    
    {\displaystyle \sum _{\sigma \in \Sigma _{k}}S(i_{\sigma (1)},\dots ,i_{\sigma (k)})=\sum _{{\text{partitions }}\Pi {\text{ of }}\{1,\dots ,k\}}c(\Pi )\zeta (i,\Pi )}
  
.
 Proof. Assume the 
  
    
      
        
          i
          
            j
          
        
      
    
    {\displaystyle i_{j}}
  
 are all distinct. (There is no loss of generality, since we can take limits.) The left-hand side can be written as

  
    
      
        
          ∑
          
            σ
          
        
        
          ∑
          
            
              n
              
                1
              
            
            ≥
            
              n
              
                2
              
            
            ≥
            ⋯
            ≥
            
              n
              
                k
              
            
            ≥
            1
          
        
        
          
            1
            
              
                
                  
                    n
                    
                      
                        i
                        
                          1
                        
                      
                    
                  
                
                
                  σ
                  (
                  1
                  )
                
              
              
                
                  
                    n
                    
                      
                        i
                        
                          2
                        
                      
                    
                  
                
                
                  σ
                  (
                  2
                  )
                
              
              ⋯
              
                
                  
                    n
                    
                      
                        i
                        
                          k
                        
                      
                    
                  
                
                
                  σ
                  (
                  k
                  )
                
              
            
          
        
      
    
    {\displaystyle \sum _{\sigma }\sum _{n_{1}\geq n_{2}\geq \cdots \geq n_{k}\geq 1}{\frac {1}{{n^{i_{1}}}_{\sigma (1)}{n^{i_{2}}}_{\sigma (2)}\cdots {n^{i_{k}}}_{\sigma (k)}}}}
  
. Now thinking on the symmetric
 group 
  
    
      
        
          Σ
          
            k
          
        
      
    
    {\displaystyle \Sigma _{k}}
  
 as acting on k-tuple 
  
    
      
        n
        =
        (
        1
        ,
        ⋯
        ,
        k
        )
      
    
    {\displaystyle n=(1,\cdots ,k)}
  
 of positive integers. A given k-tuple 
  
    
      
        n
        =
        (
        
          n
          
            1
          
        
        ,
        ⋯
        ,
        
          n
          
            k
          
        
        )
      
    
    {\displaystyle n=(n_{1},\cdots ,n_{k})}
  
 has an isotropy group
 
  
    
      
        
          Σ
          
            k
          
        
        (
        n
        )
      
    
    {\displaystyle \Sigma _{k}(n)}
  
 and an associated partition 
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
 of 
  
    
      
        (
        1
        ,
        2
        ,
        ⋯
        ,
        k
        )
      
    
    {\displaystyle (1,2,\cdots ,k)}
  
: 
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
 is the set of equivalence classes of the relation 
given by 
  
    
      
        i
        ∼
        j
      
    
    {\displaystyle i\sim j}
  
 iff 
  
    
      
        
          n
          
            i
          
        
        =
        
          n
          
            j
          
        
      
    
    {\displaystyle n_{i}=n_{j}}
  
, and 
  
    
      
        
          Σ
          
            k
          
        
        (
        n
        )
        =
        {
        σ
        ∈
        
          Σ
          
            k
          
        
        :
        σ
        (
        i
        )
        ∼
        ∀
        i
        }
      
    
    {\displaystyle \Sigma _{k}(n)=\{\sigma \in \Sigma _{k}:\sigma (i)\sim \forall i\}}
  
. Now the term 
  
    
      
        
          
            1
            
              
                
                  
                    n
                    
                      
                        i
                        
                          1
                        
                      
                    
                  
                
                
                  σ
                  (
                  1
                  )
                
              
              
                
                  
                    n
                    
                      
                        i
                        
                          2
                        
                      
                    
                  
                
                
                  σ
                  (
                  2
                  )
                
              
              ⋯
              
                
                  
                    n
                    
                      
                        i
                        
                          k
                        
                      
                    
                  
                
                
                  σ
                  (
                  k
                  )
                
              
            
          
        
      
    
    {\displaystyle {\frac {1}{{n^{i_{1}}}_{\sigma (1)}{n^{i_{2}}}_{\sigma (2)}\cdots {n^{i_{k}}}_{\sigma (k)}}}}
  
 occurs on the left-hand side of 
  
    
      
        
          ∑
          
            σ
            ∈
            
              Σ
              
                k
              
            
          
        
        S
        (
        
          i
          
            σ
            (
            1
            )
          
        
        ,
        …
        ,
        
          i
          
            σ
            (
            k
            )
          
        
        )
        =
        
          ∑
          
            
              partitions 
            
            Π
            
               of 
            
            {
            1
            ,
            …
            ,
            k
            }
          
        
        c
        (
        Π
        )
        ζ
        (
        i
        ,
        Π
        )
      
    
    {\displaystyle \sum _{\sigma \in \Sigma _{k}}S(i_{\sigma (1)},\dots ,i_{\sigma (k)})=\sum _{{\text{partitions }}\Pi {\text{ of }}\{1,\dots ,k\}}c(\Pi )\zeta (i,\Pi )}
  
 exactly 
  
    
      
        
          |
          
            
              Σ
              
                k
              
            
            (
            n
            )
          
          |
        
      
    
    {\displaystyle \left|\Sigma _{k}(n)\right|}
  
 times. It occurs on the right-hand side in those terms corresponding to partitions 
  
    
      
        Π
      
    
    {\displaystyle \Pi }
  
 that are refinements of 
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
: letting 
  
    
      
        ⪰
      
    
    {\displaystyle \succeq }
  
 denote refinement, 
  
    
      
        
          
            1
            
              
                
                  
                    n
                    
                      
                        i
                        
                          1
                        
                      
                    
                  
                
                
                  σ
                  (
                  1
                  )
                
              
              
                
                  
                    n
                    
                      
                        i
                        
                          2
                        
                      
                    
                  
                
                
                  σ
                  (
                  2
                  )
                
              
              ⋯
              
                
                  
                    n
                    
                      
                        i
                        
                          k
                        
                      
                    
                  
                
                
                  σ
                  (
                  k
                  )
                
              
            
          
        
      
    
    {\displaystyle {\frac {1}{{n^{i_{1}}}_{\sigma (1)}{n^{i_{2}}}_{\sigma (2)}\cdots {n^{i_{k}}}_{\sigma (k)}}}}
  
 occurs 
  
    
      
        
          ∑
          
            Π
            ⪰
            Λ
          
        
        (
        Π
        )
      
    
    {\displaystyle \sum _{\Pi \succeq \Lambda }(\Pi )}
  
 times. Thus, the conclusion will follow if 

  
    
      
        
          |
          
            
              Σ
              
                k
              
            
            (
            n
            )
          
          |
        
        =
        
          ∑
          
            Π
            ⪰
            Λ
          
        
        c
        (
        Π
        )
      
    
    {\displaystyle \left|\Sigma _{k}(n)\right|=\sum _{\Pi \succeq \Lambda }c(\Pi )}
  
 for any k-tuple 
  
    
      
        n
        =
        {
        
          n
          
            1
          
        
        ,
        ⋯
        ,
        
          n
          
            k
          
        
        }
      
    
    {\displaystyle n=\{n_{1},\cdots ,n_{k}\}}
  
 and associated partition 
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
.
To see this, note that 
  
    
      
        c
        (
        Π
        )
      
    
    {\displaystyle c(\Pi )}
  
 counts the permutations having cycle type specified by 
  
    
      
        Π
      
    
    {\displaystyle \Pi }
  
: since any elements of 
  
    
      
        
          Σ
          
            k
          
        
        (
        n
        )
      
    
    {\displaystyle \Sigma _{k}(n)}
  
 has a unique cycle type specified by a partition that refines 
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
, the result follows.
 For 
  
    
      
        k
        =
        3
      
    
    {\displaystyle k=3}
  
, the theorem says 
  
    
      
        
          ∑
          
            σ
            ∈
            
              Σ
              
                3
              
            
          
        
        S
        (
        
          i
          
            σ
            (
            1
            )
          
        
        ,
        
          i
          
            σ
            (
            2
            )
          
        
        ,
        
          i
          
            σ
            (
            3
            )
          
        
        )
        =
        ζ
        (
        
          i
          
            1
          
        
        )
        ζ
        (
        
          i
          
            2
          
        
        )
        ζ
        (
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            2
          
        
        )
        ζ
        (
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        )
        ζ
        (
        
          i
          
            2
          
        
        +
        
          i
          
            3
          
        
        )
        +
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            3
          
        
        )
        ζ
        (
        
          i
          
            2
          
        
        )
        +
        2
        ζ
        (
        
          i
          
            1
          
        
        +
        
          i
          
            2
          
        
        +
        
          i
          
            3
          
        
        )
      
    
    {\displaystyle \sum _{\sigma \in \Sigma _{3}}S(i_{\sigma (1)},i_{\sigma (2)},i_{\sigma (3)})=\zeta (i_{1})\zeta (i_{2})\zeta (i_{3})+\zeta (i_{1}+i_{2})\zeta (i_{3})+\zeta (i_{1})\zeta (i_{2}+i_{3})+\zeta (i_{1}+i_{3})\zeta (i_{2})+2\zeta (i_{1}+i_{2}+i_{3})}
  

for 
  
    
      
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        
          i
          
            3
          
        
        >
        1
      
    
    {\displaystyle i_{1},i_{2},i_{3}>1}
  
. This is the main result of.
 Having 
  
    
      
        ζ
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        )
        =
        
          ∑
          
            
              n
              
                1
              
            
            >
            
              n
              
                2
              
            
            >
            ⋯
            
              n
              
                k
              
            
            ≥
            1
          
        
        
          
            1
            
              
                n
                
                  1
                
                
                  
                    i
                    
                      1
                    
                  
                
              
              
                n
                
                  2
                
                
                  
                    i
                    
                      2
                    
                  
                
              
              ⋯
              
                n
                
                  k
                
                
                  
                    i
                    
                      k
                    
                  
                
              
            
          
        
      
    
    {\displaystyle \zeta (i_{1},i_{2},\cdots ,i_{k})=\sum _{n_{1}>n_{2}>\cdots n_{k}\geq 1}{\frac {1}{n_{1}^{i_{1}}n_{2}^{i_{2}}\cdots n_{k}^{i_{k}}}}}
  
. To state the analog of Theorem 1 for the 
  
    
      
        
          ζ
          ′
        
        s
      
    
    {\displaystyle \zeta 's}
  
, we require one bit of notation. For a partition
 
  
    
      
        Π
        =
        {
        
          P
          
            1
          
        
        ,
        ⋯
        ,
        
          P
          
            l
          
        
        }
      
    
    {\displaystyle \Pi =\{P_{1},\cdots ,P_{l}\}}
  
 of 
  
    
      
        {
        1
        ,
        2
        ⋯
        ,
        k
        }
      
    
    {\displaystyle \{1,2\cdots ,k\}}
  
, let 
  
    
      
        
          
            
              c
              ~
            
          
        
        (
        Π
        )
        =
        (
        −
        1
        
          )
          
            k
            −
            l
          
        
        c
        (
        Π
        )
      
    
    {\displaystyle {\tilde {c}}(\Pi )=(-1)^{k-l}c(\Pi )}
  
.
 For any real 
  
    
      
        
          i
          
            1
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        >
        1
      
    
    {\displaystyle i_{1},\cdots ,i_{k}>1}
  
, 
  
    
      
        
          ∑
          
            σ
            ∈
            
              Σ
              
                k
              
            
          
        
        ζ
        (
        
          i
          
            σ
            (
            1
            )
          
        
        ,
        …
        ,
        
          i
          
            σ
            (
            k
            )
          
        
        )
        =
        
          ∑
          
            
              partitions 
            
            Π
            
               of 
            
            {
            1
            ,
            …
            ,
            k
            }
          
        
        
          
            
              c
              ~
            
          
        
        (
        Π
        )
        ζ
        (
        i
        ,
        Π
        )
      
    
    {\displaystyle \sum _{\sigma \in \Sigma _{k}}\zeta (i_{\sigma (1)},\dots ,i_{\sigma (k)})=\sum _{{\text{partitions }}\Pi {\text{ of }}\{1,\dots ,k\}}{\tilde {c}}(\Pi )\zeta (i,\Pi )}
  
.
 Proof. We follow the same line of argument as in the preceding proof. The left-hand side is now

  
    
      
        
          ∑
          
            σ
          
        
        
          ∑
          
            
              n
              
                1
              
            
            >
            
              n
              
                2
              
            
            >
            ⋯
            >
            
              n
              
                k
              
            
            ≥
            1
          
        
        
          
            1
            
              
                
                  
                    n
                    
                      
                        i
                        
                          1
                        
                      
                    
                  
                
                
                  σ
                  (
                  1
                  )
                
              
              
                
                  
                    n
                    
                      
                        i
                        
                          2
                        
                      
                    
                  
                
                
                  σ
                  (
                  2
                  )
                
              
              ⋯
              
                
                  
                    n
                    
                      
                        i
                        
                          k
                        
                      
                    
                  
                
                
                  σ
                  (
                  k
                  )
                
              
            
          
        
      
    
    {\displaystyle \sum _{\sigma }\sum _{n_{1}>n_{2}>\cdots >n_{k}\geq 1}{\frac {1}{{n^{i_{1}}}_{\sigma (1)}{n^{i_{2}}}_{\sigma (2)}\cdots {n^{i_{k}}}_{\sigma (k)}}}}
  
, and a term 
  
    
      
        
          
            1
            
              
                n
                
                  1
                
                
                  
                    i
                    
                      1
                    
                  
                
              
              
                n
                
                  2
                
                
                  
                    i
                    
                      2
                    
                  
                
              
              ⋯
              
                n
                
                  k
                
                
                  
                    i
                    
                      k
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\frac {1}{n_{1}^{i_{1}}n_{2}^{i_{2}}\cdots n_{k}^{i_{k}}}}}
  
  occurs on the left-hand since once if all the 
  
    
      
        
          n
          
            i
          
        
      
    
    {\displaystyle n_{i}}
  
 are distinct, and not at all otherwise. Thus, it suffices to show  

  
    
      
        
          ∑
          
            Π
            ⪰
            Λ
          
        
        
          
            
              c
              ~
            
          
        
        (
        Π
        )
        =
        
          
            {
            
              
                
                  1
                  ,
                  
                     if 
                  
                  
                    |
                    Λ
                    |
                  
                  =
                  k
                
              
              
                
                  0
                  ,
                  
                     otherwise 
                  
                  .
                
              
            
            
          
        
      
    
    {\displaystyle \sum _{\Pi \succeq \Lambda }{\tilde {c}}(\Pi )={\begin{cases}1,{\text{ if }}\left|\Lambda \right|=k\\0,{\text{ otherwise }}.\end{cases}}}
  
  (1)
 To prove this, note first that the sign of 
  
    
      
        
          
            
              c
              ~
            
          
        
        (
        Π
        )
      
    
    {\displaystyle {\tilde {c}}(\Pi )}
  
 is positive if the permutations of cycle type 
  
    
      
        Π
      
    
    {\displaystyle \Pi }
  
 are even, and negative if they are odd: thus, the left-hand side of (1) is the signed sum of the number of even and odd permutations in the isotropy group 
  
    
      
        
          Σ
          
            k
          
        
        (
        n
        )
      
    
    {\displaystyle \Sigma _{k}(n)}
  
. But such an isotropy group has equal numbers of even and odd permutations unless it is trivial, i.e. unless the associated partition  
  
    
      
        Λ
      
    
    {\displaystyle \Lambda }
  
 is 

  
    
      
        {
        {
        1
        }
        ,
        {
        2
        }
        ,
        ⋯
        ,
        {
        k
        }
        }
      
    
    {\displaystyle \{\{1\},\{2\},\cdots ,\{k\}\}}
  
.
 We first state the sum conjecture, which is due to C. Moen.
 Sum conjecture (Hoffman). For positive integers k and n,

  
    
      
        
          ∑
          
            
              i
              
                1
              
            
            +
            ⋯
            +
            
              i
              
                k
              
            
            =
            n
            ,
            
              i
              
                1
              
            
            >
            1
          
        
        ζ
        (
        
          i
          
            1
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        )
        =
        ζ
        (
        n
        )
      
    
    {\displaystyle \sum _{i_{1}+\cdots +i_{k}=n,i_{1}>1}\zeta (i_{1},\cdots ,i_{k})=\zeta (n)}
  
, where the sum is extended over k-tuples 
  
    
      
        
          i
          
            1
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
      
    
    {\displaystyle i_{1},\cdots ,i_{k}}
  
 of positive integers with 
  
    
      
        
          i
          
            1
          
        
        >
        1
      
    
    {\displaystyle i_{1}>1}
  
.
 Three remarks concerning this conjecture are in order. First, it implies

  
    
      
        
          ∑
          
            
              i
              
                1
              
            
            +
            ⋯
            +
            
              i
              
                k
              
            
            =
            n
            ,
            
              i
              
                1
              
            
            >
            1
          
        
        S
        (
        
          i
          
            1
          
        
        ,
        ⋯
        ,
        
          i
          
            k
          
        
        )
        =
        
          
            
              (
            
            
              
                n
                −
                1
              
              
                k
                −
                1
              
            
            
              )
            
          
        
        ζ
        (
        n
        )
      
    
    {\displaystyle \sum _{i_{1}+\cdots +i_{k}=n,i_{1}>1}S(i_{1},\cdots ,i_{k})={n-1 \choose k-1}\zeta (n)}
  
. Second, in the case 
  
    
      
        k
        =
        2
      
    
    {\displaystyle k=2}
  
 it says that 
  
    
      
        ζ
        (
        n
        −
        1
        ,
        1
        )
        +
        ζ
        (
        n
        −
        2
        ,
        2
        )
        +
        ⋯
        +
        ζ
        (
        2
        ,
        n
        −
        2
        )
        =
        ζ
        (
        n
        )
      
    
    {\displaystyle \zeta (n-1,1)+\zeta (n-2,2)+\cdots +\zeta (2,n-2)=\zeta (n)}
  
, or using the relation between the 
  
    
      
        
          ζ
          ′
        
        s
      
    
    {\displaystyle \zeta 's}
  
 and 
  
    
      
        
          S
          ′
        
        s
      
    
    {\displaystyle S's}
  
 and Theorem 1, 
  
    
      
        2
        S
        (
        n
        −
        1
        ,
        1
        )
        =
        (
        n
        +
        1
        )
        ζ
        (
        n
        )
        −
        
          ∑
          
            k
            =
            2
          
          
            n
            −
            2
          
        
        ζ
        (
        k
        )
        ζ
        (
        n
        −
        k
        )
        .
      
    
    {\displaystyle 2S(n-1,1)=(n+1)\zeta (n)-\sum _{k=2}^{n-2}\zeta (k)\zeta (n-k).}
  

 This was proved by Euler and has been rediscovered several times, in particular by Williams. Finally, C. Moen has proved the same conjecture for k=3 by lengthy but elementary arguments.
For the duality conjecture, we first define an involution 
  
    
      
        τ
      
    
    {\displaystyle \tau }
  
 on the set 
  
    
      
        ℑ
      
    
    {\displaystyle \Im }
  
 of finite sequences of positive integers whose first element is greater than 1. Let 
  
    
      
        
          T
        
      
    
    {\displaystyle \mathrm {T} }
  
 be the set of strictly increasing finite sequences of positive integers, and let 
  
    
      
        Σ
        :
        ℑ
        →
        
          T
        
      
    
    {\displaystyle \Sigma :\Im \rightarrow \mathrm {T} }
  
 be the function that sends a sequence in 
  
    
      
        ℑ
      
    
    {\displaystyle \Im }
  
 to its sequence of partial sums. If 
  
    
      
        
          
            T
          
          
            n
          
        
      
    
    {\displaystyle \mathrm {T} _{n}}
  
 is the set of sequences in 
  
    
      
        
          T
        
      
    
    {\displaystyle \mathrm {T} }
  
 whose last element is at most 
  
    
      
        n
      
    
    {\displaystyle n}
  
, we have two commuting involutions 
  
    
      
        
          R
          
            n
          
        
      
    
    {\displaystyle R_{n}}
  
 and 
  
    
      
        
          C
          
            n
          
        
      
    
    {\displaystyle C_{n}}
  
 on 
  
    
      
        
          
            T
          
          
            n
          
        
      
    
    {\displaystyle \mathrm {T} _{n}}
  
 defined by 

  
    
      
        
          R
          
            n
          
        
        (
        
          a
          
            1
          
        
        ,
        
          a
          
            2
          
        
        ,
        …
        ,
        
          a
          
            l
          
        
        )
        =
        (
        n
        +
        1
        −
        
          a
          
            l
          
        
        ,
        n
        +
        1
        −
        
          a
          
            l
            −
            1
          
        
        ,
        …
        ,
        n
        +
        1
        −
        
          a
          
            1
          
        
        )
      
    
    {\displaystyle R_{n}(a_{1},a_{2},\dots ,a_{l})=(n+1-a_{l},n+1-a_{l-1},\dots ,n+1-a_{1})}
  
 and 

  
    
      
        
          C
          
            n
          
        
        (
        
          a
          
            1
          
        
        ,
        …
        ,
        
          a
          
            l
          
        
        )
      
    
    {\displaystyle C_{n}(a_{1},\dots ,a_{l})}
  
 = complement of 
  
    
      
        {
        
          a
          
            1
          
        
        ,
        …
        ,
        
          a
          
            l
          
        
        }
      
    
    {\displaystyle \{a_{1},\dots ,a_{l}\}}
  
 in 
  
    
      
        {
        1
        ,
        2
        ,
        …
        ,
        n
        }
      
    
    {\displaystyle \{1,2,\dots ,n\}}
  
 arranged in increasing order. The our definition of 
  
    
      
        τ
      
    
    {\displaystyle \tau }
  
 is 
  
    
      
        τ
        (
        I
        )
        =
        
          Σ
          
            −
            1
          
        
        
          R
          
            n
          
        
        
          C
          
            n
          
        
        Σ
        (
        I
        )
        =
        
          Σ
          
            −
            1
          
        
        
          C
          
            n
          
        
        
          R
          
            n
          
        
        Σ
        (
        I
        )
      
    
    {\displaystyle \tau (I)=\Sigma ^{-1}R_{n}C_{n}\Sigma (I)=\Sigma ^{-1}C_{n}R_{n}\Sigma (I)}
  
 for 
  
    
      
        I
        =
        (
        
          i
          
            1
          
        
        ,
        
          i
          
            2
          
        
        ,
        …
        ,
        
          i
          
            k
          
        
        )
        ∈
        ℑ
      
    
    {\displaystyle I=(i_{1},i_{2},\dots ,i_{k})\in \Im }
  
 with 
  
    
      
        
          i
          
            1
          
        
        +
        ⋯
        +
        
          i
          
            k
          
        
        =
        n
      
    
    {\displaystyle i_{1}+\cdots +i_{k}=n}
  
.
 For example,

  
    
      
        τ
        (
        3
        ,
        4
        ,
        1
        )
        =
        
          Σ
          
            −
            1
          
        
        
          C
          
            8
          
        
        
          R
          
            8
          
        
        (
        3
        ,
        7
        ,
        8
        )
        =
        
          Σ
          
            −
            1
          
        
        (
        3
        ,
        4
        ,
        5
        ,
        7
        ,
        8
        )
        =
        (
        3
        ,
        1
        ,
        1
        ,
        2
        ,
        1
        )
        .
      
    
    {\displaystyle \tau (3,4,1)=\Sigma ^{-1}C_{8}R_{8}(3,7,8)=\Sigma ^{-1}(3,4,5,7,8)=(3,1,1,2,1).}
  

We shall say the sequences 
  
    
      
        (
        
          i
          
            1
          
        
        ,
        …
        ,
        
          i
          
            k
          
        
        )
      
    
    {\displaystyle (i_{1},\dots ,i_{k})}
  
 and 
  
    
      
        τ
        (
        
          i
          
            1
          
        
        ,
        …
        ,
        
          i
          
            k
          
        
        )
      
    
    {\displaystyle \tau (i_{1},\dots ,i_{k})}
  
 are dual to each other, and refer to a sequence fixed by 
  
    
      
        τ
      
    
    {\displaystyle \tau }
  
 as self-dual.
 Duality conjecture (Hoffman). If 
  
    
      
        (
        
          h
          
            1
          
        
        ,
        …
        ,
        
          h
          
            n
            −
            k
          
        
        )
      
    
    {\displaystyle (h_{1},\dots ,h_{n-k})}
  
 is dual to 
  
    
      
        (
        
          i
          
            1
          
        
        ,
        …
        ,
        
          i
          
            k
          
        
        )
      
    
    {\displaystyle (i_{1},\dots ,i_{k})}
  
, then 
  
    
      
        ζ
        (
        
          h
          
            1
          
        
        ,
        …
        ,
        
          h
          
            n
            −
            k
          
        
        )
        =
        ζ
        (
        
          i
          
            1
          
        
        ,
        …
        ,
        
          i
          
            k
          
        
        )
      
    
    {\displaystyle \zeta (h_{1},\dots ,h_{n-k})=\zeta (i_{1},\dots ,i_{k})}
  
.
 This sum conjecture is also known as Sum Theorem, and it may be expressed as follows: the Riemann zeta value of an integer n ≥ 2 is equal to the sum of all the valid (i.e. with s1 > 1) MZVs of the partitions of length k and weight n, with 1 ≤ k ≤ n − 1. In formula:
 For example, with length k = 2 and weight n = 7:
 The Euler sum with alternations of sign appears in studies of the non-alternating Euler sum.
 As a variant of the Dirichlet eta function we define
 The reflection formula 
  
    
      
        ζ
        (
        a
        ,
        b
        )
        +
        ζ
        (
        b
        ,
        a
        )
        =
        ζ
        (
        a
        )
        ζ
        (
        b
        )
        −
        ζ
        (
        a
        +
        b
        )
      
    
    {\displaystyle \zeta (a,b)+\zeta (b,a)=\zeta (a)\zeta (b)-\zeta (a+b)}
  
 can be generalized as follows:
 if 
  
    
      
        a
        =
        b
      
    
    {\displaystyle a=b}
  
 we have 
  
    
      
        ζ
        (
        
          
            
              a
              ¯
            
          
        
        ,
        
          
            
              a
              ¯
            
          
        
        )
        =
        
          
            
              1
              2
            
          
        
        
          
            [
          
        
        
          ϕ
          
            2
          
        
        (
        a
        )
        −
        ζ
        (
        2
        a
        )
        
          
            ]
          
        
      
    
    {\displaystyle \zeta ({\bar {a}},{\bar {a}})={\tfrac {1}{2}}{\Big [}\phi ^{2}(a)-\zeta (2a){\Big ]}}
  

 Using the series definition it is easy to prove:
 A further useful relation is: 
 where 
  
    
      
        
          Z
          
            a
          
        
        (
        s
        ,
        t
        )
        =
        ζ
        (
        s
        ,
        t
        )
        +
        ζ
        (
        
          
            
              s
              ¯
            
          
        
        ,
        t
        )
        −
        
          
            
              
                
                  [
                
              
              ζ
              (
              s
              ,
              t
              )
              +
              ζ
              (
              s
              +
              t
              )
              
                
                  ]
                
              
            
            
              2
              
                (
                s
                −
                1
                )
              
            
          
        
      
    
    {\displaystyle Z_{a}(s,t)=\zeta (s,t)+\zeta ({\bar {s}},t)-{\frac {{\Big [}\zeta (s,t)+\zeta (s+t){\Big ]}}{2^{(s-1)}}}}
  
 and 
  
    
      
        
          Z
          
            b
          
        
        (
        s
        ,
        t
        )
        =
        
          
            
              ζ
              (
              s
              ,
              t
              )
            
            
              2
              
                (
                s
                −
                1
                )
              
            
          
        
      
    
    {\displaystyle Z_{b}(s,t)={\frac {\zeta (s,t)}{2^{(s-1)}}}}
  

 Note that 
  
    
      
        s
      
    
    {\displaystyle s}
  
 must be used for all value 
  
    
      
        >
        1
      
    
    {\displaystyle >1}
  
 for which the argument of the factorials is 
  
    
      
        ⩾
        0
      
    
    {\displaystyle \geqslant 0}
  

 For all positive integers 
  
    
      
        a
        ,
        b
        ,
        …
        ,
        k
      
    
    {\displaystyle a,b,\dots ,k}
  
:
 The Mordell–Tornheim  zeta function, introduced by Matsumoto (2003) who was motivated by the papers Mordell (1958) and Tornheim (1950), is defined by 
 It is a special case of the Shintani zeta function.