On the Structure of Compatible Rational Functions
Symbolic Computation
2013-01-24 v2 Combinatorics
Abstract
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the structure of compatible rational functions. The theorem enables us to decompose a solution of such a system as a product of a rational function, several symbolic powers, a hyperexponential function, a hypergeometric term, and a q-hypergeometric term. We outline an algorithm for computing this product, and present an application.
Cite
@article{arxiv.1301.5046,
title = {On the Structure of Compatible Rational Functions},
author = {Shaoshi Chen and Ruyong Feng and Guofeng Fu and Ziming Li},
journal= {arXiv preprint arXiv:1301.5046},
year = {2013}
}