scientific article; zbMATH DE number 3511549
From MaRDI portal
Publication:4091406
Cited in
(25)- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- When does Zeilberger's algorithm succeed?
- Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects
- Indefinite summation of rational functions with factorization of denominators
- Polynomial reduction and supercongruences
- On the existence of telescopers for rational functions in three variables
- Accelerating indefinite summation: simple classes of summands
- An algorithm for deciding the summability of bivariate rational functions
- Reduction-based creative telescoping for Fuchsian D-finite functions
- Telescoping in the context of symbolic summation in Maple
- An algorithmic approach to the q-summability problem of bivariate rational functions
- Integral Representation and Algorithms for Closed Form Summation
- How to generate all possible rational Wilf-Zeilberger pairs?
- On the summability of bivariate rational functions
- Residues and telescopers for bivariate rational functions
- On the existence of telescopers for mixed hypergeometric terms
- Term algebras, canonical representations and difference ring theory for symbolic summation
- Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱
- Separability problems in creative telescoping
- How to generate all possible rational Wilf-Zeilberger forms?
- Symbolic summation in multivariate difference fields
- Rational normal forms and minimal decompositions of hypergeometric terms
- Parallel summation in P-recursive extensions
- Title not available (Why is no real title available?)
- Differential Galois theory of linear difference equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091406)