Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any non-constant polynomial. Our main result generalizes a recent theorem by Carmon and Entin on the distribution of squarefree polynomials to all $k \ge 2$. We also develop polynomial versions of the classical techniques used to study gaps between $k$-free integers in $\mathbb Z$. We apply these techniques to obtain analogues in $\mathbb F_q[x]$ of some classical theorems on the distribution of $k$-free integers. The latter results complement the main theorem in the case when the degrees of the polynomials are of moderate size.
We cosider the number of r-tuples of squarefree numbers in a short interval. We prove that it cannot be much bigger than the expected value and we also estabish an asymptotic formula if the interval is not very short.
This is a copy of my Bourbaki Seminar on the work of Matomaki and Radziwill showing that the Liouville function exhibits cancelation in almost all short intervals as soon as the length of the interval tends to infinity.
Using estimates on Hooley's $Δ$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also given.
In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.
Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any given length.
We give an alternative proof of a recent result by T.D. Browning and A. Haynes (arXiv:1204.6374v1) on multiplicative inverses in sequences of intervals and improve this result under additional conditions on the spacing of these intervals.
In this article, we prove an "equivalence" between two higher even moments of primes in short intervals under Riemann Hypothesis. We also provide numerical evidence in support of these asymptotic formulas.
We prove that a suitable explicit formula for the Cesaro-averaged number of representations of an integer as a sum of two primes holds in short intervals.
We investigate the solubility of the congruence xy=1 (mod p), where p is a prime and x,y are restricted to lie in suitable short intervals. Our work relies on a mean value theorem for incomplete Kloosterman sums.
A numerical study on the distributions of primes in short intervals of length $h$ over the natural numbers $N$ is presented. Based on Cramér's model in Number Theory, we obtain a heuristic expression applicable when $h \gg \log{N}$ but $h \ll N$, providing support to the Montgomery and Soundararajan conjecture on the variance of the prime distribution at this scale.
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.
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.
Given good knowledge on the even moments, we derive asymptotic formulas for $λ$-th moments of primes in short intervals and prove "equivalence" result on odd moments. We also provide numerical evidence in support of these results.
Let $H = N^θ, θ> 2/3$ and $k \geq 1$. We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} Λ(n) e(g(n)), \] where $g$ is a polynomial of degree $k$. As a consequence of this in the special case $g(n) = αn^k$, we deduce a short interval version of the Waring-Goldbach problem.
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 short arithmetic progressions.
In this paper we establish the function field analogue of Bateman-Horn conjecture in short interval in the limit of a large finite field. Hence we start with counting prime polynomials generated by primitive quadratic functions in short intervals. To this end we further work out on function field analogs of cancellation of Mobius sums and its correlations(Chowla type sums) and confirm that square root cancellation in Mobius sums is equivalent to square root cancellation in Chowla type sums.
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 establish asymptotic formulas for the variance of sums of $d_k(n)$ in short intervals of certain lengths for $k=3$ and for $k \ge 4$ under the assumption of the Lindelöf hypothesis.
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 of Theorem 1, but we also explain how a sharper variant of Zhang's Theorem 2 would imply the same result for shorter intervals.
We resolve a function field version of two conjectures concerning the variance of the number of primes in short intervals (Goldston and Montgomery) and in arithmetic progressions (Hooley). A crucial ingredient in our work are recent equidistribution results of N. Katz.
Goldston and Montgomery [3] proved that the Strong Pair Correlation Conjecture and two second moments of primes in short intervals are equivalent to each other under Riemann Hypothesis. In this paper, we get the second main terms for each of the above and show that they are almost equivalent to each other.
We generalize the classical Bombieri-Vinogradov theorem to a short interval, non-abelian setting. This leads to variants of the prime number theorem for short intervals where the primes lie in arithmetic progressions that are "twisted" by a splitting condition in a Galois extension $L/K$ of number fields. Using this result in conjunction with recent work of Maynard, we prove that rational primes in short intervals with a given splitting condition in a Galois extension $L/\mathbb{Q}$ exhibit dense clusters in short intervals. We explore several arithmetic applications related to questions of Se…
In this paper, we establish a Voronoi formula for the spinor zeta function of a Siegel cusp form of genus 2. We deduce from this formula quantitative results on the number of its positive (resp. negative) coefficients in some short intervals.
In this paper we extend the well-known investigations of Montgomery and Goldston & Montgomery, concerning the pair-correlation function and its relations with the distribution of primes in short intervals, to a more general version of the pair-correlation function.
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the unconditional case.
Let $Δ(x)$ and $E(x)$ be error terms of the sum of divisor function and the mean square of the Riemann zeta function, respectively. In this paper their fourth power moments for short intervals of Jutila's type are considered. We get an asymptotic formula for $U$ in some range.
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the unconditional case.
Sums of squares of $|ζ(1/2+it)|$ over short intervals are investigated. Known upper bounds for the fourth and twelfth moment of $|ζ(1/2+it)|$ are derived. A discussion concerning other possibilities for the estimation of higher power moments of $|ζ(1/2+it)|$ is given.
Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.
We prove the analog of Cramér'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 mainly on the inertia property of the counting functions of primes and prime ideals.
We use exponent pairs to establish the existence of many $x^a$-smooth numbers in short intervals $[x-x^b,x]$, when $a>1/2$. In particular, $b=1-a-a(1-a)^3$ is admissible. Assuming the exponent-pairs conjecture, one can take $b=(1-a)/2+ε$. As an application, we show that $[x-x^{0.4872},x]$ contains many practical numbers when $x$ is large.
Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones previously known.
Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_ν+s)\equiv (y_1+s)...(y_ν+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here, for almost all $p$ and all $s$ and also for a fixed $p$ and almost all $s$, we derive stronger bounds. We also use similar ideas to show that for almost all primes, one can always find an element of a large order in any rather short interval.
We present several new results involving $Δ(x+U)-Δ(x)$, where $U = o(x)$ and $$ Δ(x):=\sum_{n\le x}d(n)-x\log x-(2γ-1)x $$ is the error term in the classical Dirichlet divisor problem.
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…
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime values of $n$ linear functions, in the limit of a large finite field.
Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $ψ(x+h) - ψ(x)$ by Montgomery and Soundararajan [1].
We prove a lower bound on the supremum of the function $S_1(T)$ on short intervals, defined by the integration of the argument of the Riemann zeta-function. The same type of result on the supremum of $S(T)$ have already been obtained by Karatsuba and Korolev. Our result is based on the idea of the paper of Karatsuba and Korolev. Also, we show an improved Omega-result for a lower bound.
Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.
We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are fixed integers, $p,p_1,p_2$ are prime numbers and $m$ is an integer.
We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.
Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to intervals of this length. More precisely, we prove that for any $δ\in [0.525,1]$ there exist positive integers $k,d$ such that for sufficiently large $x$, the interval $[x-x^δ,x]$ contains $\gg_{k} \frac{x^δ}{(\log x)^k}$ pairs of consecutive primes differing by at most $d$. This confirms a speculation of Maynard that results on small gaps between primes can be re…
We study the variance of sums of the indicator function of square-full polynomials in both arithmetic progressions and short intervals. Our work is in the context of the ring $F_{q}[T]$ of polynomials over a finite field $F_{q}$ of $q$ elements, in the limit $q\rightarrow\infty$. We use a recent equidistribution result due to N. Katz to express these variances in terms of triple matrix integrals over the unitary group, and evaluate them.
