Related papers: Variance of primes in short residue classes for fu…
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…
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
Keating and Rudnick studied the variance of the polynomial von Mangoldt function $\Lambda \colon \mathbb{F}_q[t] \rightarrow \mathbb{C}$ in arithmetic progressions and short intervals using two equidistribution results by Katz. Hall,…
An asymptotic formula for the variance of squarefree numbers in arithmetic progressions of given modulus was obtained by Nunes (see reference [3]). We improve one of the error terms.
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…
Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…
We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) =…
Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…
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…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…
We study a general class of multiplicative functions by relating "short averages" to its "long average". More precisely, we estimate asymptotically the variance of such a class of functions in short intervals using Fourier analysis and…
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…
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…
We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends…
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$…
We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…
An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.