English
Related papers

Related papers: Discorrelation between primes in short intervals a…

200 papers

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers

We generalise Zhang's and Pintz recent results on bounded prime gaps to give a lower bound for the the number of prime pairs bounded by 6*10^7 in the short interval $[x,x+x (\log x)^{-A}]$. Our result follows only by analysing Zhang's proof…

Number Theory · Mathematics 2013-06-07 Johan Andersson

We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…

Number Theory · Mathematics 2015-08-05 É. Fouvry , E. Kowalski , Ph. Michel

We continue to study the distribution of prime numbers $p$, satisfying the condition $\{ p^{\alpha} \} \in I \subset [0; 1)$, in arithmetic progressions. In the paper, we prove an analogue of Bombieri-Vinogradov theorem for $0 < \alpha <…

Number Theory · Mathematics 2021-07-13 Andrei Shubin

In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$…

Combinatorics · Mathematics 2025-07-02 Lior Gishboliner , Stefan Glock , Amedeo Sgueglia

We study piecewise polynomial functions $\gamma_k(c)$ that appear in the asymptotics of averages of the divisor sum in short intervals. Specifically, we express these polynomials as the inverse Fourier transform of a Hankel determinant that…

Number Theory · Mathematics 2019-12-10 Estelle Basor , Fan Ge , Michael O. Rubinstein

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

Number Theory · Mathematics 2026-04-13 E. Malavika , Olivier Ramaré

Let as usual $Z(t) = \zeta(1/2+it)\chi^{-1/2}(1/2+it)$ denote Hardy's function, where $\zeta(s) = \chi(s)\zeta(1-s)$. Assuming the Riemann hypothesis upper and lower bounds for some integrals involving $Z(t)$ and $Z'(t)$ are proved. It is…

Number Theory · Mathematics 2016-12-07 Aleksandar Ivić

We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…

Number Theory · Mathematics 2019-10-30 James Maynard

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

Number Theory · Mathematics 2012-10-25 Jean Bourgain , Moubariz Z. Garaev , Sergei V. Konyagin , Igor E. Shparlinski

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every \alpha > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + \alpha)n contains at least n/8…

Combinatorics · Mathematics 2015-03-13 Demetres Christofides , Daniela Kühn , Deryk Osthus

Let $R(n) = \sum_{a+b=n} \Lambda(a)\Lambda(b)$, where $\Lambda(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq…

Number Theory · Mathematics 2020-06-29 Michael J. Mossinghoff , Timothy S. Trudgian

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

We prove mod-Gaussian convergence for a Dirichlet polynomial which approximates $\operatorname{Im}\log\zeta(1/2+it)$. This Dirichlet polynomial is sufficiently long to deduce Selberg's central limit theorem with an explicit error term.…

Number Theory · Mathematics 2013-12-03 Martin Wahl

Sums of the form $\sum_{n\le x}E^k(n) (k\in{\bf N}$ fixed) are investigated, where $$ E(T) = \int_0^T|\zeta(1/2+it)|^2 dt - T\Bigl(\log {T\over2\pi} + 2\gamma -1\Bigr)$$ is the error term in the mean square formula for $|\zeta(1/2+it)|$.…

Number Theory · Mathematics 2008-11-06 Yann Bugeaud , Aleksandar Ivić

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Number Theory · Mathematics 2021-11-15 Alexander P. Mangerel

We study higher uniformity properties of the von Mangoldt function $\Lambda$, the M\"obius function $\mu$, and the divisor functions $d_k$ on short intervals $(x,x+H]$ for almost all $x \in [X, 2X]$. Let $\Lambda^\sharp$ and $d_k^\sharp$ be…

Number Theory · Mathematics 2026-01-26 Kaisa Matomäki , Maksym Radziwiłł , Xuancheng Shao , Terence Tao , Joni Teräväinen

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

Probability · Mathematics 2016-08-09 Ljuben Mutafchiev

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…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena
‹ Prev 1 8 9 10 Next ›