Related papers: Hypergeometric $L$-functions in average polynomial…

Let $A$ be an abelian variety defined over $\mathbb{Q}$ and of dimension $g$. Assume that, for each sufficiently large prime $\ell$, $A$ has a surjective residual modulo $\ell$ Galois representation. For $t\in \mathbb{Z}$ and $x>0$, denote…

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 a prime number. Continuing and extending our previous paper with the same title, we prove explicit rates of overconvergence for modular functions of the form $\frac{E_k^{\ast}}{V(E_k^{\ast})}$ where $E_k^{\ast}$ is a classical,…

For an elliptic curve $E$ over $\ratq$ and an integer $r$ let $\pi_E^r(x)$ be the number of primes $p\le x$ of good reduction such that the trace of the Frobenius morphism of $E/\fie_p$ equals $r$. We consider the quantity $\pi_E^r(x)$ on…

For primes p congruent to 1 mod 12, we present an explicit relation between the traces of Frobenius on a family of elliptic curves with j-invariant 1728/t and values of a particular 2F1-hypergeometric function over F_p. Additionally, we…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…

We prove a general formula for the $p$-adic heights of Heegner points on modular abelian varieties with potentially ordinary (good or semistable) reduction at the primes above $p$. The formula is in terms of the cyclotomic derivative of a…

The aim of this paper is to investigate the algebraicity behavior of reductions of $D$-finite power series modulo prime numbers. For many classes of D-finite functions, such as diagonals of multivariate algebraic series or hypergeometric…

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…

Let $p$ be an odd prime and $\mathbb{F}_p$ be the finite field with $p$ elements. This paper focuses on the study of values of a generic family of hypergeometric functions in the $p$-adic setting which we denote by ${_{3n-1}G_{3n-1}}(p,…

For the purposes of this paper supercongruences are congruences between terminating hypergeometric series and quotients of $p$-adic Gamma functions that are stronger than those one can expect to prove using commutative formal group laws. We…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

For $p$ prime, let $\mathcal{H}^n$ be the linear span of characteristic functions of hyperplanes in $(\mathbb{Z}/p^k\mathbb{Z})^n$. We establish new upper bounds on the dimension of $\mathcal{H}^n$ over $\mathbb{Z}/p\mathbb{Z}$, or…

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 consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

In this paper, we introduce degenertae generalized hypergeometric functions and study degenerate hypergeometric numbers of order p. These numbers involving of lambda-binomial coefficients and lambda-falling sequence, and can be represented…

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

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…

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…