Greatest factorial factorization and symbolic summation

DOI10.1006/jsco.1995.1049zbMath0854.68047OpenAlexW1991191994MaRDI QIDQ1914161

Paule, Peter

Publication date: 4 June 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/520f25d1fbd30e277c14250f93f49dbb84069c8a

zbMATH Keywords

Gosper's algorithmhypergeometric sequencesgreatest factorial factorization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Differential algebra (12H05)

Related Items (41)

Efficient rational creative telescoping ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ Telescoping in the context of symbolic summation in Maple ⋮ Constructing minimal telescopers for rational functions in three discrete variables ⋮ On the summability of bivariate rational functions ⋮ Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱ ⋮ A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. ⋮ Interview with Peter Paule ⋮ Representation of hypergeometric products of higher nesting depths in difference rings ⋮ A symbolic summation approach to Feynman integral calculus ⋮ Computer proofs of a new family of harmonic number identities. ⋮ Residues and telescopers for bivariate rational functions ⋮ Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects ⋮ Minimal representations and algebraic relations for single nested products ⋮ Identities for families of orthogonal polynomials and special functions ⋮ A refined difference field theory for symbolic summation ⋮ Parameterized telescoping proves algebraic independence of sums ⋮ On the Gosper-Petkovšek representation of rational functions ⋮ Fast computation of special resultants ⋮ Multibasic and mixed hypergeometric Gosper-type algorithms ⋮ A difference ring theory for symbolic summation ⋮ Differential Galois theory of linear difference equations ⋮ Summation algorithms for Stirling number identities ⋮ Converging to Gosper's algorithm ⋮ Rational solutions of ordinary difference equations ⋮ Indefinite summation of rational functions with factorization of denominators ⋮ Accelerating indefinite summation: simple classes of summands ⋮ An algorithm for deciding the summability of bivariate rational functions ⋮ Rational normal forms and minimal decompositions of hypergeometric terms ⋮ Polynomial ring automorphisms, rational \((w,\sigma )\)-canonical forms, and the assignment problem ⋮ Structural theorems for symbolic summation ⋮ SIMPLIFYING SUMS IN ΠΣ*-EXTENSIONS ⋮ Integral Representation and Algorithms for Closed Form Summation ⋮ Indefinite summation with unspecified summands ⋮ Symbolic additive decomposition of rational functions ⋮ Rational solutions of first-order algebraic ordinary difference equations ⋮ Simplifying Multiple Sums in Difference Fields ⋮ On solutions of linear ordinary difference equations in their coefficient field ⋮ Contiguous Relations and Creative Telescoping ⋮ Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation ⋮ The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals

This page was built for publication: Greatest factorial factorization and symbolic summation