A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations
Symbolic Computation
2011-01-17 v1
Abstract
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and aperiodic factors in the denominator, and we gave an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.
Cite
@article{arxiv.1101.2803,
title = {A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations},
author = {Manuel Kauers and Carsten Schneider},
journal= {arXiv preprint arXiv:1101.2803},
year = {2011}
}