Related papers: Algorithms for Algebraic and Arithmetic Attributes…

We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…

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…

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…

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…

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$.…

We study the $p$-adic (generalized) hypergeometric equations by using the theory of multiplicative convolution of arithmetic $\mathscr{D}$-modules. As a result, we prove that the hypergeometric isocrystals with suitable rational parameters…

We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…

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…

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 prove two transformations for the $p$-adic hypergeometric functions which can be described as $p$-adic analogues of a Euler's transformation and a transformation of Clausen. We first evaluate certain character sums, and then relate them…

The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this…

We prove hypergeometric type summation identities for a function defined in terms of quotients of the $p$-adic gamma function by counting points on certain families of hyperelliptic curves over $\mathbb{F}_{q}$. We also find certain special…

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…

We prove hypergeometric type identities for a function defined in terms of quotients of the $p$-adic gamma function. We use these identities to prove a supercongruence conjecture of Rodriguez-Villegas between a truncated $_4F_3$…

We describe an algorithm for computing, for all primes $p \leq X$, the mod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasilinear in $X$. This combines the Beukers--Cohen--Mellit trace formula…

We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient…

We generalize the known constructions of A-hypergeometric functions. In particular, we show that periods of middle dimension on affine or projective complex algebraic varieties are A-hypergeometric functions of coefficients of polynomial…

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…

In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…