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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of ISSAC 2011 |
| Editors | Anton Leykin |
| Pages | 91-98 |
| Number of pages | 8 |
| Publication status | Published - Jun 2011 |
Fields of science
- 101001 Algebra
- 101002 Analysis
- 101 Mathematics
- 102 Computer Sciences
- 102011 Formal languages
- 101009 Geometry
- 101013 Mathematical logic
- 101020 Technical mathematics
- 101025 Number theory
- 101012 Combinatorics
- 101005 Computer algebra
- 101006 Differential geometry
- 101003 Applied geometry
- 102025 Distributed systems
JKU Focus areas
- Computation in Informatics and Mathematics