Kenison, G. J., Klurman, O., Lefaucheux, E., Luca, F., Moree, P., Ouaknine, J., Whiteland, M., & Worrell, J. (2021). On Positivity and Minimality for Second-Order Holonomic Sequences. In F. Bonchi & S. Puglisi (Eds.), 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (pp. 1–15). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.67
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Number of Pages:
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany
holonomic sequences; minimal solutions; positivity problem
An infinite sequence unn 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 un ≥ 0, and minimal if, given any other linearly independent sequence vnn satisfying the same recurrence relation, the ratio un/vn → 0 as n → ∞. In this paper we give a Turing reduction of the problem of deciding positivity of second-order holonomic sequences to that of deciding minimality of such sequences. More specifically, we give a procedure for determining positivity of second-order holonomic sequences that terminates in all but an exceptional number of cases, and we show that in these exceptional cases positivity can be determined using an oracle for deciding minimality.
Distribution Recovery for Invariant Generation of ProbabilisticPrograms: ICT19-018 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds) Automated Reasoning with Theories and Induction for Software Technologies: ERC Consolidator Grant 2020 (European Commission)