Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918353931599872 |
|---|---|
| author | Pascadi, Alexandru |
| author_facet | Pascadi, Alexandru |
| contents | We prove new large sieve inequalities for the Fourier coefficients $ρ_{j\mathfrak{a}}(n)$ of exceptional Maass forms of a given level, weighted by sequences $(a_n)$ with sparse Fourier transforms - including two key types of sequences that arise in the dispersion method. These give the first savings in the exceptional spectrum for the critical case of sequences as long as the level, and lead to improved bounds for various multilinear forms of Kloosterman sums.
As an application, we show that the greatest prime factor of $n^2+1$ is infinitely often greater than $n^{1.3}$, improving Merikoski's previous threshold of $n^{1.279}$. We also announce applications to the exponents of distribution of primes and smooth numbers in arithmetic progressions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_04239 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$ Pascadi, Alexandru Number Theory 11N75 (Primary), 11N32, 11L05 We prove new large sieve inequalities for the Fourier coefficients $ρ_{j\mathfrak{a}}(n)$ of exceptional Maass forms of a given level, weighted by sequences $(a_n)$ with sparse Fourier transforms - including two key types of sequences that arise in the dispersion method. These give the first savings in the exceptional spectrum for the critical case of sequences as long as the level, and lead to improved bounds for various multilinear forms of Kloosterman sums. As an application, we show that the greatest prime factor of $n^2+1$ is infinitely often greater than $n^{1.3}$, improving Merikoski's previous threshold of $n^{1.279}$. We also announce applications to the exponents of distribution of primes and smooth numbers in arithmetic progressions. |
| title | Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$ |
| topic | Number Theory 11N75 (Primary), 11N32, 11L05 |
| url | https://arxiv.org/abs/2404.04239 |