Related papers: Fast arithmetic in unramified p-adic fields

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

In this paper we are concerned with $L^p$-maximal parabolic regularity for abstract nonautonomous parabolic systems and their quasilinear counterpart in negative Sobolev spaces incorporating mixed boundary conditions. Our results are…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

Nonlinear acceleration algorithms improve the performance of iterative methods, such as gradient descent, using the information contained in past iterates. However, their efficiency is still not entirely understood even in the quadratic…

We construct explicit Drinfel'd twists of Jordanian type for the generalized Cartan type K Lie algebras in characteristic 0 and obtain the corresponding quantizations, especially their integral forms. By making modular reductions including…

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…

Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…

Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely…

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

We present a fast, adaptive multiresolution algorithm for applying integral operators with a wide class of radially symmetric kernels in dimensions one, two and three. This algorithm is made efficient by the use of separated representations…

We study the relationship between recent conjectures on slopes of overconvergent p-adic modular forms "near the boundary" of p-adic weight space. We also prove in tame level 1 that the coefficients of the Fredholm series of the U_p operator…

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

The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…