SearcharxivSearch

arXiv subjects

Jori Merikoski

Publications and source records attributed to Jori Merikoski.

At least 19 recordsLinked to original sources

The divisor function along arithmetic progressions and binary cubic polynomials

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic progressions to almost all moduli of exponent $2/3$. Second, we show an asymptotic formula for the divisor function along the nonhomogeneous binary cubic polynomial $X Y^2+1$.

math.NT

Weighted averages of $\operatorname{SL}_2(\mathbb{R})$ automorphic kernel, Part I: non-oscillatory functions

We prove a theorem that evaluates weighted averages of sums parametrised by congruence subgroups of $\operatorname{SL}_2(\mathbb{Z})$. In the proof, spectral methods are applied directly to the automorphic kernel instead of going over sums of Kloosterman sums. In number theoretical applications this better preserves the specific symmetries throughout the application of spectral methods. In a separate paper we apply the main theorem to quadratic polynomials and obtain new results about their greatest prime factor and the equidistribution of their roots to prime moduli.

math.NT

On the greatest prime factor and uniform equidistribution of quadratic polynomials

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq n^{1+o(1)}$ under a natural hypothesis on real characters. The same uniformity is obtained for the equidistribution of the roots of quadratic congruences modulo primes. We also prove a variant of the divisor problem for $ax^2+by^3$, which was used by the second author to give a conditional result about primes of that shape.

math.NT

On primes represented by $aX^2+bY^3$

Let $a,b>0$ be coprime integers. Assuming a conjecture on Hecke eigenvalues along binary cubic forms, we prove an asymptotic formula for the number of primes of the form $ax^2+by^3$ with $x \leq X^{1/2}$ and $y \leq X^{1/3}$. The proof combines sieve methods with the theory of real quadratic fields/indefinite binary quadratic forms, the Weil bound for exponential sums, and spectral methods of GL(2) automorphic forms. We also discuss applications to elliptic curves.

math.NT

On Gaussian primes in sparse sets

We show that there exists some $δ> 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-δ}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula for the number of primes of the form $a^2+b^2 \leq X$ with $b \in B$ for any $|B|=X^{1/2-δ}$ with $δ< 1/10$ and $B \subseteq [ηX^{1/2},(1-η)X^{1/2}] \cap \mathbb{Z}$, in terms of zeros of Hecke $L$-functions on $\mathbb{Q}(i)$. We obtain the expected asymptotic formula for the number of such primes provided that the set $B$ does not have a large subset which consists of multiples of a fixed large integer. In particular, we get an asymptotic formula if $B$ is a sparse subset of primes. For an arbitrary $B$ we obtain a lower bound for the number of primes with a weaker range for $δ$, by bounding the contribution from potential exceptional characters.

math.NT

Twisted correlations of the divisor function via discrete averages of $\operatorname{SL}_2(\mathbb{R})$ Poincaré series

We prove a theorem that allows one to count solutions to determinant equations twisted by a periodic weight with high uniformity in the modulus. It is obtained by using spectral methods of $\operatorname{SL}_2(\mathbb{R})$ automorphic forms to study Poincaré series over congruence subgroups. By keeping track of interactions between multiple orbits we get advantages over the widely used sums of Kloosterman sums techniques. We showcase this with applications to correlations of the divisor functions twisted by periodic functions and the fourth moment of Dirichlet $L$-functions on the critical line.

math.NT

Primes in arithmetic progressions and short intervals without $L$-functions

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$ (with the bound $p \ll q^{350}$) as well as a new $L$-function free proof that the interval $(x-x^{39/40}, x]$ contains primes for every large $x$. In a future work we will develop the sieve further and provide more applications.

math.NT

The polynomials $X^2+(Y^2+1)^2$ and $X^{2} + (Y^3+Z^3)^2$ also capture their primes

We show that there are infinitely many primes of the form $X^2+(Y^2+1)^2$ and $X^2+(Y^3+Z^3)^2$. This extends the work of Friedlander and Iwaniec showing that there are infinitely many primes of the form $X^2+Y^4$. More precisely, Friedlander and Iwaniec obtained an asymptotic formula for the number of primes of this form. For the sequences $X^2+(Y^2+1)^2$ and $X^2+(Y^3+Z^3)^2$ we establish Type II information that is too narrow for an aysmptotic formula, but we can use Harman's sieve method to produce a lower bound of the correct order of magnitude for primes of form $X^2+(Y^2+1)^2$ and $X^2+(Y^3+Z^3)^2$. Estimating the Type II sums is reduced to a counting problem which is solved by using the Weil bound, where the arithmetic input is quite different from the work of Friedlander and Iwaniec for $X^2+Y^4$. We also show that there are infinitely many primes $p=X^2+Y^2$ where $Y$ is represented by an incomplete norm form of degree $k$ with $k-1$ variables. For this we require a Deligne-type bound for correlations of hyper-Kloosterman sums.

math.NT

Siegel zeros, twin primes, Goldbach's conjecture, and primes in short intervals

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} Λ(n) Λ(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such an asymptotic formula has been previously obtained only for fixed $h$ in which case our result quantitatively improves those of Heath-Brown (1983) and Tao and Teräväinen (2021). Since our main theorems work also for large $h$ we can derive new results concerning connections between Siegel zeros and the Goldbach conjecture and between Siegel zeros and primes in almost all very short intervals.

math.NT

On totally split primes in high-degree torsion fields of elliptic curves

Analogously to primes in arithmetic progressions to large moduli, we can study primes that are totally split in extensions of $\mathbb{Q}$ of high degree. Motivated by a question of Kowalski we focus on the extensions $\mathbb{Q}(E[d])$ obtained by adjoining the coordinates of $d$-torsion points of a non-CM elliptic curve $E/\mathbb{Q}$. A prime $p$ is said to be an outside prime of $E$ if it is totally split in $\mathbb{Q}(E[d])$ for some $d$ with $p<|\text{Gal}(\mathbb{Q}(E[d])/\mathbb{Q})| = d^{4-o(1)}$ (so that $p$ is not accounted for by the expected main term in the Chebotarev Density Theorem). We show that for almost all integers $d$ there exists a non-CM elliptic curve $E/\mathbb{Q}$ and a prime $p<|\text{Gal}(\mathbb{Q}(E[d])/\mathbb{Q})|$ which is totally split in $\mathbb{Q}(E[d])$. Furthermore, we prove that for almost all $d$ that factorize suitably there exists a non-CM elliptic curve $E/\mathbb{Q}$ and a prime $p$ with $p^{0.2694} < d$ which is totally split in $\mathbb{Q}(E[d])$. To show this we use work of Kowalski to relate the question to the distribution of primes in certain residue classes modulo $d^2$. Hence, the barrier $p < d^4$ is related to the limit in the classical Bombieri-Vinogradov Theorem. To break past this we make use of the assumption that $d$ factorizes conveniently, similarly as in the works on primes in arithmetic progression to large moduli by Bombieri, Friedlander, Fouvry, and Iwaniec, and in the more recent works of Zhang, Polymath, and the author. In contrast to these works we do not require any of the deep exponential sum bounds (ie. sums of Kloosterman sums or Weil/Deligne bound). Instead, we only require the classical large sieve for multiplicative characters. We use Harman's sieve method to obtain a combinatorial decomposition for primes.

math.NT

A Cubic analogue of the Friedlander-Iwaniec spin over primes

In 1998 Friedlander and Iwaniec proved that there are infinitely many primes of the form $a^2+b^4$. To show this they defined the spin of Gaussian integers by the Jacobi symbol, and one of the key ingredients in the proof was to show that the spin becomes equidistributed along Gaussian primes. To generalize this we define the cubic spin of ideals of $\mathbb{Z}[ζ_{12}]=\mathbb{Z}[ζ_3,i]$ by using the cubic residue character on the Eisenstein integers $\mathbb{Z}[ζ_3]$. Our main theorem says that the cubic spin is equidistributed along prime ideals of $\mathbb{Z}[ζ_{12}]$. The proof of this follows closely along the lines of Friedlander and Iwaniec. The main new feature in our case is the infinite unit group, which means that we need to show that the definition of the cubic spin on the ring of integers lifts to a well-defined function on the ideals. We also explain how the cubic spin arises if we consider primes of the form $a^2+b^6$ on the Eisenstein integers.

math.NT

Exceptional characters and prime numbers in sparse sets

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove non-trivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form $a^2+b^8$.

math.NT

Limit points of normalized prime gaps

We show that at least 1/3 of positive real numbers are in the set of limit points of normalized prime gaps. More precisely, if $p_n$ denotes the $n$th prime and $\mathbb{L}$ is the set of limit points of the sequence $\{(p_{n+1}-p_n)/\log p_n\}_{n=1}^\infty,$ then for all $T\geq 0$ the Lebesque measure of $\mathbb{L} \cap [0,T]$ is at least $T/3.$ This improves the result of Pintz (2015) that the Lebesque measure of $\mathbb{L} \cap [0,T]$ is at least $(1/4-o(1))T,$ which was obtained by a refinement of the previous ideas of Banks, Freiberg, and Maynard (2015). Our improvement comes from using Chen's sieve to give, for a certain sum over prime pairs, a better upper bound than what can be obtained using Selberg's sieve. Even though this improvement is small, a modification of the arguments Pintz and Banks, Freiberg, and Maynard shows that this is sufficient. In addition, we show that there exists a constant $C$ such that for all $T \geq 0$ we have $\mathbb{L} \cap [T,T+C] \neq \emptyset,$ that is, gaps between limit points are bounded by an absolute constant.

math.NT

On the largest square divisor of shifted primes

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^θ$ for $θ=1/2+1/2000.$ This improves the work of Matomäki (2009) who obtained the result for $θ=1/2-\varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $θ=4/9-\varepsilon.$ Similarly as in the work of Matomäki, we apply Harman's sieve method to detect primes $p \equiv 1 \, (d^2)$. To break the $θ=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d^2$ by using a similar argument as Zhang (2014) used to obtain equidistribution beyond the Bombieri-Vinogradov range for primes with respect to smooth moduli. To optimize the argument we incorporate technical refinements from the Polymath project (2014). Since the moduli are squares, the method produces complete exponential sums modulo squares of primes which are estimated using the results of Cochrane and Zheng (2000).

math.NT

On the largest prime factor of $n^2+1$

We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bretèche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in the proof are a new Type II estimate and using this estimate by applying Harman's sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selberg's eigenvalue conjecture the exponent $1.279$ may be increased to $1.312.$

math.NT

Large prime factors on short intervals

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the same problem for the longer intervals $[x,x+x^{1/2+ε}].$ We also incorporate some ideas from Harman's book `Prime-detecting sieves' (2007). The main new ingredient that we use is the iterative argument of Matomäki and Radziwiłł(2016) for bounding Dirichlet polynomial mean values, which is applied to obtain Type II information. This allows us to take shorter intervals than in the above-mentioned previous works. We have also had to develop ideas to avoid losing any powers of $\log x$ when applying Harman's sieve method.

math.NT

Vector-valued local approximation spaces

We prove that for every Banach space $Y$, the Besov spaces of functions from the $n$-dimensional Euclidean space to $Y$ agree with suitable local approximation spaces with equivalent norms. In addition, we prove that the Sobolev spaces of type $q$ are continuously embedded in the Besov spaces of the same type if and only if $Y$ has martingale cotype $q$. We interpret this as an extension of earlier results of Xu (1998), and Martínez, Torrea and Xu (2006). These two results combined give the characterization that $Y$ admits an equivalent norm with modulus of convexity of power type $q$ if and only if weakly differentiable functions have good local approximations with polynomials.

math.FA

Applying Discrete Fourier Transform to the Hardy-Littlewood Conjecture

We study the asymptotic behaviour of the prime pair counting function $π_{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method. We discuss some advantages this has over the Fourier series on $\mathbb{R} /\mathbb{Z}$, which is used in the circle method. We show how to recover the main term for $π_{2k}(n)$ predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on $\mathbb{Z}/ n\mathbb{Z}$ and on its subgroup $\mathbb{Z}/ Q\mathbb{Z},$ $Q \, | \, n.$

math.NT