On Positivity and Minimality for Second-Order Holonomic Sequences
George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca,, Pieter Moree, Jo\"el Ouaknine, Markus A. Whiteland, James Worrell

TL;DR
This paper investigates the decidability of positivity and minimality for second-order holonomic sequences with polynomial coefficients, linking these problems to the decidability of certain algebraic expressions called periods, with implications from algebraic geometry and number theory.
Contribution
It establishes that deciding positivity reduces to deciding minimality, and that minimality decision is equivalent to checking whether specific period-like expressions are zero.
Findings
Positivity decision reduces to minimality decision.
Minimality is equivalent to determining zero of period-like integrals.
Decidability of periods implies decidability of positivity and minimality.
Abstract
An infinite sequence of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be positive if each , and minimal if, given any other linearly independent sequence satisfying the same recurrence relation, the ratio converges to . In this paper, we focus on holonomic sequences satisfying a second-order recurrence , where each coefficient is a polynomial of degree at most . We establish two main results. First, we show that deciding positivity for such sequences reduces to deciding minimality. And second, we prove that deciding minimality is equivalent to determining whether certain numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
