English
Related papers

Related papers: A Bombieri-Vinogradov-type theorem with prime powe…

200 papers

G. Ricotta and E. Royer (2018) have recently proved that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums $S(a,b;p^n)/p^(n/2) converge in law in the Banach space of complex-valued continuous function…

Number Theory · Mathematics 2019-05-08 Guillaume Ricotta , Emmanuel Royer , Igor Shparlinski

Recently, Bruinier and Ono classified cusp forms $f(z) := \sum_{n=0}^{\infty} a_f(n)q ^n \in S_{\lambda+1/2}(\Gamma_0(N),\chi)\cap \mathbb{Z}[[q]]$ that does not satisfy a certain distribution property for modulo odd primes $p$. In this…

Number Theory · Mathematics 2007-05-23 Dohoon Choi

The author studies an average version of Brun-Titchmarsh theorem with large moduli. Using Maynard's recent breakthrough on the Bombieri-Friedlander-Iwaniec type triple convolution estimates, we refine the previous result of Baker and Harman…

Number Theory · Mathematics 2025-10-08 Runbo Li

Let $\alpha > 0$ be any fixed non-integer, $I$ be any subinterval of $[0; 1)$. In the paper, we prove an analogue of Bombieri-Vinogradov theorem for the set of primes $p$ satisfying the condition $\{ p^{\alpha} \} \in I$. This strengthens…

Number Theory · Mathematics 2020-10-30 Andrei Shubin

Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…

Software Engineering · Computer Science 2009-01-29 Peter Horan , John Carminati

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern…

Number Theory · Mathematics 2020-11-24 Alexei Kourbatov , Marek Wolf

Emmanuel Kowalski and William Sawin proved, using a deep independence result of Kloosterman sheaves, that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums S(a,b0;p)/p^{1/2} converge in the sense of…

Number Theory · Mathematics 2017-09-20 Guillaume Ricotta , Emmanuel Royer

Let S=K[x_1,..., x_n], let A,B be finitely generated graded S-modules, and let m=(x_1,...,x_n). We give bounds for the Castelnuovo-Mumford regularity of the local cohomology of Tor_i(A,B) under the assumption that the Krull dimension of…

Commutative Algebra · Mathematics 2007-05-23 David Eisenbud , Craig Huneke , Bernd Ulrich

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

Commutative Algebra · Mathematics 2025-07-23 Tristram Bogart , Santiago Morales

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

Number Theory · Mathematics 2025-07-01 Alexandru Pascadi

Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_{q}$. For arithmetic functions $\psi_{1}, \psi_{2}: \mathbb{F}_{q}[t]\rightarrow\mathbb{C}$, we establish that if a Bombieri-Vinogradov type equidistribution…

Number Theory · Mathematics 2023-01-31 Sampa Dey , Aditi Savalia

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

Number Theory · Mathematics 2024-02-15 Jared Duker Lichtman

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Number Theory · Mathematics 2018-04-04 Emmanuel Lecouturier

In this paper, we establish a new mean value theorem of Bombieri-Vinogradov type over Piatetski-Shapiro sequence. Namely, it is proved that for any given constant $A>0$ and any sufficiently small $\varepsilon>0$, there holds…

Number Theory · Mathematics 2023-05-08 Jinjiang Li , Fei Xue , Min Zhang

Given a prime $p$, let $P(t)$ be a non-constant monic polynomial in $t$ over the ring $\mathbb{Z}_{p}$ of $p$-adic integers. Let $X_{n}$ be an $n \times n$ random matrix over $\mathbb{Z}_{p}$ with independent entries that lie in any residue…

Number Theory · Mathematics 2023-10-24 Gilyoung Cheong , Myungjun Yu

(Dieudonn\'e and) Dwork's lemma gives a necessary and sufficient condition for an exponential of a formal power series $S(z)$ with coefficients in $Q_p$ to have coefficients in $Z_p$. We establish theorems on the $p$-adic valuation of the…

Group Theory · Mathematics 2015-08-12 Christian Krattenthaler , Thomas W. Müller

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…

Number Theory · Mathematics 2024-02-05 Muhammet Boran , John Byun , Zhangze Li , Steven J. Miller , Stephanie Reyes

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