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

We compute the operator $p$-norm of some $n\times n$ complex matrices, which can be seen as bounded linear operators on the $n$ dimensional Banach space $\ell^p(n)$. The notion of logarithmic affine matrices is defined, and for such a…

We prove that the arithmetic $\mathscr{D}$-modules associated with the $p$-adic generalized hypergeometric differential operators, under a $p$-adic non-Liouvilleness condition on parameters, are described as an iterative multiplicative…

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

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 introduce new p-adic convergent functions, which we call the p-adic hypergeometric functions of logarithmic type. The first main result is to prove the congruence relations that are similar to Dwork's. The second main result is that the…

We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…

In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…

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…

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,…

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

For an odd prime $p$ and a positive integer $n$, let ${_n}G_n[\cdots]_p$ denote McCarthy's $p$-adic hypergeometric function. In this article, we prove $p$-adic analogue of certain classical hypergeometric identities and using these…

The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…

Hypergeometric functions provide a useful representation of Feynman diagrams occuring in precision phenomenology. In dimension regularization, the epsilon-expansion of these functions about d=4 is required. We discuss the current status of…

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

We introduce and develop $(\pi,p)$-adic Dwork theory for $L$-functions of exponential sums associated to one-variable rational functions, interpolating $p^k$-order exponential sums over affinoids. Namely, we prove a generalization of the…

Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$,…

We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…

We state and analyze a generalization of the "truncation trick" suggested by Gourdon and Sebah to improve the performance of power series evaluation by binary splitting. It follows from our analysis that the values of D-finite functions…

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…

We present an elementary elaboration of Dwork's idea of explicit $p$-adic limit formulas for zeta functions of toric hypersurfaces.