- Full text PDF available (2)
- This year (2)
- Last 5 years (6)
- Last 10 years (13)
Journals and Conferences
An algorithm for finding a universal denominator of rational solutions of a system of linear difference equations with polynomial coefficients is proposed. The equations may have arbitrary orders.
Complexities of some well-known algorithms for finding rational solutions of linear difference equations with polynomial coefficients are studied.
The paper considers implementation of the Singer-Hendriks algorithm in the MAPLE computer algebra system. The algorithm finds Liouvillian solutions of linear recurrence equations with coefficients in… (More)
We consider linear homogeneous difference equations with rational-function coefficients. The search for solutions in the form of the minterlacing (1 ≤ m ≤ ord L, where L is a given operator) of… (More)
Construction of Laurent, regular, and formal (exponential–logarithmic) solutions of full-rank linear ordinary differential systems is discussed. The systems may have an arbitrary order, and their… (More)
Systems of linear q-difference equations with polynomial coefficients are considered. Equations in the system may have arbitrary orders. For such systems, algorithms for searching polynomial,… (More)
In the paper, an implementation in the computer algebra system Maple of an approach to summation based on hypergeometric pattern matching is considered. In spite of a number of existing modern… (More)
The following problem is considered: given a system of linear ordinary differential equations of arbitrary order with power series coefficients, to recognize whether it has regular solutions at point… (More)