Related papers: An algorithm of computing special values of Dwork'…

We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…

In this paper, we give a transformation formula of Dwork's $p$-adic hypergeometric function between $t$ and $t^{-1}$. As an appendix, we introduce a finite analogue of this transformation formula, which implies the special case of the above…

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

Let $p$ be prime, $N$ be a positive integer prime to $p$, and $k$ be an integer. Let $P_k(t)$ be the characteristic series for Atkin's $U$ operator as an endomorphism of $p$-adic overconvergent modular forms of tame level $N$ and weight…

For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$.…

This paper introduces a $p$-adic analogue of Gauss's hypergeometric function, constructed via a method that is distinct from distinct from Dwork's approach. The idea of our construction is motivated by the Ohno-Zagier formula, which is…

We introduce a new type of $p$-adic hypergeometric functions, which are generalizations of $p$-adic hypergeometric functions of logarithmic type defined by Asakura, and show that these functions satisfy the congruence relations similar to…

(Dieudonn\'e and) Dwork's lemma gives a necessary and sufficient condition for an exponential of a formal power series $S(z)$ with coefficients in $Q_p$ to have coefficients in $Z_p$. We establish theorems on the $p$-adic valuation of the…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

We provide a formula for the number of $\mathbb{F}_{p}$-points on the Dwork hypersurface $$x_1^n + x_2^n \dots + x_n^n - n \lambda \, x_1 x_2 \dots x_n=0$$ in terms of a $p$-adic hypergeometric function previously defined by the author.…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Let $f(z)={}_nF_{n-1}(\mathbf{\alpha},\mathbf{\beta})$ be the hypergeometric series with parameters $\mathbf{\alpha} = (\alpha_1,\ldots,\alpha_n)$ and $\mathbf{\beta} = (\beta_1,\ldots,\beta_{n-1},1)$ in $(\mathbb{Q}\cap(0,1])^n$, let…

We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We present a nonincremental algorithm and an incremental algorithm,…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

In this document will be proved a formula to compute the $p$-adic valuation of a hyperfactorial. We call a hyperfactorial the result of multiplying a given number of consecutive integers from 1 to the given number,each raised to its own…

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

In this article we give an example of a matrix version of the famous congruence for hypergeometric functions found by Dwork in 'p-adic cycles'.

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…