Journal article icon

Journal article

On the Representation of Non-Holonomic Power Series

Abstract:
Holonomic functions play an essential role in Computer Algebra since they allow the application of many symbolic algorithms. Among all algorithmic attempts to find formulas for power series, the holonomic property remains the most important requirement to be satisfied by the function under consideration. The targeted functions mainly summarize that of meromorphic functions. However, expressions like tan(z), z/(exp(z)-1), sec(z), etc. are not holonomic, therefore their power series are inaccessible by non-pattern matching implementations like the current Maple convert/FormalPowerSeries up to Maple 2021. From the mathematical dictionaries, one can observe that most of the known closed-form formulas of non-holonomic power series involve another sequence whose evaluation depends on some finite summations. In the case of tan(z) and sec(z) the corresponding sequences are the Bernoulli and Euler numbers, respectively. Thus providing a symbolic approach that yields complete representations when linear summations for power series coefficients of non-holonomic functions appear, might be seen as a step forward towards the representation of non-holonomic power series. By adapting the method of ansatz with undetermined coefficients, we build an algorithm that computes least-order quadratic differential equations with polynomial coefficients for a large class of non-holonomic functions. A differential equation resulting from this procedure is converted into a recurrence equation by applying the Cauchy product formula and rewriting powers into polynomials and derivatives into shifts. Finally, using enough initial values we are able to give normal form representations (Geddes et al. 1992) to characterize several non-holonomic power series. As a consequence of the defined normal relation, it turns out that our algorithm is able to detect identities between non-holonomic functions that were not accessible in the past. We discuss this algorithm and its implementation for Maple 2022. Our Maple and Maxima implementations are available under the FPS software which can be downloaded at http://www.mathematik.uni-kassel.de/~bteguia/FPS_webpage/FPS.htm.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Publisher copy:
10.5206/mt.v2i1.14315

Authors

More by this author
Institution:
University of Oxford
Role:
Author
ORCID:
0000-0001-9199-7077


Publisher:
University of Western Ontario, Western Libraries
Journal:
Maple Transactions More from this journal
Volume:
2
Issue:
1
Publication date:
2022-09-05
DOI:
EISSN:
2564-3029
ISSN:
2564-3029


Language:
English
Keywords:
Pubs id:
2308299
UUID:
uuid_38af3195-4e46-4cd2-94d5-ff868182194c
Local pid:
pubs:2308299
Source identifiers:
W3199701932
Deposit date:
2025-11-05
ARK identifier:
This ORA record was generated from metadata provided by an external service. It has not been edited by the ORA Team.

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP