2000 character limit reached
On Rational Recursion for Holonomic Sequences
Published 29 Apr 2024 in cs.SC, cs.FL, math.AC, and math.DS | (2404.19136v2)
Abstract: It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture holds in the special case of holonomic sequences, which can straightforwardly be represented by rational dynamical systems. We propose two algorithms for converting holonomic recurrence equations into such quasi-linear equations. The two algorithms differ in their efficiency and the minimality of orders in their outputs.
- Kolchin, E.R.: Differential Algebra & Algebraic Groups. Academic press (1973)
- Teguia Tabuguia, B.: Arithmetic of D-algebraic functions. arXiv preprint arXiv:2305.00702 (2023)
- Teguia Tabuguia, B.: Computing with hypergeometric-type terms. arXiv preprint arXiv:2404.10143 (2023)
- Whang, J.P.: On periodic orbits of polynomial maps. arXiv preprint arXiv:2305.13529 (2023)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.