arXiv · 1909.02700
An algorithm of computing special values of Dwork's p-adic hypergeometric functions in polynomial time
Abstract
Dwork's $p$-adic hypergeometric function is defined to be a ratio ${}_sF_{s-1}(t)/{}_sF_{s-1}(t^p)$ of hypergeometric power series. Dwork showed that it is a uniform limit of rational functions, and hence one can define special values on $|t|_p=1$. However to compute the value modulo $p^n$ in the naive method, the bit complexity increases by exponential when $n\to\infty$. In this paper we present a certain algorithm whose complexity increases at most $O(n^4(\log n)^3)$.
Explore related subjects
Keep this discovery
Masanori Asakura. 2019-09-06. An algorithm of computing special values of Dwork's p-adic hypergeometric functions in polynomial time. https://arxiv.org/abs/1909.02700
Cite the original work for its findings. Save a collection to share your selection of sources.