Constructing minimal telescopers for rational functions in three discrete variables

From MaRDI portal
Publication:2168558



Abstract: We present a new algorithm for constructing minimal telescopers for rational functions in three discrete variables. This is the first discrete reduction-based algorithm that goes beyond the bivariate case. The termination of the algorithm is guaranteed by a known existence criterion of telescopers. Our approach has the important feature that it avoids the potentially costly computation of certificates. Computational experiments are also provided so as to illustrate the efficiency of our approach.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Constructing minimal telescopers for rational functions in three discrete variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168558)