English
Related papers

Related papers: Using the smoothness of p-1 for computing roots mo…

200 papers

We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial…

Data Structures and Algorithms · Computer Science 2025-10-14 Ziv Oznovich , Ben Lee Volk

Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…

Number Theory · Mathematics 2009-07-01 Hendrik Hubrechts

We prove the integrality of the open instanton numbers in two examples of counting holomorphic disks on local Calabi-Yau threefolds: the resolved conifold and the degenerate $ \P \times \P $. Given the B-model superpotential, we extract by…

High Energy Physics - Theory · Physics 2015-06-26 Daniel Grunberg

We present an unconditional CRT algorithm to compute the modular polynomial $\Phi_\ell(X,Y)$ in quasi-linear time. The main ingredients of our algorithm are: the embedding of $\ell$-isogenies in smooth-degree isogenies in higher dimension,…

Number Theory · Mathematics 2024-08-14 Sabrina Kunzweiler , Damien Robert

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

Number Theory · Mathematics 2018-12-18 Mohammad Javaheri

Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…

Commutative Algebra · Mathematics 2018-05-18 Alberto F. Boix , Alessandro De Stefani , Davide Vanzo

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

Data Structures and Algorithms · Computer Science 2026-03-13 Guangwu Xu , Yunxiao Tian , Bingxin Yang

A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…

Mathematical Physics · Physics 2019-10-23 Oksana Bihun

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…

Number Theory · Mathematics 2021-04-08 Jiyou Li , Xiang Yu

We give improvements of the deformation method for computing the zeta function of a generic projective hypersurface in characteristic~$p$ that either reduce the dependence on~$p$ of the time complexity to $\tilde{O}(p^{1/2})$ or that of the…

Number Theory · Mathematics 2017-09-14 Jan Tuitman

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

Symbolic Computation · Computer Science 2009-01-27 Alin Bostan , Éric Schost

In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…

Number Theory · Mathematics 2022-10-17 Jorge Jimenez Urroz , Jacek Pomykala

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. We say a subset of…

Dynamical Systems · Mathematics 2017-07-27 Andrew Bridy , Derek Garton

We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…

Number Theory · Mathematics 2017-08-15 Cameron Franc , Terry Gannon , Geoffrey Mason

For finitely generated subgroups $W_1, \ldots , W_t$ of $\mathbb{Q}^{\times}$, integers $k_1, \ldots , k_t$, a Galois extension $F$ of $\mathbb{Q}$ and a union of conjugacy classes $C \subset \text{Gal}(F/\mathbb{Q})$, we develop methods…

Number Theory · Mathematics 2020-06-15 Olli Järviniemi

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Number Theory · Mathematics 2007-07-25 Zhi-Wei Sun , Donald M. Davis

Let $G$ be a semisimple algebraic group over a field of characteristic $p > 0$. We prove that the dual Weyl modules for $G$ all have $p$-filtrations when $p$ is not too small. Moreover, we give applications of this theorem to…

Representation Theory · Mathematics 2019-05-21 Henning Haahr Andersen

The main objective of this article is to establish the $p$-adic Artin formalism for the algebraic $p$-adic $L$-functions attached to the adjoint representations of Coleman families of modular forms. In particular, we prove a factorization…

Number Theory · Mathematics 2023-11-10 Fırtına Küçük

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

The $L$-function of exponential sums associated to the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is studied. A polygon called the Frobenius polygon of the generic polynomial of degree $d$ in…

Number Theory · Mathematics 2020-09-03 Chunlei Liu , Chuanze Niu