Deciding summability via residues in theory and in practice
By: Carlos E. Arreche
Potential Business Impact:
Solves hard math problems for computers.
In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In 2012 Chen and Singer introduced discrete residues as a theoretical obstruction to summability for rational functions with respect to the shift and $q$-dilation difference operators. Since then analogous notions of discrete residues have been defined in other difference settings relevant for applications, such as for Mahler and elliptic shift difference operators. Very recently there have been some advances in making these theoretical obstructions computable in practice.
Similar Papers
A computational approach to rational summability and its applications via discrete residues
Symbolic Computation
Finds math tricks to solve hard computer problems.
D-algebraic Guessing
Symbolic Computation
Finds math rules from a few numbers.
Telescoping Algorithms for $Σ^*$-Extensions via Complete Reductions
Symbolic Computation
Solves hard math problems by breaking them down.