4 citations · 4 across the 15 of their papers we have counts for
17 papers · 1 filter
The divisor function along arithmetic progressions and binary cubic polynomials
Lasse Grimmelt, Jori Merikoski
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 asymp…
On the greatest prime factor and uniform equidistribution of quadratic polynomials
Lasse Grimmelt, Jori Merikoski
We show that the greatest prime factor of is at least infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigen…
Weighted averages of automorphic kernel, Part I: non-oscillatory functions
Lasse Grimmelt, Jori Merikoski
We prove a theorem that evaluates weighted averages of sums parametrised by congruence subgroups of . In the proof, spectral methods are applied di…
On primes represented by
Jori Merikoski
Let 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…
Twisted correlations of the divisor function via discrete averages of Poincaré series
Lasse Grimmelt, Jori Merikoski
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 me…
Primes in arithmetic progressions and short intervals without -functions
Kaisa Matomäki, Jori Merikoski, Joni Teräväinen
We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new -function free proof of Linnik's problem of b…
On Gaussian primes in sparse sets
Jori Merikoski
We show that there exists some such that, for any set of integers with for all , there are infinitely many primes of the form …
The polynomials and also capture their primes
Jori Merikoski
We show that there are infinitely many primes of the form and . This extends the work of Friedlander and Iwaniec showing that there are infinitely…
Exceptional characters and prime numbers in sparse sets
Jori Merikoski
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…
A Cubic analogue of the Friedlander-Iwaniec spin over primes
Jori Merikoski
In 1998 Friedlander and Iwaniec proved that there are infinitely many primes of the form . To show this they defined the spin of Gaussian integers by the Jacobi symbol, an…
On totally split primes in high-degree torsion fields of elliptic curves
Jori Merikoski
Analogously to primes in arithmetic progressions to large moduli, we can study primes that are totally split in extensions of of high degree. Motivated by a question o…
On the largest prime factor of
Jori Merikoski
We show that the largest prime factor of is infinitely often greater than . This improves the result of de la Bretèche and Drappeau (2019) who obtained this with…
On the largest square divisor of shifted primes
Jori Merikoski
We show that there are infinitely many primes such that is divisible by a square for This improves the work of Matomäki (2009) who obtained…
Limit points of normalized prime gaps
Jori Merikoski
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 denotes the th prime and is the…
Large prime factors on short intervals
Jori Merikoski
We show that for all large enough the interval contains numbers with a prime factor Our work builds on the previous works of Heath-…
Averaged Form of the Hardy-Littlewood Conjecture
Jori Merikoski
We study the prime pair counting functions and their averages over We show that good results can be achieved with relatively little effort by considering average…
Applying Discrete Fourier Transform to the Hardy-Littlewood Conjecture
Jori Merikoski
We study the asymptotic behaviour of the prime pair counting function by the means of the discrete Fourier transform on . The method we develop…