相关论文: Fast evaluation of some p-adic transcendental func…

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 describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…

We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…

Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…

We present a new fast algorithm for computing the Boys function using a nonlinear approximation of the integrand via exponentials. The resulting algorithms evaluate the Boys function with real and complex valued arguments and are…

A field with an absolute value function is a basic type of metric space, which includes the real and complex numbers with their standard metrics, and ultrametrics on fields like the p-adic numbers. Here we try to give some perspectives of…

The article provides an introduction to infinite-dimensional differential calculus over topological fields and surveys some of its applications, notably in the areas of infinite-dimensional Lie groups and dynamical systems.

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…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…

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…

Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.

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

In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…

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…

We give a new class of multidimensional $p$-adic continued fraction algorithms. We propose an algorithm in the class for which we can expect that multidimensional $p$-adic version of Lagrange's Theorem holds.

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…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

We propose a novel method for reconstructing Laurent expansion of rational functions using $p$-adic numbers. By evaluating the rational functions in $p$-adic fields rather than finite fields, it is possible to probe the expansion…