On the integrality of some P-recursive sequences
By: Anastasia Matveeva
Potential Business Impact:
Finds patterns in number sequences.
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences due to Klazar and Luca, and propose a unified method for analysing global boundedness and algebraicity within a broader class of holonomic sequences. The central contribution is an algorithm that determines whether all, none, or a one-dimensional family of solutions to certain second-order recurrences are globally bounded. This approach generalizes earlier ad hoc methods and applies successfully to several well-known sequences from the On-Line Encyclopedia of Integer Sequences (OEIS).
Similar Papers
On the $p$-adic Skolem Problem
Logic in Computer Science
Finds patterns in number sequences to solve math puzzles.
The Fractal Logic of Phi-adic Recursion
Logic
Makes computers prove math ideas faster.
The Ultimate Signs of Second-Order Holonomic Sequences
Discrete Mathematics
Finds repeating patterns in number sequences.