English
Related papers

Related papers: A short-interval Hildebrand-Tenenbaum theorem

200 papers

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…

Number Theory · Mathematics 2011-11-01 Tristan Freiberg

We improve the universality theorem of the Riemann zeta-function in short intervals by establishing universality for significantly shorter intervals $[T,T+H]$. Assuming the Riemann Hypothesis, we prove that universality in such short…

Number Theory · Mathematics 2025-02-24 Yoonbok Lee , Łukasz Pańkowski

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Number Theory · Mathematics 2022-11-23 Kevin Smith , Julio Andrade

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

Number Theory · Mathematics 2025-10-17 Runbo Li

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.

Number Theory · Mathematics 2016-11-04 A. A. Sedunova

Let $E_k$ be the set of positive integers having exactly $k$ prime factors. We show that almost all intervals $[x,x+\log^{1+\varepsilon} x]$ contain $E_3$ numbers, and almost all intervals $[x,x+\log^{3.51} x]$ contain $E_2$ numbers. By…

Number Theory · Mathematics 2016-08-03 Joni Teräväinen

Given a positive integer $n$ the $k$-fold divisor function $d_k(n)$ equals the number of ordered $k$-tuples of positive integers whose product equals $n$. In this article we study the variance of sums of $d_k(n)$ in short intervals and…

Number Theory · Mathematics 2015-02-05 Stephen Lester

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Number Theory · Mathematics 2025-09-19 Pierre-Alexandre Bazin

Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…

Number Theory · Mathematics 2023-09-11 Victor Manuel R. Aricheta , Judy Ann L. Donato

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

Number Theory · Mathematics 2025-10-30 Ethan Simpson Lee

It is well known that if the power spectral density of a continuous time stationary stochastic process does not have a compact support, data sampled from that process at any uniform sampling rate leads to biased and inconsistent spectrum…

Statistics Theory · Mathematics 2010-06-09 Radhendushka Srivastava , Debasis Sengupta

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

Number Theory · Mathematics 2021-11-01 Christian Axler

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Number Theory · Mathematics 2025-02-25 Julia Stadlmann

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Number Theory · Mathematics 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

Number Theory · Mathematics 2019-09-16 Alessandro Languasco , Alessandro Zaccagnini

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

Number Theory · Mathematics 2012-05-22 James Maynard

This note provides an effective bound in the Gauss-Kuzmin-L\'evy problem for some Gauss type shifts associated with nearest integer continued fractions, acting on the interval $I_0=[0,\frac{1}{2}]$ or $I_0=[-\frac{1}{2},\frac{1}{2}]$. We…

Number Theory · Mathematics 2024-04-03 Florin P. Boca , Maria Siskaki

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

Number Theory · Mathematics 2017-02-15 L. Grenié , G. Molteni , A. Perelli

Let $I, J\subset \mathbb{R}$ be closed intervals, and let $H$ be $C^{3}$ smooth real valued function on $I\times J$ with nonvanishing $H_{x}$ and $H_{y}$. Take any fixed positive numbers $a,b$, and let $d\mu$ be a probability measure with…

Analysis of PDEs · Mathematics 2017-06-22 Paata Ivanisvili
‹ Prev 1 3 4 5 6 7 10 Next ›