| dc.contributor.author | Chirre, Andrés | |
| dc.contributor.author | Júnior, Valdir José Pereira | |
| dc.contributor.author | de Laat, David | |
| dc.date.accessioned | 2022-09-16T10:49:19Z | |
| dc.date.available | 2022-09-16T10:49:19Z | |
| dc.date.created | 2021-12-20T12:52:23Z | |
| dc.date.issued | 2021 | |
| dc.identifier.citation | Mathematics of Computation. 2021, 90 (331), 2235-2246. | en_US |
| dc.identifier.issn | 0025-5718 | |
| dc.identifier.uri | https://hdl.handle.net/11250/3018411 | |
| dc.description.abstract | 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. Helv. 94, no. 3 (2019)]. For this we extend the Guinand-Weil explicit formula over all Dirichlet characters modulo , and we reduce the associated extremal problems to convex optimization problems that can be solved numerically via semidefinite programming. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | American Mathematical Society | en_US |
| dc.title | Primes In Arithmetic Progressions And Semidefinite Programming | en_US |
| dc.type | Journal article | en_US |
| dc.type | Peer reviewed | en_US |
| dc.description.version | acceptedVersion | en_US |
| dc.source.pagenumber | 2235-2246 | en_US |
| dc.source.volume | 90 | en_US |
| dc.source.journal | Mathematics of Computation | en_US |
| dc.source.issue | 331 | en_US |
| dc.identifier.doi | 10.1090/mcom/3638 | |
| dc.identifier.cristin | 1970534 | |
| cristin.ispublished | true | |
| cristin.fulltext | postprint | |
| cristin.qualitycode | 2 | |
