Affiliation:
1. Nonlinear Algebra Group, Leipzig, Germany
2. University of Kassel, Kassel, Germany
Abstract
Linear recurrence equations with constant coefficients define the power series coefficients of rational functions. However, one usually prefers to have an explicit formula for the sequence of coefficients, provided that such a formula is "simple" enough. Simplicity is related to the compactness of the formula due to the presence of algebraic numbers: "the smaller, the simpler". This poster showcases the capacity of recent updates on the Formal Power Series (FPS) algorithm, implemented in Maxima and Maple (convert/FormalPowerSeries), to find simple formulas for sequences like those from https://oeis.org/A307717, https://oeis.org/A226782, or https://oeis.org/A226784 by computing power series representations of their correctly guessed generating functions. We designed the algorithm for the more general context of univariate
P
-recursive sequences. Our implementations are available at http://www.mathematik.uni-kassel.de/~bteguia/FPS_webpage/FPS.htm
Publisher
Association for Computing Machinery (ACM)
Subject
Microbiology (medical),Immunology,Immunology and Allergy
Reference15 articles.
1. Computing Hypergeometric Solutions of Linear Recurrence Equations
2. Symbolic Computation of Padé Approximants
3. m-Fold Hypergeometric Solutions of Linear Recurrence Equations Revisited
4. Manuel Kauers and Christoph Koutschan . 2022. Guessing with Little Data. arXiv preprint arXiv:2202.07966 ( 2022 ). Manuel Kauers and Christoph Koutschan. 2022. Guessing with Little Data. arXiv preprint arXiv:2202.07966 (2022).
5. Why you should remove zeros from data before guessing
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hypergeometric-type sequences;Journal of Symbolic Computation;2024-11