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

We examine hypergeometric functions in the finite field, p-adic and classical settings. In each setting, we prove a formula which splits the hypergeometric function into a sum of lower order functions whose arguments differ by roots of…

An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…

Let p be an odd prime. In 1984, Greene introduced the notion of hypergeometric functions over finite fields. Special values of these functions have been of interest as they are related to the number of F_p points on algebraic varieties and…

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…

This work is devoted to study of algebraicty modulo p of Siegel's G-functions. Our goal is to emphasize the relevance of the notion of strong Frobenius structure, clasically studied in the theory of the p-adic diffenrential equations, for…

We describe the action of the Dwork-Frobenius operator on certain $A$-hypergeometric series. As a consequence, we obtain an integrality result for the coefficients of those series. This implies an integrality result for classical…

We express the number of points on the Dwork hypersurface $$X_{\lambda}^d: x_1^d+x_2^d+\cdots +x_d^d=d\lambda x_1x_2\cdots x_d$$ over a finite field of order $q \not \equiv 1 \pmod{d}$ in terms of McCarthy's $p$-adic hypergeometric function…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…

Let $p$ be an odd prime and $\mathbb{F}_p$ be the finite field with $p$ elements. McCarthy \cite{mccarthy-pacific} initiated a study of hypergeometric functions in the $p$-adic setting. This function can be understood as $p$-adic analogue…

We use the Dwork-Frobenius operator to prove an integrality result for $A$-hypergeometric series whose coefficients are factorial ratios. As a special case, we generalize one direction of a classical result of Landau on the integrality of…

Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…

We discuss exponential sums on affine space from the point of view of Dwork's p-adic cohomology theory

We describe an algorithm to compute the local component at p of the Coleman-Gross p-adic height pairing on divisors on hyperelliptic curves. As the height pairing is given in terms of a Coleman integral, we also provide new techniques to…

We present a deterministic algorithm that, given a prime $p$ and a solution $x \in \mathbb Z$ to the discrete logarithm problem $a^x \equiv b \pmod p$ with $p\nmid a$, efficiently lifts it to a solution modulo $p^k$, i.e., $a^x \equiv b…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…

Considering the L-function of exponential sums associated to a polynomial over a finite field F_q, Deligne proved that a reciprocal root's p-adic order is a rational number in the interval [0, 1]. Based on hypergeometric theory, in this…