Maple Student Edition
Maple Personal Edition
Maple Player for iPad
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Other Application Areas
High Schools & Two-Year Colleges
Testing & Assessment
High Performance Computing
Maple Ambassador Program
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
LREtools[IsDesingularizable] - test for desingularizable linear recurrence equations
linear recurrence equation with coefficients which are polynomials in n
function name, for example, v(n)
sequence of optional arguments
The IsDesingularizable['trailing'], IsDesingularizable['leading'], IsDesingularizable['both'] commands determine if eqn is desingularizable related to trailing, leading or both coefficients respectively. If the IsDesingularizable command is called without an index, the IsDesingularizable['both'] is meant.
For the given eqn=P v(n) (where P is a difference operator with polynomial coefficients) integer roots x1<x2<...<xk of its trailing coefficient are called t-singularities. For all integer roots z1<z2<...<zp of its leading coefficient, zi+d are called l-singularities where d is an order of the operator P.
A recurrence T v(n) with polynomial coefficients, such that the operator T is right divisible by P and either T v(n) has no t-singularities or its t-singularities are x1<x2<...<xm where m<k and m is minimal, is called t-desingularization of P v(n). Similarly, T v(n), such that T is right divisible by P and either T v(n) has no l-singularities or its l-singularities are zr+d<...<zp+d, where 1<r and r is maximal, is called l-desingularization of P v(n).
If there is t-(resp. l-)-desingularization then P v(n) is called t-(resp. l)-desingularizable.
If P v(n) is desingularizable related to both trailing and leading coefficients (i.e. lt-desingularizable) there is its lt-desingularization which has only x1<=x2<=...<=xm t-singularities and zr+d<=...<=zp+d l-singularities.
For example, it is useful to have a desingularization for solving the continuation problem. The singularities of the recurrence may present obstacles to continuing sequences which satisfy it. The desingularization can overcome those obstacles by removing these singularities.
Each optional argument is of the type option = value. The following options are supported.
Specifies the name T that is assigned to the t-(resp. l-,lt-)-desingularization if P v(n) is t-(resp. l-,lt-)-desingularizable, or is assigned to NULL otherwise.
Specifies the name S that is assigned to a set of t-(resp. l-)-singularities of T v(n) if P v(n) is t-(resp. l-)-desingularizable, or is assigned to t-(resp. l-)-singularities of P v(n) otherwise. In the case of lt-desingularization this option is ignored.
Abramov, S.A., and van Hoeij, M. "Desingularization of Linear Difference Operators with Polynomial Coefficients." Proceedings ISSAC'99, pp. 269-275. 1999.
Abramov, S.A.; Barkatou, M.A.; and van Hoeij, M. "Apparent Singularities of Linear Difference Equations with Polynomial Coefficients", http://arXiv.org/abs/math.CA/0409508.
Mitichkina, A.M. "On an Implementation of Desingularization of Linear Recurrence Operators with Polynomial Coefficients." CAAP-2001, pp. 212-221. 2001.
Download Help Document