학술논문
On the Structure of Compatible Rational Functions
Document Type
Working Paper
Author
Source
Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, pages 91--98, 2011, ACM
Subject
Language
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.