EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An effective Bombieri–Vinogradov error term for sifting problems

Daniel R. Johnston

Mathematika · 2026-10 · 72 (4)

DOI: 10.1112/mtk.70129 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematika, online erschienen am 10.09.2026. Verfasst von Daniel R. Johnston. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed. The reason for this ineffectivity is the reliance on the Bombieri–Vinogradov theorem. In this paper, we show that any classical sifting problem with a Bombieri–Vinogradov style error term can, in fact, be made effective, with no loss to the asymptotic form of the original (ineffective) result. This is done by carefully modifying the sieve upper and lower bounds to avoid the usual complications regarding Siegel zeros. We also provide some simple applications. For example, we show that one may effectively bound the number of primes such that is also prime by where

Zitieren

APA

Johnston, D. R. (2026). An effective Bombieri–Vinogradov error term for sifting problems. Mathematika, 72(4). https://doi.org/10.1112/mtk.70129

Vancouver

Johnston DR. An effective Bombieri–Vinogradov error term for sifting problems. Mathematika. 2026;72(4). doi:10.1112/mtk.70129

BibTeX
@article{Johnston2026,
  author = {Johnston, Daniel R.},
  title = {An effective Bombieri–Vinogradov error term for sifting problems},
  journal = {Mathematika},
  year = {2026},
  volume = {72},
  number = {4},
  doi = {10.1112/mtk.70129}
}
Kostenlos starten →