Algebraicity modulo p of generalized hypergeometric series $_nF_{n-1}$
Daniel Vargas Montoya

TL;DR
This paper proves that generalized hypergeometric series modulo a prime p are algebraic with explicitly bounded degree and height, providing a constructive method to find the algebraic polynomial over finite fields.
Contribution
It establishes explicit bounds on the degree and height of algebraic polynomials satisfied by hypergeometric series modulo p, and offers a constructive approach for obtaining these polynomials.
Findings
For primes p > 2d_{α,β}, hypergeometric series modulo p satisfy a polynomial equation.
Explicit bounds on the degree and height of the polynomial are provided.
The method allows for explicit construction of the polynomial P_p(Y).
Abstract
Let be the hypergeometric series with parameters and in , let be the least common multiple of the denominators of , written in lowest form and let be a prime number such that does not divide and . Recently in \cite{vmsff}, it was shown that if for all , then the reduction of modulo is algebraic over . A standard way to measure the complexity of an algebraic power series is to estimate its degree and its height. In this work, we prove that if…
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 Mathematical Identities · Mathematical functions and polynomials
