# On Positivity and Minimality for Second-Order Holonomic Sequences

@inproceedings{Kenison2021OnPA, title={On Positivity and Minimality for Second-Order Holonomic Sequences}, author={George Kenison and Oleksiy Klurman and Engel Lefaucheux and Florian Luca and Pieter Moree and Jo{\"e}l Ouaknine and Markus A. Whiteland and James Worrell}, booktitle={MFCS}, year={2021} }

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ 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 $u_n \geq 0$, and minimal if, given any other linearly independent sequence $\langle{v_n}\rangle_{n \in\mathbb{N}}$ satisfying the same recurrence relation, the ratio $u_n/v_n$ converges to $0$. In this paper, we focus on holonomic sequences…

## 3 Citations

### Decision Problems for Second-Order Holonomic Recurrences

- MathematicsICALP
- 2021

It is shown that existence of infinitely many zeroes is decidable, and partial algorithms for deciding the existence of a zero, positivity of all sequence terms, and positive of all but finitely many sequence terms are given.

### Dold sequences, periodic points, and dynamics

- MathematicsBulletin of the London Mathematical Society
- 2021

In this survey we describe how the so‐called Dold congruence arises in topology, and how it relates to periodic point counting in dynamical systems.

### The Membership Problem for Hypergeometric Sequences with Rational Parameters

- MathematicsISSAC
- 2022

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence ❬un❭∞n=0 of rational numbers and a target t∈Q, decide whether t occurs in the sequence. We show…

## References

SHOWING 1-10 OF 65 REFERENCES

### Decision Problems for Second-Order Holonomic Recurrences

- MathematicsICALP
- 2021

It is shown that existence of infinitely many zeroes is decidable, and partial algorithms for deciding the existence of a zero, positivity of all sequence terms, and positive of all but finitely many sequence terms are given.

### Positivity of Three-Term Recurrence Sequences

- MathematicsElectron. J. Comb.
- 2010

The sufficient conditions for the positivity of recurrence sequences defined by a_nu_{n}=b_nu{n-1}-c_nu_n-2 for n ≥2 are given.

### Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences

- MathematicsICALP
- 2014

It is shown that Ultimate Positivity for simple LRS is hard for co$\exists\mathbb{R}$, i.e., the class of problems solvable in the universal theory of the reals (which lies between coNP and PSPACE).

### Minimal Solutions of Three-Term Recurrence Relations and Orthogonal Polynomials*

- Mathematics
- 1981

We observe that the well-known recurrence relation pn+x(z) — (z — a")pn(z) — bnp"_l(z) for orthogonal polynomials admits a "minimal solution" if z is outside the spectrum of the mass distribution…

### Real numbers with polynomial continued fraction expansions

- Mathematics
- 2004

In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of…

### Transitory minimal solutions of hypergeometric recursions and pseudoconvergence of associated continued fractions

- MathematicsMath. Comput.
- 2007

The anomalous convergence of the associated continued fractions for a number of different recurrence relations (modified Bessel functions, confluent and Gauss hypergeometric functions) is analyzed and the implication of such transitory behaviour on the numerical stability of recursion is discussed.

### On linear recurrence sequences and loop termination

- MathematicsSIGL
- 2015

This article surveys recent progress on long-standing open problems concerning deciding the positivity and ultimate positivity of integer linear recurrence sequences and closely related questions concerning the termination of linear while loops.

### Positivity Problems for Low-Order Linear Recurrence Sequences

- MathematicsSODA
- 2014

It is shown by way of hardness that extending the decidability of either problem to LRS of order 6 would entail major breakthroughs in analytic number theory, more precisely in the field of Diophantine approximation of transcendental numbers.