The method of creative telescoping
From MaRDI portal
Recommendations
- A fast approach to creative telescoping
- A reduction approach to creative telescoping
- The Art of Telescoping
- scientific article; zbMATH DE number 4049641
- Efficient rational creative telescoping
- The method of combinatorial telescoping
- Creative telescoping for holonomic functions
- Some open problems related to creative telescoping
- Creative telescoping on multiple sums
- On the order of the recurrence produced by the method of creative telescoping
Cites work
- A fast algorithm for proving terminating hypergeometric identities
- A holonomic systems approach to special functions identities
- A proof that Euler missed. Apéry's proof of the irrationality of (3). An informal report
- A purely verification proof of the first Rogers-Ramanujan identity
- Algorithmic Information Theory
- Axioms and hulls
- Decision procedure for indefinite hypergeometric summation
- How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?
- scientific article; zbMATH DE number 3780556 (Why is no real title available?)
- scientific article; zbMATH DE number 3786948 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3467565 (Why is no real title available?)
- scientific article; zbMATH DE number 3016223 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficients
- Rational Functions Certify Combinatorial Identities
- Resurrecting the asymptotics of linear recurrences
- Some Hypergeometric Orthogonal Polynomials
- Strange Evaluations of Hypergeometric Series
- The method of differentiating under the integral sign
- Towards computerized proofs of identities
Cited in
(only showing first 100 items - show all)- Rogers-Ramanujan computer searches
- Enumeration of bilaterally symmetric 3-noncrossing partitions
- Extended Zeilberger's algorithm for identities on Bernoulli and Euler polynomials
- A \(q\)-analogue of Zhang's binomial coefficient identities
- A holonomic systems approach to special functions identities
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- An approach to the zero recognition problem by Buchberger algorithm
- The number of centered lozenge tilings of a symmetric hexagon
- On Zeilberger's algorithm and its \(q\)-analogue
- The death of proof? Semi-rigorous mathematics? You've got to be kidding!
- Binomial identities -- combinatorial and algorithmic aspects
- Enumeration of noncrossing trees on a circle
- (--1)-enumeration of plane partitions with complementation symmetry
- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- When does Zeilberger's algorithm succeed?
- An operator inequality and self-adjointness.
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
- Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects
- Proof of the Wilf-Zeilberger conjecture for mixed hypergeometric terms
- A classification of Motzkin numbers modulo 8
- The Gauss-Bonnet theorem and Crofton-type formulas in complex space forms
- The dimensional recurrence and analyticity method for multicomponent master integrals: using unitarity cuts to construct homogeneous solutions
- Elimination of variables in linear solvable polynomial algebras and \(\delta\)-holonomicity
- On the structure of multivariate hypergeometric terms.
- Harmonic interpolation based on Radon projections along the sides of regular polygons
- Multibasic and mixed hypergeometric Gosper-type algorithms
- Walsh functions, scrambled \(( 0 , m , s )\)-nets, and negative covariance: applying symbolic computation to quasi-Monte Carlo integration
- A three-term recurrence relation for accurate evaluation of transition probabilities of the simple birth-and-death process
- On rational and hypergeometric solutions of linear ordinary difference equations in \(\Pi\Sigma^\ast\)-field extensions
- Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths
- Telescoping method, summation formulas, and inversion pairs
- Creative telescoping on multiple sums
- Simultaneous bifurcation of limit cycles and critical periods
- The absent-minded passengers problem: a motivating challenge solved by computer algebra
- A case study for \(\zeta (4)\)
- q-rational reduction and q-analogues of series for
- On some combinatorial sequences associated to invariant theory
- Constructing minimal telescopers for rational functions in three discrete variables
- Convolutions of Liouvillian sequences
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
- Computation of the expected Euler characteristic for the largest eigenvalue of a real non-central Wishart matrix
- A diagrammatic approach to the AJ conjecture
- Minimal representations and algebraic relations for single nested products
- Reducing radicals in the spirit of Euclid
- On the existence of telescopers for rational functions in three variables
- Renormalization of non-singlet quark operator matrix elements for off-forward hard scattering
- Binomial determinants for tiling problems yield to the holonomic ansatz
- On the length of integers in telescopers for proper hypergeometric terms
- An algorithm for deciding the summability of bivariate rational functions
- Structural theorems for symbolic summation
- Hankel determinants for convolution powers of Catalan numbers
- Hypergeometric identities arising from the elephant random walk
- Linear differential equations as a data structure
- Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
- Trusting computations: a mechanized proof from partial differential equations to actual program
- Some open problems related to creative telescoping
- Reduction-based creative telescoping for Fuchsian D-finite functions
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- The method of combinatorial telescoping
- Minors of a class of Riordan arrays related to weighted partial Motzkin paths
- Applicability of the \(q\)-analogue of Zeilberger's algorithm
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
- On homogeneous Zeilberger recurrences
- A telescoping method for double summations
- On the order of the recurrence produced by the method of creative telescoping
- Loops, matchings and alternating-sign matrices
- Effective scalar products of D-finite symmetric functions
- Advanced determinant calculus: a complement
- On the computation of the parameterized differential Galois group for a second-order linear differential equation with differential parameters
- \texttt{RRtools} -- a Maple package for aiding the discovery and proof of finite Rogers-Ramanujan type identities
- Telescoping in the context of symbolic summation in Maple
- Current trends in asymptotics: Some problems and some solutions
- An algorithmic approach to the q-summability problem of bivariate rational functions
- Constructing reductions for creative telescoping. The general differentially finite case
- The card guessing game: a generating function approach
- The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients
- Computing periods of rational integrals
- Resultant-free computation of indefinite hyperexponential integrals
- On the optimal systems of subalgebras for the equations of hydrodynamic stability analysis of smooth shear flows and their group-invariant solutions
- Integral Representation and Algorithms for Closed Form Summation
- Gaussian hypergeometric series and supercongruences
- Signed enumeration of upper-right corners in path shuffles
- A Sequence of Polynomials Generated by a Kapteyn Series of the Second Kind
- Proof of a conjecture of Z.-W. Sun on ratio monotonicity
- On the wrapping correction to single magnon energy in twisted \({\mathcal N}=4\) SYM
- New proofs of two q-analogues of Koshy's formula
- Multiple binomial sums
- Rational Functions Certify Combinatorial Identities
- Fully packed loop models on finite geometries
- Irreducibility of \(q\)-difference operators and the knot \(7_{4}\)
- scientific article; zbMATH DE number 4005607 (Why is no real title available?)
- Rational function certification of multisum/integral/“𝑞” identities
- Some new binomial sums related to the Catalan triangle
- Combinatorial telescoping for an identity of Andrews on parity in partitions
- The extended Zeilberger algorithm with parameters
- Trading order for degree in creative telescoping
- Identities for families of orthogonal polynomials and special functions
- Residues and telescopers for bivariate rational functions
- A combinatorial-probabilistic analysis of bitcoin attacks
- Reduction formula of a double binomial sum
This page was built for publication: The method of creative telescoping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176785)
