The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters
George Kenison

TL;DR
This paper investigates the decidability of the Threshold Problem for hypergeometric sequences with quadratic polynomial parameters, establishing new results under algebraic and conjectural assumptions, and extending previous work on related membership problems.
Contribution
It provides decidability results for the Threshold Problem for hypergeometric sequences with quadratic polynomial coefficients, including conditional results based on Schanuel's conjecture, and extends prior findings on membership problems.
Findings
Decidability established for sequences with roots in quadratic extensions
Conditional decidability results assuming Schanuel's conjecture
Extension of previous results on membership problems for hypergeometric sequences
Abstract
Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, is hypergeometric if it satisfies a first-order linear recurrence of the form with polynomial coefficients and . In this paper, we consider the Threshold Problem for hypergeometric sequences: given a hypergeometric sequence and a threshold , determine whether for each . We establish decidability for the Threshold Problem under the assumption that the coefficients and are monic polynomials whose roots lie in an imaginary quadratic extension of . We also establish conditional decidability results; for example, under the assumption that the…
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.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Coding theory and cryptography
