Combinatorial Sieve

The *Combinatorial Sieve* is a sieve method in number theory that belongs to the class of combinatorial techniques for estimating the size of sifted sets of integers by exploiting inclusion-exclusion principles with carefully bounded remainder terms to isolate primes or almost-primes.

48

Publications

1.7K

Citations

65

Authors

48

Institutions

Publications per year

2017–2026

0

Authors

65

  1. PP
    Paul Pritchard

    Griffith University, Australia

    3 publications · 121 citations

    3

    h-index

  2. JS
    Jonathan Sorenson

    Butler University, United States

    3 publications · 49 citations

    3

    h-index

  3. RC
    Roger C. Baker

    Brigham Young University, United States

    2 publications · 66 citations

    2

    h-index

  4. HH
    H. Halberstam

    University of Nottingham, United Kingdom

    2 publications · 51 citations

    2

    h-index

  5. HI
    Henryk Iwaniec

    Rutgers, The State University of New Jersey, United States

    2 publications · 72 citations

    2

    h-index

1–5 of 65

Venues

  1. Acta Arithmetica

    6 publications · 123 citations

    6

    h-index

  2. Journal of Number Theory

    4 publications · 98 citations

    4

    h-index

  3. Mathematika

    2 publications · 41 citations

    2

    h-index

  4. Communications of the ACM

    2 publications · 63 citations

    2

    h-index

  5. Bulletin of the London Mathematical Society

    1 publications · 33 citations

    1

    h-index

1–5