In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable as sums of two squares.
We show estimates for the distribution of $k$-free numbers in short intervals and arithmetic progressions. We argue that, at least in certain ranges, these estimates agree with a conjecture by H. L. Montgomery.
A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as large as possible. We study this problem in the function field setting, and prove for a wide class of arithmetic functions (namely factorization functions), that such an asymptotic result holds, allowing the size of the short interval to be as small as a square-root of the size of the full interval, and analogously for arithmetic progressions. For instance, …
Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $ε>0$, there exists $α>0$ (computable), such that for all $x\ge α(\log q)^2$, the interval $\left[ e^x,e^{x+ε}\right]$ contains a prime $p$ in the arithmetic progression $a \bmod q$. This gives the bound for the least prime in this arithmetic progression: $P(a,q) \le e^{α(\log q)^2}$. For instance for all $q\ge 10^{30}$, $P(a,q) \le e^{4.401(\log q)^2}$. Finally, we apply this result to establish that every integer larger than $e^{71\,000}$ is a sum of seven cubes.
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first is a recursion formula for the $n$-diameter of an interval, which uses properties of Jacobi polynomials. The second is a numerical criterion which allows one to the give a bound on the degree of any algebraic integer having all of its complex embeddings in a real interval of length less than $4$.
Keating and Rudnick studied the variance of the polynomial von Mangoldt function $Λ\colon \mathbb{F}_q[t] \rightarrow \mathbb{C}$ in arithmetic progressions and short intervals using two equidistribution results by Katz. Hall, Keating and Roditty-Gershon then generalised the result for arithmetic progressions for a von Mangoldt function $Λ_ρ$ attached to a Galois representation $ρ\colon \mathrm{Gal} ( \overline{\mathbb{F}_q(t)}/\mathbb{F}_q(t) ) \rightarrow \mathrm{GL}_m(\overline{\mathbb{Q}}_\ell)$. We employ a recent equidistribution result by Sawin in order to generalise the corresponding r…
A variant of the Bombieri-Vinogradov theorem in short intervals with applications
我们将经典的Bennieri-Vinogradov定理推广到一个短的区间,非阿贝尔设置。这导致了素数定理的变体,其中素数位于等差数列中,这些算术级数被数域的伽罗瓦扩展$L/K$中的分裂条件“扭曲”。利用这一结果结合最近的工作梅纳德,我们证明了合理的素数在短时间内与一个给定的分裂条件的伽罗瓦扩展$L/\mathbb{Q}$表现出密集的集群在短时间内的间隔。我们探讨了几个算术应用相关的问题塞尔关于非零傅里叶系数的尖点模形式化的形式,包括寻找密集集群的基本判别式$ d $在短时间内的中心值的$d$ -二次扭曲的模块化$L$ -功能是非零的。
Given a family $\mathcal{F}=\{A_1,\dots,A_s\}$ of subsets of $\mathbb{Z}_n$, define $Δ\mathcal{F}$ to be the multiset of all (cyclic) distances dist$(x,y)$, where $\{x,y\} \subset A_i$, $x \neq y$, for some $i=1,\dots,s$. Taking inspiration from a Euclidean distance problem of Erdős, we say that $\mathcal{F}$ is Erdős-deep if the multiplicities of distances that occur in $Δ\mathcal{F}$ are precisely $1,2,\dots,k-1$ for some integer $k$. In the case $s=1$, it is known that a modular arithmetic progression in $\mathbb{Z}_n$ achieves this property (under mild conditions); conversely, APs are the …
We show that as soon as $h\to \infty$ with $X \to \infty$, almost all intervals $(x-h\log X, x]$ with $x \in (X/2, X]$ contain a product of at most two primes. In the proof we use Richert's weighted sieve, with the arithmetic information eventually coming from results of Deshouillers and Iwaniec on averages of Kloosterman sums.
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish explicit formulae for $ψ(x,χ)$, $θ(x,χ)$, and an explicit version of the prime number theorem for primes in arithmetic progressions that hold for general moduli $q\geq 3$. Finally, we restrict our attention to $q\leq 10\,000$ and use an exact computation to refine these results.