Discovering and Proving Infinite Pochhammer Sum Identities

TL;DR

This paper develops methods to transform complex nested Pochhammer sums into expressions involving well-known constants like pi, logs, and zeta values, using integral representations and harmonic polylogarithms, with implementation in HarmonicSums.

Contribution

It introduces a novel approach to simplify infinite Pochhammer sums by expressing them through cyclotomic harmonic polylogarithms and constants, with algorithms implemented in HarmonicSums.

Findings

Derivation of integral representations for nested sums.

Expression of sums in terms of known constants.

Implementation of methods in the HarmonicSums software.

Abstract

We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals or directly in terms of cyclotomic harmonic polylogarithms. Using substitutions, we express the root-valued iterated integrals as cyclotomic harmonic polylogarithms. Finally, by applying known relations among the cyclotomic harmonic polylogarithms, we derive expressions in terms of several constants. The methods are implemented in the computer algebra package HarmonicSums.

Equations

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{2}\right)}_n\sum _{i=1}^n\frac{\sum _{j=1}^i\frac{1}{j^2}}{i}}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{2}\right)}_n\sum _{i=1}^n\frac{\sum _{j=1}^i\frac{1}{j}}{i^3}}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{4}\right)}_n\sum _{i=1}^n\frac{1}{i^2}}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{3}\right)}_n\left(\sum _{i=1}^n\frac{1}{3i+1}-\sum _{i=1}^n\frac{1}{3i+2}\right)}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{2}\right)}_n\sum _{i=1}^n\frac{\sum _{j=1}^i\frac{1}{2j+1}}{2i+1}}{(2n+1{)}^{2}n!}$$

$$\sum _{i=1}^{\infty }\frac{{\left(\frac{1}{3}\right)}_n\sum _{i=1}^n\frac{\sum _{j=1}^i\frac{\sum _{k=1}^j\frac{\sum _{l=1}^k\frac{\sum _{m=1}^l\frac{1}{m}}{l}}{k}}{j}}{i}}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{2}\right)}_n{\sum }_{i=1}^n\frac{1}{i^9}}{(n+1)!}$$

$$\sum _{n=1}^{\infty }\frac{{\left(\frac{1}{2}\right)}_n}{n!}f(n)\text{ and }\sum _{n=1}^{\infty }\frac{{\left(-\frac{1}{2}\right)}_n}{n!}f(n),$$

$${\text{S}}_{(a_1,b_1,c_1),\dots ,(a_r,b_r,c_r)}\left(n\right):=\sum _{i_1=1}^n\frac{1}{(a_1{i}_1+b_1{)}^{c_1}}\sum _{i_2=1}^{i_1}\frac{1}{(a_2{i}_2+b_2{)}^{c_2}}\cdots \sum _{i_r=1}^{i_{r-1}}\frac{1}{(a_r{i}_r+b_r{)}^{c_r}}$$

$${\text{S}}_{c_1,c_2,\dots ,c_r}\left(n\right):={\text{S}}_{(1,0,c_1),(1,0,c_2),\dots ,(1,0,c_r)}\left(n\right),$$

$$\sum _{n=1}^{\infty }\frac{(p{)}_n}{(an+b{)}^c(n+d)!}f(n),$$

$$\frac{f^{\prime }(x)}{f(x)}=q(x),$$

$$\text{G}\left(f_1(\tau ),f_2(\tau ),\cdots ,f_k(\tau ),x\right)={\int }_0^x{f}_1({\tau }_1)\text{G}\left(f_2(\tau ),\cdots ,f_k(\tau ),{\tau }_1\right)d{\tau }_1,$$

$$\text{G}\left(f(\tau ),x\right):={\int }_0^x\left(f(t)-\frac{c}{t}\right)dt+c\log (x),$$

$$\text{G}\left(f_1(\tau ),\dots ,f_j(\tau ),x\right)$$

$$\frac{d}{dx}\text{G}\left(f_1(\tau ),\dots ,f_j(\tau ),x\right)=f_1(x)\text{G}\left(f_2(\tau ),\dots ,f_j(\tau ),x\right).$$

$$f_a^b:(0,1)\mapsto \mathbb{R}$$

$$\displaystyle f_{a}^{b}(x)=\left\{\begin{array}[]{ll}\frac{1}{x},&\textnormal{if }a=b=0\\ \frac{x^{b}}{\Phi_{a}(x)},&\textnormal{otherwise},\end{array}\right.$$

$${\Phi }_1(x)$$

$${\Phi }_2(x)$$

$${\Phi }_3(x)$$

$${\Phi }_4(x)$$

$${\Phi }_5(x)$$

$$\text{H}(x)$$

$${\text{H}}_{m_1,\dots ,m_k}(x)$$

$${\text{H}}_{m_1,\dots ,m_k}(1):=\underset{x\to 1}{\lim }{\text{H}}_{m_1,\dots ,m_k}(x).$$

$$\sum _{i=1}^{\infty }f(i)=\underset{x\to 1}{\lim }\sum _{i=1}^{\infty }{x}^{i}f(i).$$

$${\text{S}}_{c_1,c_2,\dots ,c_r}\left(n\right):=\sum _{i_1=1}^n\frac{\text{sign}(c_1{)}^{i_1}}{|i_1{|}^{c_1}}\sum _{i_2=1}^{i_1}\frac{\text{sign}(c_2{)}^{i_2}}{|i_2{|}^{c_2}}\cdots \sum _{i_r=1}^{i_{r-1}}\frac{\text{sign}(c_{r}1{)}^{i_r}}{|i_r{|}^{c_r}}.$$

$$p_d(x)f^{(d)}(x)+\cdots +p_1(x)f^{\prime }(x)+p_0(x)f(x)=0.$$

$$p_d(n)f_{n+d}+\cdots +p_1(n)f_{n+1}+p_0(n)f_n=0$$

$$f(x)=\sum _{n=0}^{\infty }{f}_n{x}^n$$

$$\sum _{n=1}^{\infty }\frac{(p{)}_n}{(an+b{)}^c(n+d)!}g(n),$$

$$f_n:=\frac{(p{)}_n}{(an+b{)}^c(n+d)!}g(n)$$

$$f(x):=\sum _{n=1}^{\infty }{x}^n{f}_n$$

$$\text{ComputeGeneratingFunction}\left[\frac{(p{)}_n}{(an+b{)}^c(n+d)!}g(n),x,\{n,1,\infty \}\right].$$

$$\sum _{n=1}^{\infty }\frac{{\left(-\frac{1}{2}\right)}_n{S}_1(n)}{(3+n{)}^2(n-1)!}$$

Full text

1 Infinite Nested Pochhammer Sums

The goal of this article is to find and prove identities of the following form:

[TABLE]

where $(x)_{n}$ denotes the Pochhammer symbol, $\textit{l}_{k}:=\log(k),\ \zeta_{k}:=\sum_{n=1}^{\infty}\frac{1}{n^{k}}$ and $C$ denotes Catalan’s constant.

Note that similar identities were given in [27, 1]. Such identities are of interest in physics: in particular, such sums have been studied in order to perform calculations of higher order corrections to scattering processes in particle physics [7, 18, 19, 20, 21, 22, 23, 28, 33]. Moreover similar identities were also considered in [15, 16, 26, 34, 35], and there is a connection to Apéry’s proof of the irrationality of $\zeta(3)$ (see [14]). [33, 34, 35].

While [1] basically deals with sums of the form

[TABLE]

we are going to consider a much wider class of sums in the frame of this paper. In addition we will state a general computer algebra method to evaluate a large class of sums in terms of nested integrals. Moreover, we will be able to prove a structural theorem, about when such a sum can be expressed in terms of so called cyclotomic polylogarithms.

The main purpose of this article is to present methods which can be automated, hence not all identities presented in this paper are new identities. To make more precise which class of sums we are considering, some definitions are in place. Let $r\in\mathbb{N}$ and let $a_{i},c_{i}\in\mathbb{N}$ and $b_{i}\in\mathbb{N}_{0}$ for $1\leqslant i\leqslant r$ then we call $\textnormal{S}_{(a_{1},b_{1},c_{1}),\ldots,(a_{r},b_{r},c_{r})}\left(n\right)$ defined as

[TABLE]

a cyclotomic harmonic sum (compare [5, 8, 7, 10]) of depth $r$. Note that if $a_{i}=1$ and $b_{i}=0$ for $1\leqslant i\leqslant r$ we write

[TABLE]

and we call $\textnormal{S}_{c_{1},c_{2},\ldots,c_{r}}\left(n\right)$ a multiple harmonic sum (see, e.g., [8, 6, 12, 13, 32]).

The sums we are considering take the form

[TABLE]

where $a,b,c,d\in\mathbb{N}_{0},\ p\in\mathbb{R}$ and $f(n)$ is a cyclotomic harmonic sum. We will refer to (3) as Pochhammer sum.

We are going to find representations of these Pochhammer sums in terms of special classes of integrals (that are similar to the iterated integrals in [9] and correspond to the iterated integrals in [1]). These classes of integrals are iterated integrals over hyperexponential functions. More precisely a function $f(x)$ is called hyperexponential if

[TABLE]

where $q(x)$ is a rational function in $x.$

Then an iterated integral over the hyperexponential functions $f_{1}(x),f_{2}(x),\ldots,f_{k}(x)$ is defined recursively by

[TABLE]

with the special case $\textnormal{G}\left(x\right)=1.$ Since some letters might have a non-integrable singularity at the base point $x=0$ we consistently define

[TABLE]

where $c$ takes the unique value such that the integrand on the right hand side is integrable at $t=0.$ It is important to note that this definition preserves the derivative $\frac{d}{dx}\textnormal{G}\left(f(\tau),x\right)~{}=~{}f(x).$ In general, we set

[TABLE]

where $k$ and $c_{0},\ldots,c_{k}$ are chosen to remove any non-integrable singularity. Again the result is unique and retains

[TABLE]

In the following we will define a subclass of iterated integrals (compare [10]). For $a\in\mathbb{N}$ and $b\in\mathbb{N},$ $b<\varphi(a),$ where $\varphi$ denotes Euler’s totient function, we define

[TABLE]

where $\Phi_{a}(x)$ denotes the $a$th cyclotomic polynomial, e.g., the first cyclotomic polynomials are given by

[TABLE]

Now, let $m_{i}=(a_{i},b_{i})\in\mathbb{N}^{2},$ $b_{i}<\varphi(a_{i});$ for $x\in(0,1)$ we define cyclotomic polylogarithms recursively as follows (compare e.g.,  [10]):

[TABLE]

We call $k$ the weight of a cyclotomic polylogarithm and in case the limit exists we extend the definition to $x=1$ and write

[TABLE]

Note that restricting the alphabet to the letters $(0,0),(1,0)$ and $(2,0)$ leads to harmonic polylogarithms [30].

The proposed strategy to prove and find Pochhammer sum identities reads as follows and follows the method proposed in [1]):

Step 1:

Rewrite the sums in terms of nested integrals.

Step 2:

Rewrite the integrals in terms of cyclotomic polylogarithms (see [1, Section 4]).

Step 3:

Provide a sufficiently strong database to eliminate relations among these cyclotomic polylogarithms and find reduced expressions (see Section 4).

This article focuses on Step 1 and we will present three different possibilities to find integral representations of Pochhammer sums. In order to accomplish this task, we view infinite sums as specializations of generating functions [1, 9]. Namely, if we are given an integral representation of the generating function of a sequence, then we can obtain an integral representation for the infinite sum over that sequence if the limit $x\to 1$ can be carried out. This approach to infinite sums can be summarized by the following formula:

[TABLE]

For details on Step 2 (implemented in the command SpecialGLToH in HarmonicSums) and on Step 3 we refer to [1]. It has to be mentioned that we computed and used relation tables of harmonic polylogarithms at one up to weight 12, for cyclotomic polylogarithms of cyclotomy 4 and 6 we computed and used relation tables of cyclotomic polylogarithms at 1 up to weight 6. The size of these tables amounts to several gigabytes. Note that the full strategy has been implemented in the Mathematica package HarmonicSums111The package HarmonicSums can be downloaded at

http://www.risc.jku.at/research/combinat/software/HarmonicSums.[4].

To complete this introduction we define a number of constants that will appear throughout this article:

[TABLE]

Here we extend the definition (2) to negative indices by

[TABLE]

Note that these constants do not possess any further relations induced by the algebraic properties given in [1, Section 4], namely shuffle, stuffle, multiple argument and duality relations.

In the following sections we will use different methods to compute integral representations of the generating function. In Section 2 we will use holonomic closure properties while in Section 3 and 4 we will use rewrite rules. In Section 4 we will consider a subclass of Pochhammer sums, for which we can directly find representations in terms of cyclotomic polylogarithms i.e., we do not have to deal with Step 2 of the proposed strategy.

2 Using Closure Properties of Holonomic Functions to derive Generating Functions

In the following we repeat important definitions and properties (compare [9, 3, 24]). Let $\mathbb{K}$ be a field of characteristic 0. A function $f=f(x)$ is called holonomic (or D-finite) if there exist polynomials $p_{d}(x),p_{d-1}(x),\ldots,p_{0}(x)\in\mathbb{K}[x]$ (not all $p_{i}$ being [math]) such that the following holonomic differential equation holds:

[TABLE]

We emphasize that the class of holonomic functions is rather large due to its closure properties. Namely, if we are given two such differential equations that contain holonomic functions $f(x)$ and $g(x)$ as solutions, one can compute holonomic differential equations that contain $f(x)+g(x)$, $f(x)g(x)$ or $\int_{0}^{x}f(y)dy$ as solutions. In other words any composition of these operations over known holonomic functions $f(x)$ and $g(x)$ is again a holonomic function $h(x)$. In particular, if for the inner building blocks $f(x)$ and $g(x)$ the holonomic differential equations are given, also the holonomic differential equation of $h(x)$ can be computed.

Of special importance is the connection to recurrences. A sequence $(f_{n})_{n\geqslant 0}$ with $f_{n}\in\mathbb{K}$ is called holonomic (or P-finite) if there exist polynomials $p_{d}(n),p_{d-1}(n),\ldots,p_{0}(n)\in\mathbb{K}[n]$ (not all $p_{i}$ being [math]) such that the holonomic recurrence

[TABLE]

holds for all $n\in\mathbb{N}$ (from a certain point on). In the following we utilize the fact that holonomic functions are precisely the generating functions of holonomic sequences: if $f(x)$ is holonomic, then the coefficients $f_{n}$ of the formal power series expansion

[TABLE]

form a holonomic sequence. Conversely, for a given holonomic sequence $(f_{n})_{n\geqslant 0}$, the function defined by the above sum (i.e., its generating function) is holonomic (this is true in the sense of formal power series, even if the sum has a zero radius of convergence). Note that given a holonomic differential equation for a holonomic function $f(x)$ it is straightforward to construct a holonomic recurrence for the coefficients of its power series expansion. For a recent overview of this holonomic machinery and further literature we refer to [24].

Since cyclotomic sums are holonomic sequences with respect to $n$ and the iterated integrals we consider are holonomic functions with respect to $x,$ we can use holonomic closure properties to derive integral representations of Pochhammer sums: Given a Pochhammer sum

[TABLE]

where $g(n)$ is a cyclotomic sum. We proceed as proposed in on page 1: define

[TABLE]

and try to find an iterated integral representation of

[TABLE]

using the following steps:

Compute a holonomic recurrence equation for $(f_{n})_{n\geqslant 0}.$ 2. 2.

Compute a holonomic differential for $f(x).$ 3. 3.

Compute initial values for the differential equation. 4. 4.

Solve the differential equation to get a closed form representation for $f(x).$

This procedure is implemented in the packages HarmonicSums and can be called by

[TABLE]

We will succeed in finding a closed form representation for $f(x)$ in terms of iterated integrals, if we can find a full solution set of the derived differential equation. The command ComputeGeneratingFunction internally uses the differential solver implemented in HarmonicSums, which finds all solutions of holonomic differential equations that can be expressed in terms of iterated integrals over hyperexponential alphabets [3, 9, 17, 31, 29]; these solutions are called d’Alembertian solutions [11], in addition for differential equations of order two it finds all solutions that are Liouvillian [2, 25, 31].

If we succeed in finding a closed form representation for $f(x)$ in terms of iterated integrals, we proceed with Step 2 and Step 3 of the proposed strategy. Hence we send $x\to 1$ and try to transform these iterated integrals to expression in terms of cyclotomic polylogarithms and finally we use relations between cyclotomic polylogarithms at one to derive an expression in terms of known constants.

The Pochhammer sum

[TABLE]

will deal as a representative example to illustrate all three different methods that are presented in this article. First, we work out the sum using the method presented above.

Example 1**.**

We consider the sum (13) and start to derive a recurrence for

[TABLE]

we find:

[TABLE]

Using the closure properties of holonomic functions we find the following differential equation

[TABLE]

satisfied by

[TABLE]

We can solve this differential equation for example using the differential equation solver implemented in HarmonicSums:

[TABLE]

By checking initial values we find

[TABLE]

At this point we send $x\to 1$ and use the command SpecialGLToH in HarmonicSums to derive an expression in terms of cyclotomic polylogarithms (compare [1, Section 3]). This leads to

[TABLE]

Finally, we can use relations between cyclotomic polylogarithms at one (compare [1, Section 4]) to derive

[TABLE]

Note that in the last step of this example we are actually only dealing with harmonic polylogarithms (see [30]).

Let us now list several identities that could be computed using this method:

[TABLE]

Several formulas that can be found in [27] can be also discovered and proved using the described method. Here we are going to list some of them:

[TABLE]

Note that this method can also be used to compute integral representations of sums of the form

[TABLE]

Here we find

[TABLE]

and sending for instance $x\to\frac{1}{2}$ we get:

[TABLE]

Finally, we consider

[TABLE]

proceeding as proposed, we find a differential equation of order 16:

[TABLE]

Solving this differential equation is possible but takes quite some time, so this indicates, that we might look for more feasible methods to find generating function representations for Pochhammer sums of that kind. In the following sections we will introduce rewrite rules, which will allow to compute generating function representations of Pochhammer sums without having to solve differential equations.

3 Using Rewrite Rules to derive Generating Functions

In this section we are going to state rewrite rules which will allow us to find integral representations of the generating functions of Pochhammer sums without having to solve differential equations. We will summarize these rewrite rules in the following lemmas. We start with the base cases where there is no inner sum present:

Lemma 2**.**

Let ${\mathbb{K}}$ be a field of characteristic 0. Then the following identities hold in the ring ${\mathbb{K}}[[x]]$ of formal power series with $a,c\in\mathbb{N}$ and $b,d\in\mathbb{Z}$:

[TABLE]

In case an inner sum is present we will make use of the following three lemmas.

Lemma 3**.**

Let ${\mathbb{K}}$ be a field of characteristic 0 and let $f:\mathbb{N}\to{\mathbb{K}}.$ Then the following identity holds in the ring ${\mathbb{K}}[[x]]$ of formal power series with $d<0$:

[TABLE]

Proof.

Both sides satisfy the following initial value problem for $y(x),$ which has a unique solution near $x=0:$

[TABLE]

∎

Lemma 4**.**

Let ${\mathbb{K}}$ be a field of characteristic 0 and let $f:\mathbb{N}\to{\mathbb{K}}.$ Then the following identity holds in the ring ${\mathbb{K}}[[x]]$ of formal power series with $d\geqslant 0$:

[TABLE]

Proof.

Both sides satisfy the following initial value problem for $y(x),$ which has a unique solution near $x=0:$

[TABLE]

∎

Lemma 5**.**

Let ${\mathbb{K}}$ be a field of characteristic 0 and let $f:\mathbb{N}\to{\mathbb{K}}.$ Then the following identity holds in the ring ${\mathbb{K}}[[x]]$ of formal power series with $a,c\in\mathbb{N}$ and $b\in\mathbb{Z}$:

[TABLE]

Proof.

Both sides satisfy the following initial value problem for $y(x),$ which has a unique solution near $x=0:$

[TABLE]

∎

Note that formulas related to the previous lemmas concerning binomial sums can be found in [9].

Let us now, for the second time, consider (13) and illustrate how the previous lemmas can be used as rewrite rules to find integral representations of Pochhammer sums.

Example 6**.**

We again look for a closed form representation in terms of iterated integrals of

[TABLE]

We start by using Lemma 5 twice:

[TABLE]

Now we apply Lemma 3 followed by applying (20) and (17)

[TABLE]

At this point we rewrite the expression in terms of iterated integrals (this can be done by hand or by using the command GLIntegrate of HarmonicSums) and arrive again at (14) and hence we can proceed as in Example 1 to arrive at

[TABLE]

Note that this method is implemented in the package HarmonicSums using the command PochhammerSumToGL. Calling

[TABLE]

will immediately give (14).

Reconsidering (16) we find

[TABLE]

Note that all the identities listed in Section 2 can also be computed using rewrite rules. But using these rewrite rules turns out to be much more efficient. We are now going to list several additional identities that could be computed with the help of this command:

[TABLE]

To conclude this section we consider the sum

[TABLE]

We find that it equals

[TABLE]

Here we fail to transform the iterated integrals in terms of cyclotomic polylogarithms, however, since the integrals are simple enough, we are able to perform the integrals in (30) for example by using Mathematica and find the result

[TABLE]

Another example where we fail to transform the iterated integrals in terms of cyclotomic polylogarithms but still can do the integrals is:

[TABLE]

In the following section we will consider a subclass of Pochhammer sums, for which we will always be able to derive a representation in terms of cyclotomic polylogarithms.

4 Using Rewrite Rules to directly derive Generating Functions in terms of Cyclotomic Polylogarithms

In this section we will deal with a sub class of the Pochhammer sums, namely we restrict the inner sum to be a multiple harmonic sum and we set $p=1/q$ with $q\in\mathbb{Z}\setminus\{0\}$ and $a=1$ in (3) i.e., we are considering sums of the form

[TABLE]

where $c,c_{i}\in\mathbb{N},\ b,d\in\mathbb{Z}$ and $p=\frac{1}{q}$ with $q\in\mathbb{Z}\setminus\{0\}.$ Considering a Pochhammer sum in this subclass we could again use the rewrite rules presented in Section 3 to find an integral representation, however we can also use the following lemmas. These new rewrite rules will directly lead to cyclotomic polylogarithms. We again start with the base cases where no inner sum is present (compare Lemma 2):

Lemma 7**.**

Let ${\mathbb{K}}$ be a field of characteristic 0. Then the following identities hold in the ring ${\mathbb{K}}[[x]]$ of formal power series with $c\in\mathbb{N}$ and $b,d\in\mathbb{Z}$:

[TABLE]

In the cases where there is an inner multiple harmonic sum present we can refine the Lemmas 3, 4 and 5 and get the following result.

Lemma 8**.**

Let ${\mathbb{K}}$ be a field of characteristic 0 and let $f:\mathbb{N}\to{\mathbb{K}}.$ Then the following identities hold in the ring ${\mathbb{K}}[[x]]$ of formal power series with $c\in\mathbb{N},\ b,d\in\mathbb{Z}$ and $\textnormal{S}_{m_{1},\ldots,m_{r}}\left(n\right)$ a multiple harmonic sum:

[TABLE]

Here we use the abbreviations $s(n):=\textnormal{S}_{m_{1},\ldots,m_{r}}\left(n\right)$ and $\bar{s}(n):=\textnormal{S}_{m_{2},\ldots,m_{r}}\left(n\right).$

Proof.

For all these equalities it is possible to find an initial value problem, which has a unique solution near $x=0$ and is satisfied by both sides of the respective equation. ∎

Note that the polynomials arising in the left hand sides of the equations in Lemma 7 and Lemma 8 are of the form $t^{i}$ or $(1-t^{i})^{k}$ for $i,k\in\mathbb{Z},$ hence integrating over these integrands will lead to cyclotomic polylogarithms. Therefore the Pochhammer sums of the form (31) will be expressible in terms of cyclotomic polylogarithms, and we can state the following structural theorem.

Theorem 9**.**

Any sum of the form

[TABLE]

where $c,c_{i}\in\mathbb{N},\ b,d\in\mathbb{Z}$ and $q\in\mathbb{Z}\setminus\{0\},$ can be expressed in terms of cyclotomic polylogarithms at one.

Let us now, for the third time, consider (13) and illustrate how the previous lemmas can be used as rewrite rules to directly find a representation in terms of cyclotomic polylogarithms.

Example 10**.**

We seek a closed form representation in terms of cyclotomic polylogarithms of

[TABLE]

so we use (36) twice:

[TABLE]

Now we apply (34) followed by applying (33) and (17):

[TABLE]

Now we can send $x\to 1$ and rewrite this expression directly in terms of cyclotomic harmonic polylogarithms (again this can be done by hand or by using the command GLIntegrate of HarmonicSums) and arrive again at

[TABLE]

Finally, we can again use relations between cyclotomic polylogarithms at one to derive (15).

Note that this is implemented in the command PochhammerSumToH, so calling

[TABLE]

will immediately give (38).

To conclude we are going to list several identities that could be computed with the help of this command (note that these identities could have also be computed using the methods presented in the previous sections):

[TABLE]

Acknowledgements

The author would like to thank C. Schneider for useful discussions.