Algebraicity modulo p of generalized hypergeometric series nFn-1

Abstract

Let f(z)=nFn-1(α,β) be the hypergeometric series with parameters α = (α1,…,αn) and β = (β1,…,βn-1,1) in (Q(0,1])n, let dα,β be the least common multiple of the denominators of α1,…,αn, β1,…,βn-1 written in lowest form and let p be a prime number such that p does not divide dα,β and f(z)∈Z(p)[[z]]. Recently in vmsff, it was shown that if for all i,j∈\1,…,n\, αi-βj then the reduction of f(z) modulo p is algebraic over Fp(z). 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 p>2dα,β then there is a nonzero polynomial Pp(Y)∈Fp(z)[Y] having degree at most p2n(dα,β) and height at most 5n(n+1)!p2n(dα,β) such that Pp(f(z) p)=0, where is the Euler's totient function. Furthermore, our method of proof provides us a way to make an explicit construction of the polynomial Pp(Y). We illustrate this construction by applying it to some explicit hypergeometric series.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…