ginac/inifcns_nstdsums.cpp

   1 /** @file inifcns_nstdsums.cpp
   2  *
   3  *  Implementation of some special functions that have a representation as nested sums.
   4  *
   5  *  The functions are:
   6  *    classical polylogarithm              Li(n,x)
   7  *    multiple polylogarithm               Li(lst(m_1,...,m_k),lst(x_1,...,x_k))
   8  *    nielsen's generalized polylogarithm  S(n,p,x)
   9  *    harmonic polylogarithm               H(m,x) or H(lst(m_1,...,m_k),x)
  10  *    multiple zeta value                  zeta(m) or zeta(lst(m_1,...,m_k))
  11  *    alternating Euler sum                zeta(m,s) or zeta(lst(m_1,...,m_k),lst(s_1,...,s_k))
  12  *
  13  *  Some remarks:
  14  *
  15  *    - All formulae used can be looked up in the following publications:
  16  *      [Kol] Nielsen's Generalized Polylogarithms, K.S.Kolbig, SIAM J.Math.Anal. 17 (1986), pp. 1232-1258.
  17  *      [Cra] Fast Evaluation of Multiple Zeta Sums, R.E.Crandall, Math.Comp. 67 (1998), pp. 1163-1172.
  18  *      [ReV] Harmonic Polylogarithms, E.Remiddi, J.A.M.Vermaseren, Int.J.Mod.Phys. A15 (2000), pp. 725-754
  19  *      [BBB] Special Values of Multiple Polylogarithms, J.Borwein, D.Bradley, D.Broadhurst, P.Lisonek, Trans.Amer.Math.Soc. 353/3 (2001), pp. 907-941
  20  *
  21  *    - The order of parameters and arguments of Li and zeta is defined according to the nested sums
  22  *      representation. The parameters for H are understood as in [ReV]. They can be in expanded --- only
  23  *      0, 1 and -1 --- or in compactified --- a string with zeros in front of 1 or -1 is written as a single
  24  *      number --- notation.
  25  *
  26  *    - Except for the multiple polylogarithm all functions can be nummerically evaluated with arguments in
  27  *      the whole complex plane. Multiple polylogarithms evaluate only if for each argument x_i the product
  28  *      x_1 * x_2 * ... * x_i is smaller than one. The parameters for Li, zeta and S must be positive integers.
  29  *      If you want to have an alternating Euler sum, you have to give the signs of the parameters as a
  30  *      second argument s to zeta(m,s) containing 1 and -1.
  31  *
  32  *    - The calculation of classical polylogarithms is speed up by using Bernoulli numbers and
  33  *      look-up tables. S uses look-up tables as well. The zeta function applies the algorithms in
  34  *      [Cra] and [BBB] for speed up.
  35  *
  36  *    - The functions have no series expansion into nested sums. To do this, you have to convert these functions
  37  *      into the appropriate objects from the nestedsums library, do the expansion and convert the
  38  *      result back.
  39  *
  40  *    - Numerical testing of this implementation has been performed by doing a comparison of results
  41  *      between this software and the commercial M.......... 4.1. Multiple zeta values have been checked
  42  *      by means of evaluations into simple zeta values. Harmonic polylogarithms have been checked by
  43  *      comparison to S(n,p,x) for corresponding parameter combinations and by continuity checks
  44  *      around |x|=1 along with comparisons to corresponding zeta functions.
  45  *
  46  */
  47
  48 /*
  49  *  GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
  50  *
  51  *  This program is free software; you can redistribute it and/or modify
  52  *  it under the terms of the GNU General Public License as published by
  53  *  the Free Software Foundation; either version 2 of the License, or
  54  *  (at your option) any later version.
  55  *
  56  *  This program is distributed in the hope that it will be useful,
  57  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  58  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  59  *  GNU General Public License for more details.
  60  *
  61  *  You should have received a copy of the GNU General Public License
  62  *  along with this program; if not, write to the Free Software
  63  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  64  */
  65
  66 #include <stdexcept>
  67 #include <vector>
  68 #include <cln/cln.h>
  69
  70 #include "inifcns.h"
  71
  72 #include "add.h"
  73 #include "constant.h"
  74 #include "lst.h"
  75 #include "mul.h"
  76 #include "numeric.h"
  77 #include "operators.h"
  78 #include "power.h"
  79 #include "pseries.h"
  80 #include "relational.h"
  81 #include "symbol.h"
  82 #include "utils.h"
  83 #include "wildcard.h"
  84
  85
  86 namespace GiNaC {
  87
  88
  89 //////////////////////////////////////////////////////////////////////
  90 //
  91 // Classical polylogarithm  Li(n,x)
  92 //
  93 // helper functions
  94 //
  95 //////////////////////////////////////////////////////////////////////
  96
  97
  98 // anonymous namespace for helper functions
  99 namespace {
 100
 101
 102 // lookup table for factors built from Bernoulli numbers
 103 // see fill_Xn()
 104 std::vector<std::vector<cln::cl_N> > Xn;
 105 int xnsize = 0;
 106
 107
 108 // This function calculates the X_n. The X_n are needed for speed up of classical polylogarithms.
 109 // With these numbers the polylogs can be calculated as follows:
 110 //   Li_p (x)  =  \sum_{n=0}^\infty X_{p-2}(n) u^{n+1}/(n+1)! with  u = -log(1-x)
 111 //   X_0(n) = B_n (Bernoulli numbers)
 112 //   X_p(n) = \sum_{k=0}^n binomial(n,k) B_{n-k} / (k+1) * X_{p-1}(k)
 113 // The calculation of Xn depends on X0 and X{n-1}.
 114 // X_0 is special, it holds only the non-zero Bernoulli numbers with index 2 or greater.
 115 // This results in a slightly more complicated algorithm for the X_n.
 116 // The first index in Xn corresponds to the index of the polylog minus 2.
 117 // The second index in Xn corresponds to the index from the actual sum.
 118 void fill_Xn(int n)
 119 {
 120         // rule of thumb. needs to be improved. TODO
 121         const int initsize = Digits * 3 / 2;
 122
 123         if (n>1) {
 124                 // calculate X_2 and higher (corresponding to Li_4 and higher)
 125                 std::vector<cln::cl_N> buf(initsize);
 126                 std::vector<cln::cl_N>::iterator it = buf.begin();
 127                 cln::cl_N result;
 128                 *it = -(cln::expt(cln::cl_I(2),n+1) - 1) / cln::expt(cln::cl_I(2),n+1); // i == 1
 129                 it++;
 130                 for (int i=2; i<=initsize; i++) {
 131                         if (i&1) {
 132                                 result = 0; // k == 0
 133                         } else {
 134                                 result = Xn[0][i/2-1]; // k == 0
 135                         }
 136                         for (int k=1; k<i-1; k++) {
 137                                 if ( !(((i-k) & 1) && ((i-k) > 1)) ) {
 138                                         result = result + cln::binomial(i,k) * Xn[0][(i-k)/2-1] * Xn[n-1][k-1] / (k+1);
 139                                 }
 140                         }
 141                         result = result - cln::binomial(i,i-1) * Xn[n-1][i-2] / 2 / i; // k == i-1
 142                         result = result + Xn[n-1][i-1] / (i+1); // k == i
 143
 144                         *it = result;
 145                         it++;
 146                 }
 147                 Xn.push_back(buf);
 148         } else if (n==1) {
 149                 // special case to handle the X_0 correct
 150                 std::vector<cln::cl_N> buf(initsize);
 151                 std::vector<cln::cl_N>::iterator it = buf.begin();
 152                 cln::cl_N result;
 153                 *it = cln::cl_I(-3)/cln::cl_I(4); // i == 1
 154                 it++;
 155                 *it = cln::cl_I(17)/cln::cl_I(36); // i == 2
 156                 it++;
 157                 for (int i=3; i<=initsize; i++) {
 158                         if (i & 1) {
 159                                 result = -Xn[0][(i-3)/2]/2;
 160                                 *it = (cln::binomial(i,1)/cln::cl_I(2) + cln::binomial(i,i-1)/cln::cl_I(i))*result;
 161                                 it++;
 162                         } else {
 163                                 result = Xn[0][i/2-1] + Xn[0][i/2-1]/(i+1);
 164                                 for (int k=1; k<i/2; k++) {
 165                                         result = result + cln::binomial(i,k*2) * Xn[0][k-1] * Xn[0][i/2-k-1] / (k*2+1);
 166                                 }
 167                                 *it = result;
 168                                 it++;
 169                         }
 170                 }
 171                 Xn.push_back(buf);
 172         } else {
 173                 // calculate X_0
 174                 std::vector<cln::cl_N> buf(initsize/2);
 175                 std::vector<cln::cl_N>::iterator it = buf.begin();
 176                 for (int i=1; i<=initsize/2; i++) {
 177                         *it = bernoulli(i*2).to_cl_N();
 178                         it++;
 179                 }
 180                 Xn.push_back(buf);
 181         }
 182
 183         xnsize++;
 184 }
 185
 186
 187 // calculates Li(2,x) without Xn
 188 cln::cl_N Li2_do_sum(const cln::cl_N& x)
 189 {
 190         cln::cl_N res = x;
 191         cln::cl_N resbuf;
 192         cln::cl_N num = x;
 193         cln::cl_I den = 1; // n^2 = 1
 194         unsigned i = 3;
 195         do {
 196                 resbuf = res;
 197                 num = num * x;
 198                 den = den + i;  // n^2 = 4, 9, 16, ...
 199                 i += 2;
 200                 res = res + num / den;
 201         } while (res != resbuf);
 202         return res;
 203 }
 204
 205
 206 // calculates Li(2,x) with Xn
 207 cln::cl_N Li2_do_sum_Xn(const cln::cl_N& x)
 208 {
 209         std::vector<cln::cl_N>::const_iterator it = Xn[0].begin();
 210         cln::cl_N u = -cln::log(1-x);
 211         cln::cl_N factor = u;
 212         cln::cl_N res = u - u*u/4;
 213         cln::cl_N resbuf;
 214         unsigned i = 1;
 215         do {
 216                 resbuf = res;
 217                 factor = factor * u*u / (2*i * (2*i+1));
 218                 res = res + (*it) * factor;
 219                 it++; // should we check it? or rely on initsize? ...
 220                 i++;
 221         } while (res != resbuf);
 222         return res;
 223 }
 224
 225
 226 // calculates Li(n,x), n>2 without Xn
 227 cln::cl_N Lin_do_sum(int n, const cln::cl_N& x)
 228 {
 229         cln::cl_N factor = x;
 230         cln::cl_N res = x;
 231         cln::cl_N resbuf;
 232         int i=2;
 233         do {
 234                 resbuf = res;
 235                 factor = factor * x;
 236                 res = res + factor / cln::expt(cln::cl_I(i),n);
 237                 i++;
 238         } while (res != resbuf);
 239         return res;
 240 }
 241
 242
 243 // calculates Li(n,x), n>2 with Xn
 244 cln::cl_N Lin_do_sum_Xn(int n, const cln::cl_N& x)
 245 {
 246         std::vector<cln::cl_N>::const_iterator it = Xn[n-2].begin();
 247         cln::cl_N u = -cln::log(1-x);
 248         cln::cl_N factor = u;
 249         cln::cl_N res = u;
 250         cln::cl_N resbuf;
 251         unsigned i=2;
 252         do {
 253                 resbuf = res;
 254                 factor = factor * u / i;
 255                 res = res + (*it) * factor;
 256                 it++; // should we check it? or rely on initsize? ...
 257                 i++;
 258         } while (res != resbuf);
 259         return res;
 260 }
 261
 262
 263 // forward declaration needed by function Li_projection and C below
 264 numeric S_num(int n, int p, const numeric& x);
 265
 266
 267 // helper function for classical polylog Li
 268 cln::cl_N Li_projection(int n, const cln::cl_N& x, const cln::float_format_t& prec)
 269 {
 270         // treat n=2 as special case
 271         if (n == 2) {
 272                 // check if precalculated X0 exists
 273                 if (xnsize == 0) {
 274                         fill_Xn(0);
 275                 }
 276
 277                 if (cln::realpart(x) < 0.5) {
 278                         // choose the faster algorithm
 279                         // the switching point was empirically determined. the optimal point
 280                         // depends on hardware, Digits, ... so an approx value is okay.
 281                         // it solves also the problem with precision due to the u=-log(1-x) transformation
 282                         if (cln::abs(cln::realpart(x)) < 0.25) {
 283
 284                                 return Li2_do_sum(x);
 285                         } else {
 286                                 return Li2_do_sum_Xn(x);
 287                         }
 288                 } else {
 289                         // choose the faster algorithm
 290                         if (cln::abs(cln::realpart(x)) > 0.75) {
 291                                 return -Li2_do_sum(1-x) - cln::log(x) * cln::log(1-x) + cln::zeta(2);
 292                         } else {
 293                                 return -Li2_do_sum_Xn(1-x) - cln::log(x) * cln::log(1-x) + cln::zeta(2);
 294                         }
 295                 }
 296         } else {
 297                 // check if precalculated Xn exist
 298                 if (n > xnsize+1) {
 299                         for (int i=xnsize; i<n-1; i++) {
 300                                 fill_Xn(i);
 301                         }
 302                 }
 303
 304                 if (cln::realpart(x) < 0.5) {
 305                         // choose the faster algorithm
 306                         // with n>=12 the "normal" summation always wins against the method with Xn
 307                         if ((cln::abs(cln::realpart(x)) < 0.3) || (n >= 12)) {
 308                                 return Lin_do_sum(n, x);
 309                         } else {
 310                                 return Lin_do_sum_Xn(n, x);
 311                         }
 312                 } else {
 313                         cln::cl_N result = -cln::expt(cln::log(x), n-1) * cln::log(1-x) / cln::factorial(n-1);
 314                         for (int j=0; j<n-1; j++) {
 315                                 result = result + (S_num(n-j-1, 1, 1).to_cl_N() - S_num(1, n-j-1, 1-x).to_cl_N())
 316                                                   * cln::expt(cln::log(x), j) / cln::factorial(j);
 317                         }
 318                         return result;
 319                 }
 320         }
 321 }
 322
 323
 324 // helper function for classical polylog Li
 325 numeric Li_num(int n, const numeric& x)
 326 {
 327         if (n == 1) {
 328                 // just a log
 329                 return -cln::log(1-x.to_cl_N());
 330         }
 331         if (x.is_zero()) {
 332                 return 0;
 333         }
 334         if (x == 1) {
 335                 // [Kol] (2.22)
 336                 return cln::zeta(n);
 337         }
 338         else if (x == -1) {
 339                 // [Kol] (2.22)
 340                 return -(1-cln::expt(cln::cl_I(2),1-n)) * cln::zeta(n);
 341         }
 342
 343         // what is the desired float format?
 344         // first guess: default format
 345         cln::float_format_t prec = cln::default_float_format;
 346         const cln::cl_N value = x.to_cl_N();
 347         // second guess: the argument's format
 348         if (!x.real().is_rational())
 349                 prec = cln::float_format(cln::the<cln::cl_F>(cln::realpart(value)));
 350         else if (!x.imag().is_rational())
 351                 prec = cln::float_format(cln::the<cln::cl_F>(cln::imagpart(value)));
 352
 353         // [Kol] (5.15)
 354         if (cln::abs(value) > 1) {
 355                 cln::cl_N result = -cln::expt(cln::log(-value),n) / cln::factorial(n);
 356                 // check if argument is complex. if it is real, the new polylog has to be conjugated.
 357                 if (cln::zerop(cln::imagpart(value))) {
 358                         if (n & 1) {
 359                                 result = result + conjugate(Li_projection(n, cln::recip(value), prec));
 360                         }
 361                         else {
 362                                 result = result - conjugate(Li_projection(n, cln::recip(value), prec));
 363                         }
 364                 }
 365                 else {
 366                         if (n & 1) {
 367                                 result = result + Li_projection(n, cln::recip(value), prec);
 368                         }
 369                         else {
 370                                 result = result - Li_projection(n, cln::recip(value), prec);
 371                         }
 372                 }
 373                 cln::cl_N add;
 374                 for (int j=0; j<n-1; j++) {
 375                         add = add + (1+cln::expt(cln::cl_I(-1),n-j)) * (1-cln::expt(cln::cl_I(2),1-n+j))
 376                                     * Li_num(n-j,1).to_cl_N() * cln::expt(cln::log(-value),j) / cln::factorial(j);
 377                 }
 378                 result = result - add;
 379                 return result;
 380         }
 381         else {
 382                 return Li_projection(n, value, prec);
 383         }
 384 }
 385
 386
 387 } // end of anonymous namespace
 388
 389
 390 //////////////////////////////////////////////////////////////////////
 391 //
 392 // Multiple polylogarithm  Li(n,x)
 393 //
 394 // helper function
 395 //
 396 //////////////////////////////////////////////////////////////////////
 397
 398
 399 // anonymous namespace for helper function
 400 namespace {
 401
 402
 403 cln::cl_N multipleLi_do_sum(const std::vector<int>& s, const std::vector<cln::cl_N>& x)
 404 {
 405         const int j = s.size();
 406
 407         std::vector<cln::cl_N> t(j);
 408         cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
 409
 410         cln::cl_N t0buf;
 411         int q = 0;
 412         do {
 413                 t0buf = t[0];
 414                 // do it once ...
 415                 q++;
 416                 t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
 417                 for (int k=j-2; k>=0; k--) {
 418                         t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
 419                 }
 420                 // ... and do it again (to avoid premature drop out due to special arguments)
 421                 q++;
 422                 t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
 423                 for (int k=j-2; k>=0; k--) {
 424                         t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
 425                 }
 426         } while (t[0] != t0buf);
 427
 428         return t[0];
 429 }
 430
 431 // forward declaration for Li_eval()
 432 lst convert_parameter_Li_to_H(const lst& m, const lst& x, ex& pf);
 433
 434
 435 } // end of anonymous namespace
 436
 437
 438 //////////////////////////////////////////////////////////////////////
 439 //
 440 // Classical polylogarithm and multiple polylogarithm  Li(n,x)
 441 //
 442 // GiNaC function
 443 //
 444 //////////////////////////////////////////////////////////////////////
 445
 446
 447 static ex Li_evalf(const ex& x1, const ex& x2)
 448 {
 449         // classical polylogs
 450         if (is_a<numeric>(x1) && is_a<numeric>(x2)) {
 451                 return Li_num(ex_to<numeric>(x1).to_int(), ex_to<numeric>(x2));
 452         }
 453         // multiple polylogs
 454         else if (is_a<lst>(x1) && is_a<lst>(x2)) {
 455                 ex conv = 1;
 456                 for (int i=0; i<x1.nops(); i++) {
 457                         if (!x1.op(i).info(info_flags::posint)) {
 458                                 return Li(x1, x2).hold();
 459                         }
 460                         if (!is_a<numeric>(x2.op(i))) {
 461                                 return Li(x1, x2).hold();
 462                         }
 463                         conv *= x2.op(i);
 464                         if (conv >= 1) {
 465                                 return Li(x1, x2).hold();
 466                         }
 467                 }
 468
 469                 std::vector<int> m;
 470                 std::vector<cln::cl_N> x;
 471                 for (int i=0; i<ex_to<numeric>(x1.nops()).to_int(); i++) {
 472                         m.push_back(ex_to<numeric>(x1.op(i)).to_int());
 473                         x.push_back(ex_to<numeric>(x2.op(i)).to_cl_N());
 474                 }
 475
 476                 return numeric(multipleLi_do_sum(m, x));
 477         }
 478
 479         return Li(x1,x2).hold();
 480 }
 481
 482
 483 static ex Li_eval(const ex& m_, const ex& x_)
 484 {
 485         if (m_.nops() < 2) {
 486                 ex m;
 487                 if (is_a<lst>(m_)) {
 488                         m = m_.op(0);
 489                 } else {
 490                         m = m_;
 491                 }
 492                 ex x;
 493                 if (is_a<lst>(x_)) {
 494                         x = x_.op(0);
 495                 } else {
 496                         x = x_;
 497                 }
 498                 if (x == _ex0) {
 499                         return _ex0;
 500                 }
 501                 if (x == _ex1) {
 502                         return zeta(m);
 503                 }
 504                 if (x == _ex_1) {
 505                         return (pow(2,1-m)-1) * zeta(m);
 506                 }
 507                 if (m == _ex1) {
 508                         return -log(1-x);
 509                 }
 510                 if (m.info(info_flags::posint) && x.info(info_flags::numeric) && (!x.info(info_flags::crational))) {
 511                         return Li_num(ex_to<numeric>(m).to_int(), ex_to<numeric>(x));
 512                 }
 513         } else {
 514                 bool ish = true;
 515                 bool iszeta = true;
 516                 bool iszero = false;
 517                 bool doevalf = false;
 518                 bool doevalfveto = true;
 519                 const lst& m = ex_to<lst>(m_);
 520                 const lst& x = ex_to<lst>(x_);
 521                 lst::const_iterator itm = m.begin();
 522                 lst::const_iterator itx = x.begin();
 523                 for (; itm != m.end(); itm++, itx++) {
 524                         if (!(*itm).info(info_flags::posint)) {
 525                                 return Li(m_, x_).hold();
 526                         }
 527                         if ((*itx != _ex1) && (*itx != _ex_1)) {
 528                                 if (itx != x.begin()) {
 529                                         ish = false;
 530                                 }
 531                                 iszeta = false;
 532                         }
 533                         if (*itx == _ex0) {
 534                                 iszero = true;
 535                         }
 536                         if (!(*itx).info(info_flags::numeric)) {
 537                                 doevalfveto = false;
 538                         }
 539                         if (!(*itx).info(info_flags::crational)) {
 540                                 doevalf = true;
 541                         }
 542                 }
 543                 if (iszeta) {
 544                         return zeta(m_, x_);
 545                 }
 546                 if (iszero) {
 547                         return _ex0;
 548                 }
 549                 if (ish) {
 550                         ex pf;
 551                         lst newm = convert_parameter_Li_to_H(m, x, pf);
 552                         return pf * H(newm, x[0]);
 553                 }
 554                 if (doevalfveto && doevalf) {
 555                         return Li(m_, x_).evalf();
 556                 }
 557         }
 558         return Li(m_, x_).hold();
 559 }
 560
 561
 562 static ex Li_series(const ex& m, const ex& x, const relational& rel, int order, unsigned options)
 563 {
 564         epvector seq;
 565         seq.push_back(expair(Li(m, x), 0));
 566         return pseries(rel, seq);
 567 }
 568
 569
 570 static ex Li_deriv(const ex& m_, const ex& x_, unsigned deriv_param)
 571 {
 572         GINAC_ASSERT(deriv_param < 2);
 573         if (deriv_param == 0) {
 574                 return _ex0;
 575         }
 576         if (m_.nops() > 1) {
 577                 throw std::runtime_error("don't know how to derivate multiple polylogarithm!");
 578         }
 579         ex m;
 580         if (is_a<lst>(m_)) {
 581                 m = m_.op(0);
 582         } else {
 583                 m = m_;
 584         }
 585         ex x;
 586         if (is_a<lst>(x_)) {
 587                 x = x_.op(0);
 588         } else {
 589                 x = x_;
 590         }
 591         if (m > 0) {
 592                 return Li(m-1, x) / x;
 593         } else {
 594                 return 1/(1-x);
 595         }
 596 }
 597
 598
 599 static void Li_print_latex(const ex& m_, const ex& x_, const print_context& c)
 600 {
 601         lst m;
 602         if (is_a<lst>(m_)) {
 603                 m = ex_to<lst>(m_);
 604         } else {
 605                 m = lst(m_);
 606         }
 607         lst x;
 608         if (is_a<lst>(x_)) {
 609                 x = ex_to<lst>(x_);
 610         } else {
 611                 x = lst(x_);
 612         }
 613         c.s << "\\mbox{Li}_{";
 614         lst::const_iterator itm = m.begin();
 615         (*itm).print(c);
 616         itm++;
 617         for (; itm != m.end(); itm++) {
 618                 c.s << ",";
 619                 (*itm).print(c);
 620         }
 621         c.s << "}(";
 622         lst::const_iterator itx = x.begin();
 623         (*itx).print(c);
 624         itx++;
 625         for (; itx != x.end(); itx++) {
 626                 c.s << ",";
 627                 (*itx).print(c);
 628         }
 629         c.s << ")";
 630 }
 631
 632
 633 REGISTER_FUNCTION(Li,
 634                   evalf_func(Li_evalf).
 635                   eval_func(Li_eval).
 636                   series_func(Li_series).
 637                   derivative_func(Li_deriv).
 638                   print_func<print_latex>(Li_print_latex).
 639                   do_not_evalf_params());
 640
 641
 642 //////////////////////////////////////////////////////////////////////
 643 //
 644 // Nielsen's generalized polylogarithm  S(n,p,x)
 645 //
 646 // helper functions
 647 //
 648 //////////////////////////////////////////////////////////////////////
 649
 650
 651 // anonymous namespace for helper functions
 652 namespace {
 653
 654
 655 // lookup table for special Euler-Zagier-Sums (used for S_n,p(x))
 656 // see fill_Yn()
 657 std::vector<std::vector<cln::cl_N> > Yn;
 658 int ynsize = 0; // number of Yn[]
 659 int ynlength = 100; // initial length of all Yn[i]
 660
 661
 662 // This function calculates the Y_n. The Y_n are needed for the evaluation of S_{n,p}(x).
 663 // The Y_n are basically Euler-Zagier sums with all m_i=1. They are subsums in the Z-sum
 664 // representing S_{n,p}(x).
 665 // The first index in Y_n corresponds to the parameter p minus one, i.e. the depth of the
 666 // equivalent Z-sum.
 667 // The second index in Y_n corresponds to the running index of the outermost sum in the full Z-sum
 668 // representing S_{n,p}(x).
 669 // The calculation of Y_n uses the values from Y_{n-1}.
 670 void fill_Yn(int n, const cln::float_format_t& prec)
 671 {
 672         const int initsize = ynlength;
 673         //const int initsize = initsize_Yn;
 674         cln::cl_N one = cln::cl_float(1, prec);
 675
 676         if (n) {
 677                 std::vector<cln::cl_N> buf(initsize);
 678                 std::vector<cln::cl_N>::iterator it = buf.begin();
 679                 std::vector<cln::cl_N>::iterator itprev = Yn[n-1].begin();
 680                 *it = (*itprev) / cln::cl_N(n+1) * one;
 681                 it++;
 682                 itprev++;
 683                 // sums with an index smaller than the depth are zero and need not to be calculated.
 684                 // calculation starts with depth, which is n+2)
 685                 for (int i=n+2; i<=initsize+n; i++) {
 686                         *it = *(it-1) + (*itprev) / cln::cl_N(i) * one;
 687                         it++;
 688                         itprev++;
 689                 }
 690                 Yn.push_back(buf);
 691         } else {
 692                 std::vector<cln::cl_N> buf(initsize);
 693                 std::vector<cln::cl_N>::iterator it = buf.begin();
 694                 *it = 1 * one;
 695                 it++;
 696                 for (int i=2; i<=initsize; i++) {
 697                         *it = *(it-1) + 1 / cln::cl_N(i) * one;
 698                         it++;
 699                 }
 700                 Yn.push_back(buf);
 701         }
 702         ynsize++;
 703 }
 704
 705
 706 // make Yn longer ...
 707 void make_Yn_longer(int newsize, const cln::float_format_t& prec)
 708 {
 709
 710         cln::cl_N one = cln::cl_float(1, prec);
 711
 712         Yn[0].resize(newsize);
 713         std::vector<cln::cl_N>::iterator it = Yn[0].begin();
 714         it += ynlength;
 715         for (int i=ynlength+1; i<=newsize; i++) {
 716                 *it = *(it-1) + 1 / cln::cl_N(i) * one;
 717                 it++;
 718         }
 719
 720         for (int n=1; n<ynsize; n++) {
 721                 Yn[n].resize(newsize);
 722                 std::vector<cln::cl_N>::iterator it = Yn[n].begin();
 723                 std::vector<cln::cl_N>::iterator itprev = Yn[n-1].begin();
 724                 it += ynlength;
 725                 itprev += ynlength;
 726                 for (int i=ynlength+n+1; i<=newsize+n; i++) {
 727                         *it = *(it-1) + (*itprev) / cln::cl_N(i) * one;
 728                         it++;
 729                         itprev++;
 730                 }
 731         }
 732
 733         ynlength = newsize;
 734 }
 735
 736
 737 // helper function for S(n,p,x)
 738 // [Kol] (7.2)
 739 cln::cl_N C(int n, int p)
 740 {
 741         cln::cl_N result;
 742
 743         for (int k=0; k<p; k++) {
 744                 for (int j=0; j<=(n+k-1)/2; j++) {
 745                         if (k == 0) {
 746                                 if (n & 1) {
 747                                         if (j & 1) {
 748                                                 result = result - 2 * cln::expt(cln::pi(),2*j) * S_num(n-2*j,p,1).to_cl_N() / cln::factorial(2*j);
 749                                         }
 750                                         else {
 751                                                 result = result + 2 * cln::expt(cln::pi(),2*j) * S_num(n-2*j,p,1).to_cl_N() / cln::factorial(2*j);
 752                                         }
 753                                 }
 754                         }
 755                         else {
 756                                 if (k & 1) {
 757                                         if (j & 1) {
 758                                                 result = result + cln::factorial(n+k-1)
 759                                                                   * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1).to_cl_N()
 760                                                                   / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
 761                                         }
 762                                         else {
 763                                                 result = result - cln::factorial(n+k-1)
 764                                                                   * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1).to_cl_N()
 765                                                                   / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
 766                                         }
 767                                 }
 768                                 else {
 769                                         if (j & 1) {
 770                                                 result = result - cln::factorial(n+k-1) * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1).to_cl_N()
 771                                                                   / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
 772                                         }
 773                                         else {
 774                                                 result = result + cln::factorial(n+k-1)
 775                                                                   * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1).to_cl_N()
 776                                                                   / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
 777                                         }
 778                                 }
 779                         }
 780                 }
 781         }
 782         int np = n+p;
 783         if ((np-1) & 1) {
 784                 if (((np)/2+n) & 1) {
 785                         result = -result - cln::expt(cln::pi(),np) / (np * cln::factorial(n-1) * cln::factorial(p));
 786                 }
 787                 else {
 788                         result = -result + cln::expt(cln::pi(),np) / (np * cln::factorial(n-1) * cln::factorial(p));
 789                 }
 790         }
 791
 792         return result;
 793 }
 794
 795
 796 // helper function for S(n,p,x)
 797 // [Kol] remark to (9.1)
 798 cln::cl_N a_k(int k)
 799 {
 800         cln::cl_N result;
 801
 802         if (k == 0) {
 803                 return 1;
 804         }
 805
 806         result = result;
 807         for (int m=2; m<=k; m++) {
 808                 result = result + cln::expt(cln::cl_N(-1),m) * cln::zeta(m) * a_k(k-m);
 809         }
 810
 811         return -result / k;
 812 }
 813
 814
 815 // helper function for S(n,p,x)
 816 // [Kol] remark to (9.1)
 817 cln::cl_N b_k(int k)
 818 {
 819         cln::cl_N result;
 820
 821         if (k == 0) {
 822                 return 1;
 823         }
 824
 825         result = result;
 826         for (int m=2; m<=k; m++) {
 827                 result = result + cln::expt(cln::cl_N(-1),m) * cln::zeta(m) * b_k(k-m);
 828         }
 829
 830         return result / k;
 831 }
 832
 833
 834 // helper function for S(n,p,x)
 835 cln::cl_N S_do_sum(int n, int p, const cln::cl_N& x, const cln::float_format_t& prec)
 836 {
 837         if (p==1) {
 838                 return Li_projection(n+1, x, prec);
 839         }
 840
 841         // check if precalculated values are sufficient
 842         if (p > ynsize+1) {
 843                 for (int i=ynsize; i<p-1; i++) {
 844                         fill_Yn(i, prec);
 845                 }
 846         }
 847
 848         // should be done otherwise
 849         cln::cl_N xf = x * cln::cl_float(1, prec);
 850
 851         cln::cl_N res;
 852         cln::cl_N resbuf;
 853         cln::cl_N factor = cln::expt(xf, p);
 854         int i = p;
 855         do {
 856                 resbuf = res;
 857                 if (i-p >= ynlength) {
 858                         // make Yn longer
 859                         make_Yn_longer(ynlength*2, prec);
 860                 }
 861                 res = res + factor / cln::expt(cln::cl_I(i),n+1) * Yn[p-2][i-p]; // should we check it? or rely on magic number? ...
 862                 //res = res + factor / cln::expt(cln::cl_I(i),n+1) * (*it); // should we check it? or rely on magic number? ...
 863                 factor = factor * xf;
 864                 i++;
 865         } while (res != resbuf);
 866
 867         return res;
 868 }
 869
 870
 871 // helper function for S(n,p,x)
 872 cln::cl_N S_projection(int n, int p, const cln::cl_N& x, const cln::float_format_t& prec)
 873 {
 874         // [Kol] (5.3)
 875         if (cln::abs(cln::realpart(x)) > cln::cl_F("0.5")) {
 876
 877                 cln::cl_N result = cln::expt(cln::cl_I(-1),p) * cln::expt(cln::log(x),n)
 878                                    * cln::expt(cln::log(1-x),p) / cln::factorial(n) / cln::factorial(p);
 879
 880                 for (int s=0; s<n; s++) {
 881                         cln::cl_N res2;
 882                         for (int r=0; r<p; r++) {
 883                                 res2 = res2 + cln::expt(cln::cl_I(-1),r) * cln::expt(cln::log(1-x),r)
 884                                               * S_do_sum(p-r,n-s,1-x,prec) / cln::factorial(r);
 885                         }
 886                         result = result + cln::expt(cln::log(x),s) * (S_num(n-s,p,1).to_cl_N() - res2) / cln::factorial(s);
 887                 }
 888
 889                 return result;
 890         }
 891
 892         return S_do_sum(n, p, x, prec);
 893 }
 894
 895
 896 // helper function for S(n,p,x)
 897 numeric S_num(int n, int p, const numeric& x)
 898 {
 899         if (x == 1) {
 900                 if (n == 1) {
 901                     // [Kol] (2.22) with (2.21)
 902                         return cln::zeta(p+1);
 903                 }
 904
 905                 if (p == 1) {
 906                     // [Kol] (2.22)
 907                         return cln::zeta(n+1);
 908                 }
 909
 910                 // [Kol] (9.1)
 911                 cln::cl_N result;
 912                 for (int nu=0; nu<n; nu++) {
 913                         for (int rho=0; rho<=p; rho++) {
 914                                 result = result + b_k(n-nu-1) * b_k(p-rho) * a_k(nu+rho+1)
 915                                                   * cln::factorial(nu+rho+1) / cln::factorial(rho) / cln::factorial(nu+1);
 916                         }
 917                 }
 918                 result = result * cln::expt(cln::cl_I(-1),n+p-1);
 919
 920                 return result;
 921         }
 922         else if (x == -1) {
 923                 // [Kol] (2.22)
 924                 if (p == 1) {
 925                         return -(1-cln::expt(cln::cl_I(2),-n)) * cln::zeta(n+1);
 926                 }
 927 //              throw std::runtime_error("don't know how to evaluate this function!");
 928         }
 929
 930         // what is the desired float format?
 931         // first guess: default format
 932         cln::float_format_t prec = cln::default_float_format;
 933         const cln::cl_N value = x.to_cl_N();
 934         // second guess: the argument's format
 935         if (!x.real().is_rational())
 936                 prec = cln::float_format(cln::the<cln::cl_F>(cln::realpart(value)));
 937         else if (!x.imag().is_rational())
 938                 prec = cln::float_format(cln::the<cln::cl_F>(cln::imagpart(value)));
 939
 940
 941         // [Kol] (5.3)
 942         if (cln::realpart(value) < -0.5) {
 943
 944                 cln::cl_N result = cln::expt(cln::cl_I(-1),p) * cln::expt(cln::log(value),n)
 945                                    * cln::expt(cln::log(1-value),p) / cln::factorial(n) / cln::factorial(p);
 946
 947                 for (int s=0; s<n; s++) {
 948                         cln::cl_N res2;
 949                         for (int r=0; r<p; r++) {
 950                                 res2 = res2 + cln::expt(cln::cl_I(-1),r) * cln::expt(cln::log(1-value),r)
 951                                               * S_num(p-r,n-s,1-value).to_cl_N() / cln::factorial(r);
 952                         }
 953                         result = result + cln::expt(cln::log(value),s) * (S_num(n-s,p,1).to_cl_N() - res2) / cln::factorial(s);
 954                 }
 955
 956                 return result;
 957
 958         }
 959         // [Kol] (5.12)
 960         if (cln::abs(value) > 1) {
 961
 962                 cln::cl_N result;
 963
 964                 for (int s=0; s<p; s++) {
 965                         for (int r=0; r<=s; r++) {
 966                                 result = result + cln::expt(cln::cl_I(-1),s) * cln::expt(cln::log(-value),r) * cln::factorial(n+s-r-1)
 967                                                   / cln::factorial(r) / cln::factorial(s-r) / cln::factorial(n-1)
 968                                                   * S_num(n+s-r,p-s,cln::recip(value)).to_cl_N();
 969                         }
 970                 }
 971                 result = result * cln::expt(cln::cl_I(-1),n);
 972
 973                 cln::cl_N res2;
 974                 for (int r=0; r<n; r++) {
 975                         res2 = res2 + cln::expt(cln::log(-value),r) * C(n-r,p) / cln::factorial(r);
 976                 }
 977                 res2 = res2 + cln::expt(cln::log(-value),n+p) / cln::factorial(n+p);
 978
 979                 result = result + cln::expt(cln::cl_I(-1),p) * res2;
 980
 981                 return result;
 982         }
 983         else {
 984                 return S_projection(n, p, value, prec);
 985         }
 986 }
 987
 988
 989 } // end of anonymous namespace
 990
 991
 992 //////////////////////////////////////////////////////////////////////
 993 //
 994 // Nielsen's generalized polylogarithm  S(n,p,x)
 995 //
 996 // GiNaC function
 997 //
 998 //////////////////////////////////////////////////////////////////////
 999
1000
1001 static ex S_evalf(const ex& n, const ex& p, const ex& x)
1002 {
1003         if (n.info(info_flags::posint) && p.info(info_flags::posint) && is_a<numeric>(x)) {
1004                 return S_num(ex_to<numeric>(n).to_int(), ex_to<numeric>(p).to_int(), ex_to<numeric>(x));
1005         }
1006         return S(n, p, x).hold();
1007 }
1008
1009
1010 static ex S_eval(const ex& n, const ex& p, const ex& x)
1011 {
1012         if (n.info(info_flags::posint) && p.info(info_flags::posint)) {
1013                 if (x == 0) {
1014                         return _ex0;
1015                 }
1016                 if (x == 1) {
1017                         lst m(n+1);
1018                         for (int i=ex_to<numeric>(p).to_int()-1; i>0; i--) {
1019                                 m.append(1);
1020                         }
1021                         return zeta(m);
1022                 }
1023                 if (p == 1) {
1024                         return Li(n+1, x);
1025                 }
1026                 if (x.info(info_flags::numeric) && (!x.info(info_flags::crational))) {
1027                         return S_num(ex_to<numeric>(n).to_int(), ex_to<numeric>(p).to_int(), ex_to<numeric>(x));
1028                 }
1029         }
1030         return S(n, p, x).hold();
1031 }
1032
1033
1034 static ex S_series(const ex& n, const ex& p, const ex& x, const relational& rel, int order, unsigned options)
1035 {
1036         epvector seq;
1037         seq.push_back(expair(S(n, p, x), 0));
1038         return pseries(rel, seq);
1039 }
1040
1041
1042 static ex S_deriv(const ex& n, const ex& p, const ex& x, unsigned deriv_param)
1043 {
1044         GINAC_ASSERT(deriv_param < 3);
1045         if (deriv_param < 2) {
1046                 return _ex0;
1047         }
1048         if (n > 0) {
1049                 return S(n-1, p, x) / x;
1050         } else {
1051                 return S(n, p-1, x) / (1-x);
1052         }
1053 }
1054
1055
1056 static void S_print_latex(const ex& n, const ex& p, const ex& x, const print_context& c)
1057 {
1058         c.s << "\\mbox{S}_{";
1059         n.print(c);
1060         c.s << ",";
1061         p.print(c);
1062         c.s << "}(";
1063         x.print(c);
1064         c.s << ")";
1065 }
1066
1067
1068 REGISTER_FUNCTION(S,
1069                   evalf_func(S_evalf).
1070                   eval_func(S_eval).
1071                   series_func(S_series).
1072                   derivative_func(S_deriv).
1073                   print_func<print_latex>(S_print_latex).
1074                   do_not_evalf_params());
1075
1076
1077 //////////////////////////////////////////////////////////////////////
1078 //
1079 // Harmonic polylogarithm  H(m,x)
1080 //
1081 // helper functions
1082 //
1083 //////////////////////////////////////////////////////////////////////
1084
1085
1086 // anonymous namespace for helper functions
1087 namespace {
1088
1089
1090 // convert parameters from H to Li representation
1091 // parameters are expected to be in expanded form, i.e. only 0, 1 and -1
1092 // returns true if some parameters are negative
1093 bool convert_parameter_H_to_Li(const lst& l, lst& m, lst& s, ex& pf)
1094 {
1095         // expand parameter list
1096         lst mexp;
1097         for (lst::const_iterator it = l.begin(); it != l.end(); it++) {
1098                 if (*it > 1) {
1099                         for (ex count=*it-1; count > 0; count--) {
1100                                 mexp.append(0);
1101                         }
1102                         mexp.append(1);
1103                 } else if (*it < -1) {
1104                         for (ex count=*it+1; count < 0; count++) {
1105                                 mexp.append(0);
1106                         }
1107                         mexp.append(-1);
1108                 } else {
1109                         mexp.append(*it);
1110                 }
1111         }
1112
1113         ex signum = 1;
1114         pf = 1;
1115         bool has_negative_parameters = false;
1116         ex acc = 1;
1117         for (lst::const_iterator it = mexp.begin(); it != mexp.end(); it++) {
1118                 if (*it == 0) {
1119                         acc++;
1120                         continue;
1121                 }
1122                 if (*it > 0) {
1123                         m.append((*it+acc-1) * signum);
1124                 } else {
1125                         m.append((*it-acc+1) * signum);
1126                 }
1127                 acc = 1;
1128                 signum = *it;
1129                 pf *= *it;
1130                 if (pf < 0) {
1131                         has_negative_parameters = true;
1132                 }
1133         }
1134         if (has_negative_parameters) {
1135                 for (int i=0; i<m.nops(); i++) {
1136                         if (m.op(i) < 0) {
1137                                 m.let_op(i) = -m.op(i);
1138                                 s.append(-1);
1139                         } else {
1140                                 s.append(1);
1141                         }
1142                 }
1143         }
1144
1145         return has_negative_parameters;
1146 }
1147
1148
1149 // recursivly transforms H to corresponding multiple polylogarithms
1150 struct map_trafo_H_convert_to_Li : public map_function
1151 {
1152         ex operator()(const ex& e)
1153         {
1154                 if (is_a<add>(e) || is_a<mul>(e)) {
1155                         return e.map(*this);
1156                 }
1157                 if (is_a<function>(e)) {
1158                         std::string name = ex_to<function>(e).get_name();
1159                         if (name == "H") {
1160                                 lst parameter;
1161                                 if (is_a<lst>(e.op(0))) {
1162                                                 parameter = ex_to<lst>(e.op(0));
1163                                 } else {
1164                                         parameter = lst(e.op(0));
1165                                 }
1166                                 ex arg = e.op(1);
1167
1168                                 lst m;
1169                                 lst s;
1170                                 ex pf;
1171                                 if (convert_parameter_H_to_Li(parameter, m, s, pf)) {
1172                                         s.let_op(0) = s.op(0) * arg;
1173                                         return pf * Li(m, s).hold();
1174                                 } else {
1175                                         for (int i=0; i<m.nops(); i++) {
1176                                                 s.append(1);
1177                                         }
1178                                         s.let_op(0) = s.op(0) * arg;
1179                                         return Li(m, s).hold();
1180                                 }
1181                         }
1182                 }
1183                 return e;
1184         }
1185 };
1186
1187
1188 // recursivly transforms H to corresponding zetas
1189 struct map_trafo_H_convert_to_zeta : public map_function
1190 {
1191         ex operator()(const ex& e)
1192         {
1193                 if (is_a<add>(e) || is_a<mul>(e)) {
1194                         return e.map(*this);
1195                 }
1196                 if (is_a<function>(e)) {
1197                         std::string name = ex_to<function>(e).get_name();
1198                         if (name == "H") {
1199                                 lst parameter;
1200                                 if (is_a<lst>(e.op(0))) {
1201                                                 parameter = ex_to<lst>(e.op(0));
1202                                 } else {
1203                                         parameter = lst(e.op(0));
1204                                 }
1205
1206                                 lst m;
1207                                 lst s;
1208                                 ex pf;
1209                                 if (convert_parameter_H_to_Li(parameter, m, s, pf)) {
1210                                         return pf * zeta(m, s);
1211                                 } else {
1212                                         return zeta(m);
1213                                 }
1214                         }
1215                 }
1216                 return e;
1217         }
1218 };
1219
1220
1221 // remove trailing zeros from H-parameters
1222 struct map_trafo_H_reduce_trailing_zeros : public map_function
1223 {
1224         ex operator()(const ex& e)
1225         {
1226                 if (is_a<add>(e) || is_a<mul>(e)) {
1227                         return e.map(*this);
1228                 }
1229                 if (is_a<function>(e)) {
1230                         std::string name = ex_to<function>(e).get_name();
1231                         if (name == "H") {
1232                                 lst parameter;
1233                                 if (is_a<lst>(e.op(0))) {
1234                                         parameter = ex_to<lst>(e.op(0));
1235                                 } else {
1236                                         parameter = lst(e.op(0));
1237                                 }
1238                                 ex arg = e.op(1);
1239                                 if (parameter.op(parameter.nops()-1) == 0) {
1240
1241                                         //
1242                                         if (parameter.nops() == 1) {
1243                                                 return log(arg);
1244                                         }
1245
1246                                         //
1247                                         lst::const_iterator it = parameter.begin();
1248                                         while ((it != parameter.end()) && (*it == 0)) {
1249                                                 it++;
1250                                         }
1251                                         if (it == parameter.end()) {
1252                                                 return pow(log(arg),parameter.nops()) / factorial(parameter.nops());
1253                                         }
1254
1255                                         //
1256                                         parameter.remove_last();
1257                                         int lastentry = parameter.nops();
1258                                         while ((lastentry > 0) && (parameter[lastentry-1] == 0)) {
1259                                                 lastentry--;
1260                                         }
1261
1262                                         //
1263                                         ex result = log(arg) * H(parameter,arg).hold();
1264                                         ex acc = 0;
1265                                         for (ex i=0; i<lastentry; i++) {
1266                                                 if (parameter[i] > 0) {
1267                                                         parameter[i]++;
1268                                                         result -= (acc + parameter[i]-1) * H(parameter, arg).hold();
1269                                                         parameter[i]--;
1270                                                         acc = 0;
1271                                                 } else if (parameter[i] < 0) {
1272                                                         parameter[i]--;
1273                                                         result -= (acc + abs(parameter[i]+1)) * H(parameter, arg).hold();
1274                                                         parameter[i]++;
1275                                                         acc = 0;
1276                                                 } else {
1277                                                         acc++;
1278                                                 }
1279                                         }
1280
1281                                         if (lastentry < parameter.nops()) {
1282                                                 result = result / (parameter.nops()-lastentry+1);
1283                                                 return result.map(*this);
1284                                         } else {
1285                                                 return result;
1286                                         }
1287                                 }
1288                         }
1289                 }
1290                 return e;
1291         }
1292 };
1293
1294
1295 // returns an expression with zeta functions corresponding to the parameter list for H
1296 ex convert_H_to_zeta(const lst& m)
1297 {
1298         symbol xtemp("xtemp");
1299         map_trafo_H_reduce_trailing_zeros filter;
1300         map_trafo_H_convert_to_zeta filter2;
1301         return filter2(filter(H(m, xtemp).hold())).subs(xtemp == 1);
1302 }
1303
1304
1305 // convert signs form Li to H representation
1306 lst convert_parameter_Li_to_H(const lst& m, const lst& x, ex& pf)
1307 {
1308         lst res;
1309         lst::const_iterator itm = m.begin();
1310         lst::const_iterator itx = ++x.begin();
1311         ex signum = _ex1;
1312         pf = _ex1;
1313         res.append(*itm);
1314         itm++;
1315         while (itx != x.end()) {
1316                 signum *= *itx;
1317                 pf *= signum;
1318                 res.append((*itm) * signum);
1319                 itm++;
1320                 itx++;
1321         }
1322         return res;
1323 }
1324
1325
1326 // multiplies an one-dimensional H with another H
1327 // [ReV] (18)
1328 ex trafo_H_mult(const ex& h1, const ex& h2)
1329 {
1330         ex res;
1331         ex hshort;
1332         lst hlong;
1333         ex h1nops = h1.op(0).nops();
1334         ex h2nops = h2.op(0).nops();
1335         if (h1nops > 1) {
1336                 hshort = h2.op(0).op(0);
1337                 hlong = ex_to<lst>(h1.op(0));
1338         } else {
1339                 hshort = h1.op(0).op(0);
1340                 if (h2nops > 1) {
1341                         hlong = ex_to<lst>(h2.op(0));
1342                 } else {
1343                         hlong = h2.op(0).op(0);
1344                 }
1345         }
1346         for (int i=0; i<=hlong.nops(); i++) {
1347                 lst newparameter;
1348                 int j=0;
1349                 for (; j<i; j++) {
1350                         newparameter.append(hlong[j]);
1351                 }
1352                 newparameter.append(hshort);
1353                 for (; j<hlong.nops(); j++) {
1354                         newparameter.append(hlong[j]);
1355                 }
1356                 res += H(newparameter, h1.op(1)).hold();
1357         }
1358         return res;
1359 }
1360
1361
1362 // applies trafo_H_mult recursively on expressions
1363 struct map_trafo_H_mult : public map_function
1364 {
1365         ex operator()(const ex& e)
1366         {
1367                 if (is_a<add>(e)) {
1368                         return e.map(*this);
1369                 }
1370
1371                 if (is_a<mul>(e)) {
1372
1373                         ex result = 1;
1374                         ex firstH;
1375                         lst Hlst;
1376                         for (int pos=0; pos<e.nops(); pos++) {
1377                                 if (is_a<power>(e.op(pos)) && is_a<function>(e.op(pos).op(0))) {
1378                                         std::string name = ex_to<function>(e.op(pos).op(0)).get_name();
1379                                         if (name == "H") {
1380                                                 for (ex i=0; i<e.op(pos).op(1); i++) {
1381                                                         Hlst.append(e.op(pos).op(0));
1382                                                 }
1383                                                 continue;
1384                                         }
1385                                 } else if (is_a<function>(e.op(pos))) {
1386                                         std::string name = ex_to<function>(e.op(pos)).get_name();
1387                                         if (name == "H") {
1388                                                 if (e.op(pos).op(0).nops() > 1) {
1389                                                         firstH = e.op(pos);
1390                                                 } else {
1391                                                         Hlst.append(e.op(pos));
1392                                                 }
1393                                                 continue;
1394                                         }
1395                                 }
1396                                 result *= e.op(pos);
1397                         }
1398                         if (firstH == 0) {
1399                                 if (Hlst.nops() > 0) {
1400                                         firstH = Hlst[Hlst.nops()-1];
1401                                         Hlst.remove_last();
1402                                 } else {
1403                                         return e;
1404                                 }
1405                         }
1406
1407                         if (Hlst.nops() > 0) {
1408                                 ex buffer = trafo_H_mult(firstH, Hlst.op(0));
1409                                 result *= buffer;
1410                                 for (int i=1; i<Hlst.nops(); i++) {
1411                                         result *= Hlst.op(i);
1412                                 }
1413                                 result = result.expand();
1414                                 map_trafo_H_mult recursion;
1415                                 return recursion(result);
1416                         } else {
1417                                 return e;
1418                         }
1419
1420                 }
1421                 return e;
1422         }
1423 };
1424
1425
1426 // do integration [ReV] (55)
1427 // put parameter 0 in front of existing parameters
1428 ex trafo_H_1tx_prepend_zero(const ex& e, const ex& arg)
1429 {
1430         ex h;
1431         std::string name;
1432         if (is_a<function>(e)) {
1433                 name = ex_to<function>(e).get_name();
1434         }
1435         if (name == "H") {
1436                 h = e;
1437         } else {
1438                 for (int i=0; i<e.nops(); i++) {
1439                         if (is_a<function>(e.op(i))) {
1440                                 std::string name = ex_to<function>(e.op(i)).get_name();
1441                                 if (name == "H") {
1442                                         h = e.op(i);
1443                                 }
1444                         }
1445                 }
1446         }
1447         if (h != 0) {
1448                 lst newparameter = ex_to<lst>(h.op(0));
1449                 newparameter.prepend(0);
1450                 ex addzeta = convert_H_to_zeta(newparameter);
1451                 return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand();
1452         } else {
1453                 return e * (-H(lst(0),1/arg).hold());
1454         }
1455 }
1456
1457
1458 // do integration [ReV] (55)
1459 // put parameter -1 in front of existing parameters
1460 ex trafo_H_1tx_prepend_minusone(const ex& e, const ex& arg)
1461 {
1462         ex h;
1463         std::string name;
1464         if (is_a<function>(e)) {
1465                 name = ex_to<function>(e).get_name();
1466         }
1467         if (name == "H") {
1468                 h = e;
1469         } else {
1470                 for (int i=0; i<e.nops(); i++) {
1471                         if (is_a<function>(e.op(i))) {
1472                                 std::string name = ex_to<function>(e.op(i)).get_name();
1473                                 if (name == "H") {
1474                                         h = e.op(i);
1475                                 }
1476                         }
1477                 }
1478         }
1479         if (h != 0) {
1480                 lst newparameter = ex_to<lst>(h.op(0));
1481                 newparameter.prepend(-1);
1482                 ex addzeta = convert_H_to_zeta(newparameter);
1483                 return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand();
1484         } else {
1485                 ex addzeta = convert_H_to_zeta(lst(-1));
1486                 return (e * (addzeta - H(lst(-1),1/arg).hold())).expand();
1487         }
1488 }
1489
1490
1491 // do integration [ReV] (55)
1492 // put parameter -1 in front of existing parameters
1493 ex trafo_H_1mxt1px_prepend_minusone(const ex& e, const ex& arg)
1494 {
1495         ex h;
1496         std::string name;
1497         if (is_a<function>(e)) {
1498                 name = ex_to<function>(e).get_name();
1499         }
1500         if (name == "H") {
1501                 h = e;
1502         } else {
1503                 for (int i=0; i<e.nops(); i++) {
1504                         if (is_a<function>(e.op(i))) {
1505                                 std::string name = ex_to<function>(e.op(i)).get_name();
1506                                 if (name == "H") {
1507                                         h = e.op(i);
1508                                 }
1509                         }
1510                 }
1511         }
1512         if (h != 0) {
1513                 lst newparameter = ex_to<lst>(h.op(0));
1514                 newparameter.prepend(-1);
1515                 return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
1516         } else {
1517                 return (e * H(lst(-1),(1-arg)/(1+arg)).hold()).expand();
1518         }
1519 }
1520
1521
1522 // do integration [ReV] (55)
1523 // put parameter 1 in front of existing parameters
1524 ex trafo_H_1mxt1px_prepend_one(const ex& e, const ex& arg)
1525 {
1526         ex h;
1527         std::string name;
1528         if (is_a<function>(e)) {
1529                 name = ex_to<function>(e).get_name();
1530         }
1531         if (name == "H") {
1532                 h = e;
1533         } else {
1534                 for (int i=0; i<e.nops(); i++) {
1535                         if (is_a<function>(e.op(i))) {
1536                                 std::string name = ex_to<function>(e.op(i)).get_name();
1537                                 if (name == "H") {
1538                                         h = e.op(i);
1539                                 }
1540                         }
1541                 }
1542         }
1543         if (h != 0) {
1544                 lst newparameter = ex_to<lst>(h.op(0));
1545                 newparameter.prepend(1);
1546                 return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
1547         } else {
1548                 return (e * H(lst(1),(1-arg)/(1+arg)).hold()).expand();
1549         }
1550 }
1551
1552
1553 // do x -> 1/x transformation
1554 struct map_trafo_H_1overx : public map_function
1555 {
1556         ex operator()(const ex& e)
1557         {
1558                 if (is_a<add>(e) || is_a<mul>(e)) {
1559                         return e.map(*this);
1560                 }
1561
1562                 if (is_a<function>(e)) {
1563                         std::string name = ex_to<function>(e).get_name();
1564                         if (name == "H") {
1565
1566                                 lst parameter = ex_to<lst>(e.op(0));
1567                                 ex arg = e.op(1);
1568
1569                                 // special cases if all parameters are either 0, 1 or -1
1570                                 bool allthesame = true;
1571                                 if (parameter.op(0) == 0) {
1572                                         for (int i=1; i<parameter.nops(); i++) {
1573                                                 if (parameter.op(i) != 0) {
1574                                                         allthesame = false;
1575                                                         break;
1576                                                 }
1577                                         }
1578                                         if (allthesame) {
1579                                                 return pow(-1, parameter.nops()) * H(parameter, 1/arg).hold();
1580                                         }
1581                                 } else if (parameter.op(0) == -1) {
1582                                         for (int i=1; i<parameter.nops(); i++) {
1583                                                 if (parameter.op(i) != -1) {
1584                                                         allthesame = false;
1585                                                         break;
1586                                                 }
1587                                         }
1588                                         if (allthesame) {
1589                                                 map_trafo_H_mult unify;
1590                                                 return unify((pow(H(lst(-1),1/arg).hold() - H(lst(0),1/arg).hold(), parameter.nops())
1591                                                        / factorial(parameter.nops())).expand());
1592                                         }
1593                                 } else {
1594                                         for (int i=1; i<parameter.nops(); i++) {
1595                                                 if (parameter.op(i) != 1) {
1596                                                         allthesame = false;
1597                                                         break;
1598                                                 }
1599                                         }
1600                                         if (allthesame) {
1601                                                 map_trafo_H_mult unify;
1602                                                 return unify((pow(H(lst(1),1/arg).hold() + H(lst(0),1/arg).hold() - I*Pi, parameter.nops())
1603                                                        / factorial(parameter.nops())).expand());
1604                                         }
1605                                 }
1606
1607                                 lst newparameter = parameter;
1608                                 newparameter.remove_first();
1609
1610                                 if (parameter.op(0) == 0) {
1611
1612                                         // leading zero
1613                                         ex res = convert_H_to_zeta(parameter);
1614                                         map_trafo_H_1overx recursion;
1615                                         ex buffer = recursion(H(newparameter, arg).hold());
1616                                         if (is_a<add>(buffer)) {
1617                                                 for (int i=0; i<buffer.nops(); i++) {
1618                                                         res += trafo_H_1tx_prepend_zero(buffer.op(i), arg);
1619                                                 }
1620                                         } else {
1621                                                 res += trafo_H_1tx_prepend_zero(buffer, arg);
1622                                         }
1623                                         return res;
1624
1625                                 } else if (parameter.op(0) == -1) {
1626
1627                                         // leading negative one
1628                                         ex res = convert_H_to_zeta(parameter);
1629                                         map_trafo_H_1overx recursion;
1630                                         ex buffer = recursion(H(newparameter, arg).hold());
1631                                         if (is_a<add>(buffer)) {
1632                                                 for (int i=0; i<buffer.nops(); i++) {
1633                                                         res += trafo_H_1tx_prepend_zero(buffer.op(i), arg) - trafo_H_1tx_prepend_minusone(buffer.op(i), arg);
1634                                                 }
1635                                         } else {
1636                                                 res += trafo_H_1tx_prepend_zero(buffer, arg) - trafo_H_1tx_prepend_minusone(buffer, arg);
1637                                         }
1638                                         return res;
1639
1640                                 } else {
1641
1642                                         // leading one
1643                                         map_trafo_H_1overx recursion;
1644                                         map_trafo_H_mult unify;
1645                                         ex res = H(lst(1), arg).hold() * H(newparameter, arg).hold();
1646                                         int firstzero = 0;
1647                                         while (parameter.op(firstzero) == 1) {
1648                                                 firstzero++;
1649                                         }
1650                                         for (int i=firstzero-1; i<parameter.nops()-1; i++) {
1651                                                 lst newparameter;
1652                                                 int j=0;
1653                                                 for (; j<=i; j++) {
1654                                                         newparameter.append(parameter[j+1]);
1655                                                 }
1656                                                 newparameter.append(1);
1657                                                 for (; j<parameter.nops()-1; j++) {
1658                                                         newparameter.append(parameter[j+1]);
1659                                                 }
1660                                                 res -= H(newparameter, arg).hold();
1661                                         }
1662                                         res = recursion(res).expand() / firstzero;
1663                                         return unify(res);
1664
1665                                 }
1666
1667                         }
1668                 }
1669                 return e;
1670         }
1671 };
1672
1673
1674 // do x -> (1-x)/(1+x) transformation
1675 struct map_trafo_H_1mxt1px : public map_function
1676 {
1677         ex operator()(const ex& e)
1678         {
1679                 if (is_a<add>(e) || is_a<mul>(e)) {
1680                         return e.map(*this);
1681                 }
1682
1683                 if (is_a<function>(e)) {
1684                         std::string name = ex_to<function>(e).get_name();
1685                         if (name == "H") {
1686
1687                                 lst parameter = ex_to<lst>(e.op(0));
1688                                 ex arg = e.op(1);
1689
1690                                 // special cases if all parameters are either 0, 1 or -1
1691                                 bool allthesame = true;
1692                                 if (parameter.op(0) == 0) {
1693                                         for (int i=1; i<parameter.nops(); i++) {
1694                                                 if (parameter.op(i) != 0) {
1695                                                         allthesame = false;
1696                                                         break;
1697                                                 }
1698                                         }
1699                                         if (allthesame) {
1700                                                 map_trafo_H_mult unify;
1701                                                 return unify((pow(-H(lst(1),(1-arg)/(1+arg)).hold() - H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
1702                                                        / factorial(parameter.nops())).expand());
1703                                         }
1704                                 } else if (parameter.op(0) == -1) {
1705                                         for (int i=1; i<parameter.nops(); i++) {
1706                                                 if (parameter.op(i) != -1) {
1707                                                         allthesame = false;
1708                                                         break;
1709                                                 }
1710                                         }
1711                                         if (allthesame) {
1712                                                 map_trafo_H_mult unify;
1713                                                 return unify((pow(log(2) - H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
1714                                                        / factorial(parameter.nops())).expand());
1715                                         }
1716                                 } else {
1717                                         for (int i=1; i<parameter.nops(); i++) {
1718                                                 if (parameter.op(i) != 1) {
1719                                                         allthesame = false;
1720                                                         break;
1721                                                 }
1722                                         }
1723                                         if (allthesame) {
1724                                                 map_trafo_H_mult unify;
1725                                                 return unify((pow(-log(2) - H(lst(0),(1-arg)/(1+arg)).hold() + H(lst(-1),(1-arg)/(1+arg)).hold(), parameter.nops())
1726                                                        / factorial(parameter.nops())).expand());
1727                                         }
1728                                 }
1729
1730                                 lst newparameter = parameter;
1731                                 newparameter.remove_first();
1732
1733                                 if (parameter.op(0) == 0) {
1734
1735                                         // leading zero
1736                                         ex res = convert_H_to_zeta(parameter);
1737                                         map_trafo_H_1mxt1px recursion;
1738                                         ex buffer = recursion(H(newparameter, arg).hold());
1739                                         if (is_a<add>(buffer)) {
1740                                                 for (int i=0; i<buffer.nops(); i++) {
1741                                                         res -= trafo_H_1mxt1px_prepend_one(buffer.op(i), arg) + trafo_H_1mxt1px_prepend_minusone(buffer.op(i), arg);
1742                                                 }
1743                                         } else {
1744                                                 res -= trafo_H_1mxt1px_prepend_one(buffer, arg) + trafo_H_1mxt1px_prepend_minusone(buffer, arg);
1745                                         }
1746                                         return res;
1747
1748                                 } else if (parameter.op(0) == -1) {
1749
1750                                         // leading negative one
1751                                         ex res = convert_H_to_zeta(parameter);
1752                                         map_trafo_H_1mxt1px recursion;
1753                                         ex buffer = recursion(H(newparameter, arg).hold());
1754                                         if (is_a<add>(buffer)) {
1755                                                 for (int i=0; i<buffer.nops(); i++) {
1756                                                         res -= trafo_H_1mxt1px_prepend_minusone(buffer.op(i), arg);
1757                                                 }
1758                                         } else {
1759                                                 res -= trafo_H_1mxt1px_prepend_minusone(buffer, arg);
1760                                         }
1761                                         return res;
1762
1763                                 } else {
1764
1765                                         // leading one
1766                                         map_trafo_H_1mxt1px recursion;
1767                                         map_trafo_H_mult unify;
1768                                         ex res = H(lst(1), arg).hold() * H(newparameter, arg).hold();
1769                                         int firstzero = 0;
1770                                         while (parameter.op(firstzero) == 1) {
1771                                                 firstzero++;
1772                                         }
1773                                         for (int i=firstzero-1; i<parameter.nops()-1; i++) {
1774                                                 lst newparameter;
1775                                                 int j=0;
1776                                                 for (; j<=i; j++) {
1777                                                         newparameter.append(parameter[j+1]);
1778                                                 }
1779                                                 newparameter.append(1);
1780                                                 for (; j<parameter.nops()-1; j++) {
1781                                                         newparameter.append(parameter[j+1]);
1782                                                 }
1783                                                 res -= H(newparameter, arg).hold();
1784                                         }
1785                                         res = recursion(res).expand() / firstzero;
1786                                         return unify(res);
1787
1788                                 }
1789
1790                         }
1791                 }
1792                 return e;
1793         }
1794 };
1795
1796
1797 // do the actual summation.
1798 cln::cl_N H_do_sum(const std::vector<int>& m, const cln::cl_N& x)
1799 {
1800         const int j = m.size();
1801
1802         std::vector<cln::cl_N> t(j);
1803
1804         cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
1805         cln::cl_N factor = cln::expt(x, j) * one;
1806         cln::cl_N t0buf;
1807         int q = 0;
1808         do {
1809                 t0buf = t[0];
1810                 q++;
1811                 t[j-1] = t[j-1] + 1 / cln::expt(cln::cl_I(q),m[j-1]);
1812                 for (int k=j-2; k>=1; k--) {
1813                         t[k] = t[k] + t[k+1] / cln::expt(cln::cl_I(q+j-1-k), m[k]);
1814                 }
1815                 t[0] = t[0] + t[1] * factor / cln::expt(cln::cl_I(q+j-1), m[0]);
1816                 factor = factor * x;
1817         } while (t[0] != t0buf);
1818
1819         return t[0];
1820 }
1821
1822
1823 } // end of anonymous namespace
1824
1825
1826 //////////////////////////////////////////////////////////////////////
1827 //
1828 // Harmonic polylogarithm  H(m,x)
1829 //
1830 // GiNaC function
1831 //
1832 //////////////////////////////////////////////////////////////////////
1833
1834
1835 static ex H_evalf(const ex& x1, const ex& x2)
1836 {
1837         if (is_a<lst>(x1) && is_a<numeric>(x2)) {
1838                 for (int i=0; i<x1.nops(); i++) {
1839                         if (!x1.op(i).info(info_flags::integer)) {
1840                                 return H(x1,x2).hold();
1841                         }
1842                 }
1843                 if (x1.nops() < 1) {
1844                         return H(x1,x2).hold();
1845                 }
1846
1847                 cln::cl_N x = ex_to<numeric>(x2).to_cl_N();
1848
1849                 const lst& morg = ex_to<lst>(x1);
1850                 // remove trailing zeros ...
1851                 if (*(--morg.end()) == 0) {
1852                         symbol xtemp("xtemp");
1853                         map_trafo_H_reduce_trailing_zeros filter;
1854                         return filter(H(x1, xtemp).hold()).subs(xtemp==x2).evalf();
1855                 }
1856                 // ... and expand parameter notation
1857                 lst m;
1858                 for (lst::const_iterator it = morg.begin(); it != morg.end(); it++) {
1859                         if (*it > 1) {
1860                                 for (ex count=*it-1; count > 0; count--) {
1861                                         m.append(0);
1862                                 }
1863                                 m.append(1);
1864                         } else if (*it < -1) {
1865                                 for (ex count=*it+1; count < 0; count++) {
1866                                         m.append(0);
1867                                 }
1868                                 m.append(-1);
1869                         } else {
1870                                 m.append(*it);
1871                         }
1872                 }
1873
1874                 // since the transformations produce a lot of terms, they are only efficient for
1875                 // argument near one.
1876                 // no transformation needed -> do summation
1877                 if (cln::abs(x) < 0.95) {
1878                         lst m_lst;
1879                         lst s_lst;
1880                         ex pf;
1881                         if (convert_parameter_H_to_Li(m, m_lst, s_lst, pf)) {
1882                                 // negative parameters -> s_lst is filled
1883                                 std::vector<int> m_int;
1884                                 std::vector<cln::cl_N> x_cln;
1885                                 for (lst::const_iterator it_int = m_lst.begin(), it_cln = s_lst.begin();
1886                                      it_int != m_lst.end(); it_int++, it_cln++) {
1887                                         m_int.push_back(ex_to<numeric>(*it_int).to_int());
1888                                         x_cln.push_back(ex_to<numeric>(*it_cln).to_cl_N());
1889                                 }
1890                                 x_cln.front() = x_cln.front() * x;
1891                                 return pf * numeric(multipleLi_do_sum(m_int, x_cln));
1892                         } else {
1893                                 // only positive parameters
1894                                 //TODO
1895                                 if (m_lst.nops() == 1) {
1896                                         return Li(m_lst.op(0), x2).evalf();
1897                                 }
1898                                 std::vector<int> m_int;
1899                                 for (lst::const_iterator it = m_lst.begin(); it != m_lst.end(); it++) {
1900                                         m_int.push_back(ex_to<numeric>(*it).to_int());
1901                                 }
1902                                 return numeric(H_do_sum(m_int, x));
1903                         }
1904                 }
1905
1906                 ex res = 1;
1907
1908                 // ensure that the realpart of the argument is positive
1909                 if (cln::realpart(x) < 0) {
1910                         x = -x;
1911                         for (int i=0; i<m.nops(); i++) {
1912                                 if (m.op(i) != 0) {
1913                                         m.let_op(i) = -m.op(i);
1914                                         res *= -1;
1915                                 }
1916                         }
1917                 }
1918
1919                 // choose transformations
1920                 symbol xtemp("xtemp");
1921                 if (cln::abs(x-1) < 1.4142) {
1922                         // x -> (1-x)/(1+x)
1923                         map_trafo_H_1mxt1px trafo;
1924                         res *= trafo(H(m, xtemp));
1925                 } else {
1926                         // x -> 1/x
1927                         map_trafo_H_1overx trafo;
1928                         res *= trafo(H(m, xtemp));
1929                 }
1930
1931                 // simplify result
1932 // TODO
1933 //              map_trafo_H_convert converter;
1934 //              res = converter(res).expand();
1935 //              lst ll;
1936 //              res.find(H(wild(1),wild(2)), ll);
1937 //              res.find(zeta(wild(1)), ll);
1938 //              res.find(zeta(wild(1),wild(2)), ll);
1939 //              res = res.collect(ll);
1940
1941                 return res.subs(xtemp == numeric(x)).evalf();
1942         }
1943
1944         return H(x1,x2).hold();
1945 }
1946
1947
1948 static ex H_eval(const ex& m_, const ex& x)
1949 {
1950         lst m;
1951         if (is_a<lst>(m_)) {
1952                 m = ex_to<lst>(m_);
1953         } else {
1954                 m = lst(m_);
1955         }
1956         if (m.nops() == 0) {
1957                 return _ex1;
1958         }
1959         ex pos1;
1960         ex pos2;
1961         ex n;
1962         ex p;
1963         int step = 0;
1964         if (*m.begin() > _ex1) {
1965                 step++;
1966                 pos1 = _ex0;
1967                 pos2 = _ex1;
1968                 n = *m.begin()-1;
1969                 p = _ex1;
1970         } else if (*m.begin() < _ex_1) {
1971                 step++;
1972                 pos1 = _ex0;
1973                 pos2 = _ex_1;
1974                 n = -*m.begin()-1;
1975                 p = _ex1;
1976         } else if (*m.begin() == _ex0) {
1977                 pos1 = _ex0;
1978                 n = _ex1;
1979         } else {
1980                 pos1 = *m.begin();
1981                 p = _ex1;
1982         }
1983         for (lst::const_iterator it = ++m.begin(); it != m.end(); it++) {
1984                 if ((*it).info(info_flags::integer)) {
1985                         if (step == 0) {
1986                                 if (*it > _ex1) {
1987                                         if (pos1 == _ex0) {
1988                                                 step = 1;
1989                                                 pos2 = _ex1;
1990                                                 n += *it-1;
1991                                                 p = _ex1;
1992                                         } else {
1993                                                 step = 2;
1994                                         }
1995                                 } else if (*it < _ex_1) {
1996                                         if (pos1 == _ex0) {
1997                                                 step = 1;
1998                                                 pos2 = _ex_1;
1999                                                 n += -*it-1;
2000                                                 p = _ex1;
2001                                         } else {
2002                                                 step = 2;
2003                                         }
2004                                 } else {
2005                                         if (*it != pos1) {
2006                                                 step = 1;
2007                                                 pos2 = *it;
2008                                         }
2009                                         if (*it == _ex0) {
2010                                                 n++;
2011                                         } else {
2012                                                 p++;
2013                                         }
2014                                 }
2015                         } else if (step == 1) {
2016                                 if (*it != pos2) {
2017                                         step = 2;
2018                                 } else {
2019                                         if (*it == _ex0) {
2020                                                 n++;
2021                                         } else {
2022                                                 p++;
2023                                         }
2024                                 }
2025                         }
2026                 } else {
2027                         // if some m_i is not an integer
2028                         return H(m_, x).hold();
2029                 }
2030         }
2031         if ((x == _ex1) && (*(--m.end()) != _ex0)) {
2032                 return convert_H_to_zeta(m);
2033         }
2034         if (step == 0) {
2035                 if (pos1 == _ex0) {
2036                         // all zero
2037                         if (x == _ex0) {
2038                                 return H(m_, x).hold();
2039                         }
2040                         return pow(log(x), m.nops()) / factorial(m.nops());
2041                 } else {
2042                         // all (minus) one
2043                         return pow(-pos1*log(1-pos1*x), m.nops()) / factorial(m.nops());
2044                 }
2045         } else if ((step == 1) && (pos1 == _ex0)){
2046                 // convertible to S
2047                 if (pos2 == _ex1) {
2048                         return S(n, p, x);
2049                 } else {
2050                         return pow(-1, p) * S(n, p, -x);
2051                 }
2052         }
2053         if (x == _ex0) {
2054                 return _ex0;
2055         }
2056         if (x.info(info_flags::numeric) && (!x.info(info_flags::crational))) {
2057                 return H(m_, x).evalf();
2058         }
2059         return H(m_, x).hold();
2060 }
2061
2062
2063 static ex H_series(const ex& m, const ex& x, const relational& rel, int order, unsigned options)
2064 {
2065         epvector seq;
2066         seq.push_back(expair(H(m, x), 0));
2067         return pseries(rel, seq);
2068 }
2069
2070
2071 static ex H_deriv(const ex& m_, const ex& x, unsigned deriv_param)
2072 {
2073         GINAC_ASSERT(deriv_param < 2);
2074         if (deriv_param == 0) {
2075                 return _ex0;
2076         }
2077         lst m;
2078         if (is_a<lst>(m_)) {
2079                 m = ex_to<lst>(m_);
2080         } else {
2081                 m = lst(m_);
2082         }
2083         ex mb = *m.begin();
2084         if (mb > _ex1) {
2085                 m[0]--;
2086                 return H(m, x) / x;
2087         }
2088         if (mb < _ex_1) {
2089                 m[0]++;
2090                 return H(m, x) / x;
2091         }
2092         m.remove_first();
2093         if (mb == _ex1) {
2094                 return 1/(1-x) * H(m, x);
2095         } else if (mb == _ex_1) {
2096                 return 1/(1+x) * H(m, x);
2097         } else {
2098                 return H(m, x) / x;
2099         }
2100 }
2101
2102
2103 static void H_print_latex(const ex& m_, const ex& x, const print_context& c)
2104 {
2105         lst m;
2106         if (is_a<lst>(m_)) {
2107                 m = ex_to<lst>(m_);
2108         } else {
2109                 m = lst(m_);
2110         }
2111         c.s << "\\mbox{H}_{";
2112         lst::const_iterator itm = m.begin();
2113         (*itm).print(c);
2114         itm++;
2115         for (; itm != m.end(); itm++) {
2116                 c.s << ",";
2117                 (*itm).print(c);
2118         }
2119         c.s << "}(";
2120         x.print(c);
2121         c.s << ")";
2122 }
2123
2124
2125 REGISTER_FUNCTION(H,
2126                   evalf_func(H_evalf).
2127                   eval_func(H_eval).
2128                   series_func(H_series).
2129                   derivative_func(H_deriv).
2130                   print_func<print_latex>(H_print_latex).
2131                   do_not_evalf_params());
2132
2133
2134 // takes a parameter list for H and returns an expression with corresponding multiple polylogarithms
2135 ex convert_H_to_Li(const ex& m, const ex& x)
2136 {
2137         map_trafo_H_reduce_trailing_zeros filter;
2138         map_trafo_H_convert_to_Li filter2;
2139         if (is_a<lst>(m)) {
2140                 return filter2(filter(H(m, x).hold()));
2141         } else {
2142                 return filter2(filter(H(lst(m), x).hold()));
2143         }
2144 }
2145
2146
2147 //////////////////////////////////////////////////////////////////////
2148 //
2149 // Multiple zeta values  zeta(x) and zeta(x,s)
2150 //
2151 // helper functions
2152 //
2153 //////////////////////////////////////////////////////////////////////
2154
2155
2156 // anonymous namespace for helper functions
2157 namespace {
2158
2159
2160 // parameters and data for [Cra] algorithm
2161 const cln::cl_N lambda = cln::cl_N("319/320");
2162 int L1;
2163 int L2;
2164 std::vector<std::vector<cln::cl_N> > f_kj;
2165 std::vector<cln::cl_N> crB;
2166 std::vector<std::vector<cln::cl_N> > crG;
2167 std::vector<cln::cl_N> crX;
2168
2169
2170 void halfcyclic_convolute(const std::vector<cln::cl_N>& a, const std::vector<cln::cl_N>& b, std::vector<cln::cl_N>& c)
2171 {
2172         const int size = a.size();
2173         for (int n=0; n<size; n++) {
2174                 c[n] = 0;
2175                 for (int m=0; m<=n; m++) {
2176                         c[n] = c[n] + a[m]*b[n-m];
2177                 }
2178         }
2179 }
2180
2181
2182 // [Cra] section 4
2183 void initcX(const std::vector<int>& s)
2184 {
2185         const int k = s.size();
2186
2187         crX.clear();
2188         crG.clear();
2189         crB.clear();
2190
2191         for (int i=0; i<=L2; i++) {
2192                 crB.push_back(bernoulli(i).to_cl_N() / cln::factorial(i));
2193         }
2194
2195         int Sm = 0;
2196         int Smp1 = 0;
2197         for (int m=0; m<k-1; m++) {
2198                 std::vector<cln::cl_N> crGbuf;
2199                 Sm = Sm + s[m];
2200                 Smp1 = Sm + s[m+1];
2201                 for (int i=0; i<=L2; i++) {
2202                         crGbuf.push_back(cln::factorial(i + Sm - m - 2) / cln::factorial(i + Smp1 - m - 2));
2203                 }
2204                 crG.push_back(crGbuf);
2205         }
2206
2207         crX = crB;
2208
2209         for (int m=0; m<k-1; m++) {
2210                 std::vector<cln::cl_N> Xbuf;
2211                 for (int i=0; i<=L2; i++) {
2212                         Xbuf.push_back(crX[i] * crG[m][i]);
2213                 }
2214                 halfcyclic_convolute(Xbuf, crB, crX);
2215         }
2216 }
2217
2218
2219 // [Cra] section 4
2220 cln::cl_N crandall_Y_loop(const cln::cl_N& Sqk)
2221 {
2222         cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
2223         cln::cl_N factor = cln::expt(lambda, Sqk);
2224         cln::cl_N res = factor / Sqk * crX[0] * one;
2225         cln::cl_N resbuf;
2226         int N = 0;
2227         do {
2228                 resbuf = res;
2229                 factor = factor * lambda;
2230                 N++;
2231                 res = res + crX[N] * factor / (N+Sqk);
2232         } while ((res != resbuf) || cln::zerop(crX[N]));
2233         return res;
2234 }
2235
2236
2237 // [Cra] section 4
2238 void calc_f(int maxr)
2239 {
2240         f_kj.clear();
2241         f_kj.resize(L1);
2242
2243         cln::cl_N t0, t1, t2, t3, t4;
2244         int i, j, k;
2245         std::vector<std::vector<cln::cl_N> >::iterator it = f_kj.begin();
2246         cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
2247
2248         t0 = cln::exp(-lambda);
2249         t2 = 1;
2250         for (k=1; k<=L1; k++) {
2251                 t1 = k * lambda;
2252                 t2 = t0 * t2;
2253                 for (j=1; j<=maxr; j++) {
2254                         t3 = 1;
2255                         t4 = 1;
2256                         for (i=2; i<=j; i++) {
2257                                 t4 = t4 * (j-i+1);
2258                                 t3 = t1 * t3 + t4;
2259                         }
2260                         (*it).push_back(t2 * t3 * cln::expt(cln::cl_I(k),-j) * one);
2261                 }
2262                 it++;
2263         }
2264 }
2265
2266
2267 // [Cra] (3.1)
2268 cln::cl_N crandall_Z(const std::vector<int>& s)
2269 {
2270         const int j = s.size();
2271
2272         if (j == 1) {
2273                 cln::cl_N t0;
2274                 cln::cl_N t0buf;
2275                 int q = 0;
2276                 do {
2277                         t0buf = t0;
2278                         q++;
2279                         t0 = t0 + f_kj[q+j-2][s[0]-1];
2280                 } while (t0 != t0buf);
2281
2282                 return t0 / cln::factorial(s[0]-1);
2283         }
2284
2285         std::vector<cln::cl_N> t(j);
2286
2287         cln::cl_N t0buf;
2288         int q = 0;
2289         do {
2290                 t0buf = t[0];
2291                 q++;
2292                 t[j-1] = t[j-1] + 1 / cln::expt(cln::cl_I(q),s[j-1]);
2293                 for (int k=j-2; k>=1; k--) {
2294                         t[k] = t[k] + t[k+1] / cln::expt(cln::cl_I(q+j-1-k), s[k]);
2295                 }
2296                 t[0] = t[0] + t[1] * f_kj[q+j-2][s[0]-1];
2297         } while (t[0] != t0buf);
2298
2299         return t[0] / cln::factorial(s[0]-1);
2300 }
2301
2302
2303 // [Cra] (2.4)
2304 cln::cl_N zeta_do_sum_Crandall(const std::vector<int>& s)
2305 {
2306         std::vector<int> r = s;
2307         const int j = r.size();
2308
2309         // decide on maximal size of f_kj for crandall_Z
2310         if (Digits < 50) {
2311                 L1 = 150;
2312         } else {
2313                 L1 = Digits * 3 + j*2;
2314         }
2315
2316         // decide on maximal size of crX for crandall_Y
2317         if (Digits < 38) {
2318                 L2 = 63;
2319         } else if (Digits < 86) {
2320                 L2 = 127;
2321         } else if (Digits < 192) {
2322                 L2 = 255;
2323         } else if (Digits < 394) {
2324                 L2 = 511;
2325         } else if (Digits < 808) {
2326                 L2 = 1023;
2327         } else {
2328                 L2 = 2047;
2329         }
2330
2331         cln::cl_N res;
2332
2333         int maxr = 0;
2334         int S = 0;
2335         for (int i=0; i<j; i++) {
2336                 S += r[i];
2337                 if (r[i] > maxr) {
2338                         maxr = r[i];
2339                 }
2340         }
2341
2342         calc_f(maxr);
2343
2344         const cln::cl_N r0factorial = cln::factorial(r[0]-1);
2345
2346         std::vector<int> rz;
2347         int skp1buf;
2348         int Srun = S;
2349         for (int k=r.size()-1; k>0; k--) {
2350
2351                 rz.insert(rz.begin(), r.back());
2352                 skp1buf = rz.front();
2353                 Srun -= skp1buf;
2354                 r.pop_back();
2355
2356                 initcX(r);
2357
2358                 for (int q=0; q<skp1buf; q++) {
2359
2360                         cln::cl_N pp1 = crandall_Y_loop(Srun+q-k);
2361                         cln::cl_N pp2 = crandall_Z(rz);
2362
2363                         rz.front()--;
2364
2365                         if (q & 1) {
2366                                 res = res - pp1 * pp2 / cln::factorial(q);
2367                         } else {
2368                                 res = res + pp1 * pp2 / cln::factorial(q);
2369                         }
2370                 }
2371                 rz.front() = skp1buf;
2372         }
2373         rz.insert(rz.begin(), r.back());
2374
2375         initcX(rz);
2376
2377         res = (res + crandall_Y_loop(S-j)) / r0factorial + crandall_Z(rz);
2378
2379         return res;
2380 }
2381
2382
2383 cln::cl_N zeta_do_sum_simple(const std::vector<int>& r)
2384 {
2385         const int j = r.size();
2386
2387         // buffer for subsums
2388         std::vector<cln::cl_N> t(j);
2389         cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
2390
2391         cln::cl_N t0buf;
2392         int q = 0;
2393         do {
2394                 t0buf = t[0];
2395                 q++;
2396                 t[j-1] = t[j-1] + one / cln::expt(cln::cl_I(q),r[j-1]);
2397                 for (int k=j-2; k>=0; k--) {
2398                         t[k] = t[k] + one * t[k+1] / cln::expt(cln::cl_I(q+j-1-k), r[k]);
2399                 }
2400         } while (t[0] != t0buf);
2401
2402         return t[0];
2403 }
2404
2405
2406 // does Hoelder convolution. see [BBB] (7.0)
2407 cln::cl_N zeta_do_Hoelder_convolution(const std::vector<int>& m_, const std::vector<int>& s_)
2408 {
2409         // prepare parameters
2410         // holds Li arguments in [BBB] notation
2411         std::vector<int> s = s_;
2412         std::vector<int> m_p = m_;
2413         std::vector<int> m_q;
2414         // holds Li arguments in nested sums notation
2415         std::vector<cln::cl_N> s_p(s.size(), cln::cl_N(1));
2416         s_p[0] = s_p[0] * cln::cl_N("1/2");
2417         // convert notations
2418         int sig = 1;
2419         for (int i=0; i<s_.size(); i++) {
2420                 if (s_[i] < 0) {
2421                         sig = -sig;
2422                         s_p[i] = -s_p[i];
2423                 }
2424                 s[i] = sig * std::abs(s[i]);
2425         }
2426         std::vector<cln::cl_N> s_q;
2427         cln::cl_N signum = 1;
2428
2429         // first term
2430         cln::cl_N res = multipleLi_do_sum(m_p, s_p);
2431
2432         // middle terms
2433         do {
2434
2435                 // change parameters
2436                 if (s.front() > 0) {
2437                         if (m_p.front() == 1) {
2438                                 m_p.erase(m_p.begin());
2439                                 s_p.erase(s_p.begin());
2440                                 if (s_p.size() > 0) {
2441                                         s_p.front() = s_p.front() * cln::cl_N("1/2");
2442                                 }
2443                                 s.erase(s.begin());
2444                                 m_q.front()++;
2445                         } else {
2446                                 m_p.front()--;
2447                                 m_q.insert(m_q.begin(), 1);
2448                                 if (s_q.size() > 0) {
2449                                         s_q.front() = s_q.front() * 2;
2450                                 }
2451                                 s_q.insert(s_q.begin(), cln::cl_N("1/2"));
2452                         }
2453                 } else {
2454                         if (m_p.front() == 1) {
2455                                 m_p.erase(m_p.begin());
2456                                 cln::cl_N spbuf = s_p.front();
2457                                 s_p.erase(s_p.begin());
2458                                 if (s_p.size() > 0) {
2459                                         s_p.front() = s_p.front() * spbuf;
2460                                 }
2461                                 s.erase(s.begin());
2462                                 m_q.insert(m_q.begin(), 1);
2463                                 if (s_q.size() > 0) {
2464                                         s_q.front() = s_q.front() * 4;
2465                                 }
2466                                 s_q.insert(s_q.begin(), cln::cl_N("1/4"));
2467                                 signum = -signum;
2468                         } else {
2469                                 m_p.front()--;
2470                                 m_q.insert(m_q.begin(), 1);
2471                                 if (s_q.size() > 0) {
2472                                         s_q.front() = s_q.front() * 2;
2473                                 }
2474                                 s_q.insert(s_q.begin(), cln::cl_N("1/2"));
2475                         }
2476                 }
2477
2478                 // exiting the loop
2479                 if (m_p.size() == 0) break;
2480
2481                 res = res + signum * multipleLi_do_sum(m_p, s_p) * multipleLi_do_sum(m_q, s_q);
2482
2483         } while (true);
2484
2485         // last term
2486         res = res + signum * multipleLi_do_sum(m_q, s_q);
2487
2488         return res;
2489 }
2490
2491
2492 } // end of anonymous namespace
2493
2494
2495 //////////////////////////////////////////////////////////////////////
2496 //
2497 // Multiple zeta values  zeta(x)
2498 //
2499 // GiNaC function
2500 //
2501 //////////////////////////////////////////////////////////////////////
2502
2503
2504 static ex zeta1_evalf(const ex& x)
2505 {
2506         if (is_exactly_a<lst>(x) && (x.nops()>1)) {
2507
2508                 // multiple zeta value
2509                 const int count = x.nops();
2510                 const lst& xlst = ex_to<lst>(x);
2511                 std::vector<int> r(count);
2512
2513                 // check parameters and convert them
2514                 lst::const_iterator it1 = xlst.begin();
2515                 std::vector<int>::iterator it2 = r.begin();
2516                 do {
2517                         if (!(*it1).info(info_flags::posint)) {
2518                                 return zeta(x).hold();
2519                         }
2520                         *it2 = ex_to<numeric>(*it1).to_int();
2521                         it1++;
2522                         it2++;
2523                 } while (it2 != r.end());
2524
2525                 // check for divergence
2526                 if (r[0] == 1) {
2527                         return zeta(x).hold();
2528                 }
2529
2530                 // decide on summation algorithm
2531                 // this is still a bit clumsy
2532                 int limit = (Digits>17) ? 10 : 6;
2533                 if ((r[0] < limit) || ((count > 3) && (r[1] < limit/2))) {
2534                         return numeric(zeta_do_sum_Crandall(r));
2535                 } else {
2536                         return numeric(zeta_do_sum_simple(r));
2537                 }
2538         }
2539
2540         // single zeta value
2541         if (is_exactly_a<numeric>(x) && (x != 1)) {
2542                 try {
2543                         return zeta(ex_to<numeric>(x));
2544                 } catch (const dunno &e) { }
2545         }
2546
2547         return zeta(x).hold();
2548 }
2549
2550
2551 static ex zeta1_eval(const ex& m)
2552 {
2553         if (is_exactly_a<lst>(m)) {
2554                 if (m.nops() == 1) {
2555                         return zeta(m.op(0));
2556                 }
2557                 return zeta(m).hold();
2558         }
2559
2560         if (m.info(info_flags::numeric)) {
2561                 const numeric& y = ex_to<numeric>(m);
2562                 // trap integer arguments:
2563                 if (y.is_integer()) {
2564                         if (y.is_zero()) {
2565                                 return _ex_1_2;
2566                         }
2567                         if (y.is_equal(_num1)) {
2568                                 return zeta(m).hold();
2569                         }
2570                         if (y.info(info_flags::posint)) {
2571                                 if (y.info(info_flags::odd)) {
2572                                         return zeta(m).hold();
2573                                 } else {
2574                                         return abs(bernoulli(y)) * pow(Pi, y) * pow(_num2, y-_num1) / factorial(y);
2575                                 }
2576                         } else {
2577                                 if (y.info(info_flags::odd)) {
2578                                         return -bernoulli(_num1-y) / (_num1-y);
2579                                 } else {
2580                                         return _ex0;
2581                                 }
2582                         }
2583                 }
2584                 // zeta(float)
2585                 if (y.info(info_flags::numeric) && !y.info(info_flags::crational)) {
2586                         return zeta1_evalf(m);
2587                 }
2588         }
2589         return zeta(m).hold();
2590 }
2591
2592
2593 static ex zeta1_deriv(const ex& m, unsigned deriv_param)
2594 {
2595         GINAC_ASSERT(deriv_param==0);
2596
2597         if (is_exactly_a<lst>(m)) {
2598                 return _ex0;
2599         } else {
2600                 return zetaderiv(_ex1, m);
2601         }
2602 }
2603
2604
2605 static void zeta1_print_latex(const ex& m_, const print_context& c)
2606 {
2607         c.s << "\\zeta(";
2608         if (is_a<lst>(m_)) {
2609                 const lst& m = ex_to<lst>(m_);
2610                 lst::const_iterator it = m.begin();
2611                 (*it).print(c);
2612                 it++;
2613                 for (; it != m.end(); it++) {
2614                         c.s << ",";
2615                         (*it).print(c);
2616                 }
2617         } else {
2618                 m_.print(c);
2619         }
2620         c.s << ")";
2621 }
2622
2623
2624 unsigned zeta1_SERIAL::serial = function::register_new(function_options("zeta").
2625                                 evalf_func(zeta1_evalf).
2626                                 eval_func(zeta1_eval).
2627                                 derivative_func(zeta1_deriv).
2628                                 print_func<print_latex>(zeta1_print_latex).
2629                                 do_not_evalf_params().
2630                                 overloaded(2));
2631
2632
2633 //////////////////////////////////////////////////////////////////////
2634 //
2635 // Alternating Euler sum  zeta(x,s)
2636 //
2637 // GiNaC function
2638 //
2639 //////////////////////////////////////////////////////////////////////
2640
2641
2642 static ex zeta2_evalf(const ex& x, const ex& s)
2643 {
2644         if (is_exactly_a<lst>(x)) {
2645
2646                 // alternating Euler sum
2647                 const int count = x.nops();
2648                 const lst& xlst = ex_to<lst>(x);
2649                 const lst& slst = ex_to<lst>(s);
2650                 std::vector<int> xi(count);
2651                 std::vector<int> si(count);
2652
2653                 // check parameters and convert them
2654                 lst::const_iterator it_xread = xlst.begin();
2655                 lst::const_iterator it_sread = slst.begin();
2656                 std::vector<int>::iterator it_xwrite = xi.begin();
2657                 std::vector<int>::iterator it_swrite = si.begin();
2658                 do {
2659                         if (!(*it_xread).info(info_flags::posint)) {
2660                                 return zeta(x, s).hold();
2661                         }
2662                         *it_xwrite = ex_to<numeric>(*it_xread).to_int();
2663                         if (*it_sread > 0) {
2664                                 *it_swrite = 1;
2665                         } else {
2666                                 *it_swrite = -1;
2667                         }
2668                         it_xread++;
2669                         it_sread++;
2670                         it_xwrite++;
2671                         it_swrite++;
2672                 } while (it_xwrite != xi.end());
2673
2674                 // check for divergence
2675                 if ((xi[0] == 1) && (si[0] == 1)) {
2676                         return zeta(x, s).hold();
2677                 }
2678
2679                 // use Hoelder convolution
2680                 return numeric(zeta_do_Hoelder_convolution(xi, si));
2681         }
2682
2683         return zeta(x, s).hold();
2684 }
2685
2686
2687 static ex zeta2_eval(const ex& m, const ex& s_)
2688 {
2689         if (is_exactly_a<lst>(s_)) {
2690                 const lst& s = ex_to<lst>(s_);
2691                 for (lst::const_iterator it = s.begin(); it != s.end(); it++) {
2692                         if ((*it).info(info_flags::positive)) {
2693                                 continue;
2694                         }
2695                         return zeta(m, s_).hold();
2696                 }
2697                 return zeta(m);
2698         } else if (s_.info(info_flags::positive)) {
2699                 return zeta(m);
2700         }
2701
2702         return zeta(m, s_).hold();
2703 }
2704
2705
2706 static ex zeta2_deriv(const ex& m, const ex& s, unsigned deriv_param)
2707 {
2708         GINAC_ASSERT(deriv_param==0);
2709
2710         if (is_exactly_a<lst>(m)) {
2711                 return _ex0;
2712         } else {
2713                 if ((is_exactly_a<lst>(s) && s.op(0).info(info_flags::positive)) || s.info(info_flags::positive)) {
2714                         return zetaderiv(_ex1, m);
2715                 }
2716                 return _ex0;
2717         }
2718 }
2719
2720
2721 static void zeta2_print_latex(const ex& m_, const ex& s_, const print_context& c)
2722 {
2723         lst m;
2724         if (is_a<lst>(m_)) {
2725                 m = ex_to<lst>(m_);
2726         } else {
2727                 m = lst(m_);
2728         }
2729         lst s;
2730         if (is_a<lst>(s_)) {
2731                 s = ex_to<lst>(s_);
2732         } else {
2733                 s = lst(s_);
2734         }
2735         c.s << "\\zeta(";
2736         lst::const_iterator itm = m.begin();
2737         lst::const_iterator its = s.begin();
2738         if (*its < 0) {
2739                 c.s << "\\overline{";
2740                 (*itm).print(c);
2741                 c.s << "}";
2742         } else {
2743                 (*itm).print(c);
2744         }
2745         its++;
2746         itm++;
2747         for (; itm != m.end(); itm++, its++) {
2748                 c.s << ",";
2749                 if (*its < 0) {
2750                         c.s << "\\overline{";
2751                         (*itm).print(c);
2752                         c.s << "}";
2753                 } else {
2754                         (*itm).print(c);
2755                 }
2756         }
2757         c.s << ")";
2758 }
2759
2760
2761 unsigned zeta2_SERIAL::serial = function::register_new(function_options("zeta").
2762                                 evalf_func(zeta2_evalf).
2763                                 eval_func(zeta2_eval).
2764                                 derivative_func(zeta2_deriv).
2765                                 print_func<print_latex>(zeta2_print_latex).
2766                                 do_not_evalf_params().
2767                                 overloaded(2));
2768
2769
2770 } // namespace GiNaC
2771