Abstract
We showcase a collection of practical strategies to deal with a problem arising from an analysis of integral estimators derived via quasi-Monte Carlo methods. The problem reduces to a triple binomial sum, thereby enabling us to open up the holonomic toolkit, which contains tools such as creative telescoping that can be used to deduce a recurrence satisfied by the sum. While applying these techniques, a host of issues arose that partly needed to be resolved by hand. In other words, no creative telescoping implementation currently exists that can resolve all these issues automatically. Thus, we felt the need to compile the different strategies we tried and the difficulties that we encountered along the way. In particular, we highlight the necessity of the certificate in these computations and how its complexity can greatly influence the computation time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, G., Paule, P., Schneider, C.: Plane partitions VI: Stembridge’s TSPP theorem. Adv. Appl. Math. (2005). https://doi.org/10.1016/j.aam.2004.07.008
Bostan, A., Lairez, P., Salvy, B.: Multiple binomial sums. J. Symb. Computat. 80, 351–386 (2017). https://doi.org/10.1016/j.jsc.2016.04.002
Chyzak, F.: Gröbner bases, symbolic summation and symbolic integration. In: Buchberge,, B., Winkler, F. (eds.) Gröbner Bases and Applications. Proceedings of the Conference 33 Years of Gröbner Bases. London Mathematical Society Lecture Notes Series, vol. 251, pp. 32–60. Cambridge University Press (1998) (ISBN 0-521-63298-6)
Chyzak, F., Mahboubi, A., Sibut-Pinote, T., Tassi, E.: A computer-algebra-based formal proof of the irrationality of \(\zeta (3)\). In: Klein, G., Gamboa, R. (eds.) ITP 2014: Interactive Theorem Proving, vol. 8558, pp. 160–176. Springer (2014). https://doi.org/10.1007/978-3-319-08970-6_11
Dick, J., Hinrichs, A., Pillichsammer, F.: Proof techniques in quasi-Monte Carlo theory. J. Complex. 31, 327–371 (2015)
Dick, J., Pillichshammer, F.: Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press (2010)
Kauers, M.: Guessing handbook. Technical Report 09-07, RISC Report Series, Johannes Kepler University, Linz, Austria (2009). http://www.risc.jku.at/research/combinat/software/Guess/
Kauers, M., Jaroschek, M., Johansson, F.: Ore polynomials in Sage. Lect. Notes Comput. Sci. 8942, 105–125 (2015). https://doi.org/10.1007/978-3-319-15081-9_6
Koutschan, C.: Advanced applications of the holonomic systems approach. Ph.D. thesis, Johannes Kepler University, Linz, Austria (2009)
Koutschan, C.: HolonomicFunctions (user’s guide). Technial Report 10-01, RISC Report Series, Johannes Kepler University, Linz, Austria (2010). http://www.risc.jku.at/research/combinat/software/HolonomicFunctions/
Koutschan, C., Wong, E.: Mathematica implementations for this paper in the notebook CTsums.nb and for [17] in the notebook computations.nb. https://wongey.github.io/digital-nets-walsh/
Lyons, R., Paule, P., Riese, A.: A computer proof of a series evaluation in terms of harmonic numbers. Appl. Algebra Eng. Commun. Comput. 13, 327–333 (2002)
Prodinger, H.: Descendants in heap ordered trees or a triumph of computer algebra. Electron. J. Comb. 3, R29 (1996)
Schneider, C.: Symbolic summation assists combinatorics. Séminaire Lotharingien de Combinatoire 56, 1–36 (2007), Article B56b. http://www.risc.jku.at/research/combinat/software/Sigma/
Wegschaider, K.: Computer generated proofs of binomial multi-sum identities. Ph.D. thesis, Johannes Kepler University, Linz, Austria (1997)
Wiart, J., Lemieux, C., Dong, G.: On the dependence structure of scrambled \((t,m,s)\)-nets. arXiv:1903.09877 (2019)
Wiart, J., Wong, E.: Walsh functions, scrambled \((0, m, s)\)-nets, and negative covariance: applying symbolic computation to quasi-Monte Carlo integration. Math. Comput. Simul. 182, 277–295 (2021)
Zeilberger, D.: A holonomic systems approach to special functions identities. J. Comput. Appl. Math. 32, 321–368 (1990)
Zeilberger, D.: The method of creative telescoping. J. Symb. Comput. 11(3), 195–204 (1991)
Acknowledgements
We would like to thank the organizers of CASC 2020 for providing an occasion and opportunity to give a talk about the work on which this article is based. We were encouraged by the positive feedback from the audience, which motivated this post-proceedings contribution. We would especially like to acknowledge Pierre Lairez for pointing us to his paper [2] and for demonstrating how to make the computation in Sect. 3.8 with his binomial sums Maple package. We thank the reviewers for their careful reading, which helped us improve this manuscript greatly, particularly the second reviewer who pointed out some related literature and provided insightful criticism. We also express our appreciation to Hao Du and Ali Uncu for their support and helpful commentary.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Both authors were supported by the Austrian Science Fund (FWF): F5011-N15.
Rights and permissions
About this article
Cite this article
Koutschan, C., Wong, E. Creative Telescoping on Multiple Sums. Math.Comput.Sci. 15, 483–498 (2021). https://doi.org/10.1007/s11786-021-00514-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-021-00514-3