- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
International Journal of Combinatorics
Volume 2010 (2010), Article ID 153621, 13 pages
On a Reciprocity Law for Finite Multiple Zeta Values
1Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstr, 8-10/104, 1040 Wien, Austria
2Department of Mathematics, University of Stellenbosch, 7602 Stellenbosch, South Africa
Received 11 October 2009; Accepted 14 January 2010
Academic Editor: Alois Panholzer
Copyright © 2010 Markus Kuba and Helmut Prodinger. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
It was shown by Kirschenhofer and Prodinger (1998) and Kuba et al. (2008) that harmonic numbers satisfy certain reciprocity relations, which are in particular useful for the analysis of the quickselect algorithm. The aim of this work is to show that a reciprocity relation from Kirschenhofer and Prodinger (1998) and Kuba et al. (2008) can be generalized to finite variants of multiple zeta values, involving a finite variant of the shuffle identity for multiple zeta values. We present the generalized reciprocity relation and furthermore a combinatorial proof of the shuffle identity based on partial fraction decomposition. We also present an extension of the reciprocity relation to weighted sums.
Let denote the th harmonic number and the th harmonic number of order , with and . Kirschenhofer and Prodinger  analyzed the variance of the number of comparisons of the famous QUICKSELECT algorithm, also known as FIND  and derived a reciprocity relation for (first-order) harmonic numbers. Subsequently, the reciprocity relation of  was generalized , where the following identity was derived:
where , which can be evaluated into a finite analogue of the so-called Euler identity for stated below,
Note that . Finite multiple zeta values are also called truncated multiple zeta values. They are also of great importance in particle physics, see for example the works [10–12], and closely related to so-called harmonics sums. Let denote the weight and the depth of (finite) multiple zeta values. The aim of this note is to derive a generalization of the reciprocity relation (1.1), stated below in Theorem 2.1, by considering the more general sums
instead of the previously considered sums and . The generalization involves a finite variant of the shuffle identity for multiple zeta values; see, for example, Hoffman  for a general algebraic framework for shuffle products. We will give an elementary proof of the shuffle identity using only partial fraction decomposition and the combinatorial properties of the shuffle product in Sections 3.1 and 3.2. Moreover, we discuss the close relation between this finite variant of the shuffle identity and the shuffle identity for generalized polylogarithm functions; it will turn out that the finite variant of the shuffle identity is equivalent to the shuffle identity for generalized polylogarithm functions.
To simplify the presentation of this work, we will frequently use the shorthand notations , , and , , respectively, with and for and .
We will state the main theorem and two corollaries below, and subsequently discuss their proofs and the precise definition of the shuffle relation for multiple zeta values.
Theorem 2.1. The finite multiple zeta values , satisfy the following reciprocity relation. The quantity can be written as a sum of finite multiple zeta values, all of them having weight and depth .
Corollary 2.3. We obtain the complementary identity
Next we state an immediate asymptotic implication of the previous result.
Corollary 2.4. For , , with and , we obtain the following result:
3. The Proof of the Reciprocity Relation
In order to prove Theorem 2.1, we proceed as follows (using the beforehand introduced shorthand notations).
After changing summations, we obtain
and the fact that gives the intermediate result
Add the sum to both sides of the equation above. This proves the first part of Theorem 2.1 and
For the evaluation of , we note that , and further
Since , we have
Consequently, by summing up according to (3.6), we get the following recurrence relation for :
This recurrence relation suggests that there exists an evaluation of into sums of finite multiple zeta values, all of them having weight and depth . In order to specify this evaluation, we need to introduce the shuffle product for words over a noncommutative alphabet and to study the arising shuffle algebra, and its relation to (finite) multiple zeta values and . For a general algebraic framework for the shuffle product, we refer the reader to the work of Hoffman . We remark that the recurrence relation above for was already derived in the context of particle physics [11, 12]. Furthermore, weighted extensions including alternating sign versions have been treated there. An important algorithmic treatment of such sums is implemented in the package Summer for the computer algebra system Form.
3.1. The Shuffle Algebra
Let denote a finite noncommutative alphabet consisting of a set of letters. A word on the alphabet consists of a sequence of letters from . Let denote the set of all words on the alphabet . A polynomial on over is a rational linear combination of words on . The set of all such polynomials is denoted by . Let the shuffle product of two words , with , , for , be defined as follows:
where the sum runs over all permutations which satisfy for all and . Note that the sum runs over all words of length , counting multiplicities, in which the relative orders of the letters and are preserved. Equivalently, the shuffle product of two words can be defined in a recursive way:
The shuffle product extends to by linearity. Note that the set , provided with the shuffle product , becomes a commutative and associative algebra. We remark that the term “shuffle” is used because such permutations arise in riffle shuffling a deck of cards cut into one pile of cards and a second pile of cards .
In the following, we will restrict ourselves to the non-commutative alphabet and the arising shuffle algebra . Hoang and Petitot  derived a shuffle identity for words , , which is stated below.
Lemma 3.1. For , let and be words on the non-commutative alphabet .
We will use a slight extension of this identity, which easily follows from the recursive definition of the shuffle product.
Lemma 3.2. For and , , , let and be words on the non-commutative alphabet . with , and further , .
3.2. The Shuffle Algebra and Finite Multiple Zeta Values
Let denote an arbitrary -tuple of positive integers with for and . To any , we will associate a unique word over the non-commutative alphabet as follows: such that . Let denote the set of all words over the alphabet . Let denote a family of linear maps from the algebra to the rational numbers, , mapping words over the non-commutative alphabet to finite multiple zeta values in the following way. For words , with , we define
Moreover, we additionally define for all , and for all . The family of maps linearly extend to . By the recursive definition of the finite multiple zeta values, we can express the images of the maps in a recursive way. Let , with and .
We need the following result.
Lemma 3.3. For and , , , let and be words on the non-commutative alphabet . Then, The depths and the weights of the arising finite multiple zeta values are all the same.
Proof. By linearity of the maps and Lemma 3.2, we get first using the notations of Lemma 3.2 for . By definition of the shuffle product, and are rational linear combinations of words over . Let and denote the sets of different words generated by the shuffles and . Using the set notation, we write with and , which helps to obtain a simple presentation of the subsequent calculations. We have Using the linearity of the maps and the fact that we can recursively describe their images, we get further Interchanging the latter summations gives the stated result. It can easily be checked that the finite multiple zeta values all have the same depth and weight.
Now we are ready to provide the evaluation of .
Proposition 3.4. For arbitrary , let and be given by and , with for , . Let and denote the words associated to and by and . Then, for arbitrary ,
Proof. We use induction with respect to , corresponding to the depths of the arising finite multiple zeta values. The result clearly holds for depth ; see identity (1.2), as shown in . Now assume that . Using the recurrence relation (3.10) for , we get The induction hypothesis states that for arbitrary such that and arbitrary . By the recurrence relation for , we can reduce to values of the types – and – , which are of depth smaller than . Hence, we get by the induction hypothesis By Lemma 3.3, using the notations for of Lemma 3.2, we get Consequently, This proves the stated result for and the corresponding statement of Theorem 2.1.
Corollary 2.3 can easily be deduced by noting that the sum of the left hand sides of Corollary 2.3 and Theorem 2.1 adds up to plus the additional two extra terms. The proof of Corollary 2.4 will be given in the next section, which consists of several remarks.
4. Remarks on Polylogarithms and the Finite Shuffle Identity
For given and , one may define the shuffle product in terms of the images of the maps using the words and associated to and by and ,
It turns out that this definition coincides with the usual definition of the shuffle product for multiple zeta values; for an excellent overview concerning the shuffle product for multiple zeta values, we refer the reader to [5, 16, 17].
Let denote the (multiple) polylogarithm function with parameters , defined by
The value can be obtained by coefficient extraction in the following way:
On the other hand, by the finite shuffle identity (3.23) for , one can show the following representation:
Here the shuffle product for polylogarithm functions is defined in the usual way. We do not want to go into the proof details concerning the equation above since we would have to state and use the precise definition of the shuffle product for multiple zeta values and polylogarithm functions; avoiding repetition, we skip the details and only refer the interested reader to , and Theorem 5.1. We want to remark that the result of Proposition 3.4 for implies that the shuffle identity for polylogarithm functions, and consequently also for multiple zeta values, can be developed entirely from finite sums using only basic partial fraction decomposition and the combinatorics behind the shuffle product and the shuffle algebra; see Hoffman  for an important discussion of the shuffle product. Note that by evaluating at , the shuffle identity for polylogarithm functions implies the shuffle identity for multiple zeta values. The identity above is well known; see for example the article . The shuffle identity for polylogarithm functions is due to the iterated Drinfeld integral representation of polylogarithm functions and multiple zeta values due to Kontsevich . As remarked in , the shuffle identity for polylogarithm functions can be deduced from the fact that the product of two simplex integrals consists of a sum of simplex integrals over all possible interlacings of the respective variables of integration.
Finally, we turn to the proof of Corollary 2.4. For and and , we have
and the stated result follows.
5. The Reciprocity Relation for Weighted Multiple Zeta Values
Of particular interest are the cases corresponding to a mixture of alternating and nonalternating signs, which are of particular importance in particle physics. We only state the result generalizing Theorem 2.1, with respect to the notations , , and the corresponding notations for and , and leave the generalizations of Corollaries 2.3 and 2.4 to the reader.
Theorem 5.1. The multiple zeta values and with weights and satisfy the following reciprocity relation: Here satisfies an analogue of the shuffle identity with respect to the weights and .
The proof of Theorem 2.1 can easily be adapted to the weighted case. Hence, we only elaborate on the main new difficulty, namely, the evaluation of the quantity
Proceeding as before, that is, taking differences and using partial fraction decomposition, we obtain the recurrence relation
Consequently, the value can be evaluated into sums of weighted finite multiple zeta values according to a shuffle identity with respect to the weights and . We omit the precise definition of this generalization and leave the details to the interested reader.
We presented a reciprocity relation for finite multiple zeta values, extending the previous results of [1, 3]. The reciprocity relation involves a shuffle product identity for (finite) multiple zeta values, for which we gave a proof using only partial fraction decomposition and the combinatorial properties of the shuffle product. Moreover, we also presented the reciprocity relation for weighted finite multiple zeta values.
The authors thank the referees for very valuable comments improving the presentation of this work, clearifying several points, and for providing additional references. The first author was supported by the Austrian Science Foundation FWF, Grant S9608-N13. The second author was supported by the South African Science Foundation NRF, Grant 2053748.
- P. Kirschenhofer and H. Prodinger, “Comparisons in Hoare's find algorithm,” Combinatorics, Probability and Computing, vol. 7, no. 1, pp. 111–120, 1998.
- C. A. R. Hoare, “Algorithm 64: quicksort,” Communications of the ACM, vol. 4, no. 7, pp. 321–322, 1961.
- M. Kuba, H. Prodinger, and C. Schneider, “Generalized reciprocity laws for sums of harmonic numbers,” Integers: The Electronic Journal of Combinatorial Number Theory, vol. 8, no. A17, pp. 1–20, 2008.
- J. M. Borwein, D. M. Bradley, D. J. Broadhurst, and P. Lisonek, “Combinatorial aspects of multiple zeta values,” Electronic Journal of Combinatorics, vol. 5, p. R38, 1998.
- J. M. Borwein, D. M. Bradley, D. J. Broadhurst, and P. Lisonek, “Special values of multiple polylogarithms,” Transactions of the American Mathematical Society, vol. 353, no. 3, pp. 907–941, 2001.
- D. Bowman and D. M. Bradley, “Multiple polylogarithms: a brief survey,” in Q-Series with Applications to Combinatorics, Number Theory, and Physics, vol. 291 of Contemporary Mathematics, pp. 71–92, 2001.
- D. Bowman and D. M. Bradley, “The algebra and combinatorics of shuffles and multiple zeta values,” Journal of Combinatorial Theory A, vol. 97, no. 1, pp. 43–61, 2002.
- D. Bowman, D. M. Bradley, and J. H. Ryoo, “Some multi-set inclusions associated with shuffle convolutions and multiple zeta values,” European Journal of Combinatorics, vol. 24, no. 1, pp. 121–127, 2003.
- D. Zagier, “Values of zeta functions and their applications,” in First European Congress of Mathematics Vol. II, pp. 497–512, Birkhäuser, Boston, Mass, USA, 1994.
- J. Blümlein and S. Kurth, “Harmonic sums and Mellin transforms up to two-loop order,” Physical Review D, vol. 60, Article ID 014018, 1999.
- J. A. M. Vermaseren, “Harmonic sums, Mellin transforms and integrals,” International Journal of Modern Physics A, vol. 14, no. 13, pp. 2037–2076, 1999.
- S. Moch, P. Uwer, and S. Weinzierl, “Nested sums, expansion of transcendental functions, and multiscale multiloop integrals,” Journal of Mathematical Physics, vol. 43, no. 6, pp. 3363–3386, 2002.
- M. E. Hoffman, “Quasi-shuffle products,” Journal of Algebraic Combinatorics, vol. 11, no. 1, pp. 49–68, 2000.
- T. H. Koornwinder and M. Schlosser, “On an identity by Chaundy and Bullard,” Indagationes Mathematicae. New Series, vol. 19, no. 2, pp. 239–261, 2008.
- N. Nielsen, Handbuch der Theorie der Gamma Funktion, Chelsea, New York, NY, USA, 1965.
- N. M. Hoang and M. Petitot, “Lyndon words, polylogarithms and the Riemann function,” Discrete Mathematics, vol. 217, no. 1–3, pp. 273–292, 2000.
- N. M. Hoang, M. Petitot, and J. Van Der Hoeven, “Shuffle algebra and polylogarithms,” in Proceedings of the 10th Conference on Formal Power Series and Algebraic Combinatorics (FPSAC '98), p. 12, Toronto, Canada, June 1998.