This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Combinatorial sieve | |
|---|---|
| Name | Combinatorial sieve |
| Field | Number theory |
| Introduced | 20th century |
| Contributors | Viggo Brun, Atle Selberg, Henryk Iwaniec |
Combinatorial sieve
Combinatorial sieve is a family of elementary techniques in number theory developed to estimate the size of sifted sets of integers by combinatorial means. Originating in work by Viggo Brun and refined by Atle Selberg, Rosser and Henryk Iwaniec, these methods connect classical results such as the Sieve of Eratosthenes with deep problems like the Twin primes conjecture and the distribution of primes in arithmetic progressions associated with Dirichlet's theorem. The approach uses finite inclusion–exclusion combinatorics alongside arithmetic input from multiplicative functions and Möbius function identities.
Combinatorial sieve methods trace roots to historical algorithms like the Sieve of Eratosthenes and the systematic study of prime distribution by Leonhard Euler and Carl Friedrich Gauss, later formalized by figures such as Viggo Brun and Atle Selberg. These techniques aim to bound the cardinality of sets defined by congruence or divisibility constraints, relying on identities involving the Möbius function, Euler product considerations, and finite inclusion–exclusion sums. Combinatorial sieves stand alongside analytic tools developed by Bernhard Riemann and G. H. Hardy together with John Edensor Littlewood and modern contributors like Enrico Bombieri.
The basic set-up considers a finite sequence A of integers (often from intervals studied by Gauss or Dirichlet) and a set P of primes (associated with Euclid's infinitude of primes). One defines the sifted set A_z of elements of A not divisible by any prime p < z, and seeks upper and lower bounds for |A_z| using combinatorial inclusion–exclusion inspired by Giovanni Vitali-style partitions and Möbius function sums. Multiplicative functions such as the von Mangoldt function and the divisor function enter via weighted sums; auxiliary hypotheses often involve estimates reminiscent of Prime Number Theorem-type error terms and input from the Large Sieve or Bombieri–Vinogradov theorem when connecting to distribution in arithmetic progressions studied by Richard Rado and H. Iwaniec.
The prototype is the Sieve of Eratosthenes which removes multiples of successive primes; combinatorial sieves recast this in terms of inclusion–exclusion pioneered by Nicolas Bourbaki-style combinatorial identities and the classical Principle of Inclusion and Exclusion used by Abraham de Moivre in probability contexts. The Brun sieve, introduced by Viggo Brun, applied truncated inclusion–exclusion to bound the count of integers with few prime factors, yielding Brun's theorem on twin primes partial sums related to Paul Erdős's work. Selberg later provided an elegant combinatorial quadratic form approach, which influenced Atle Selberg's trace formula interactions with Harish-Chandra-style spectral methods.
General sieve inequalities, such as the linear and dimension d sieve inequalities, follow from combinatorial lemmas constructing upper and lower bounding weights, inspired by work of J. E. Littlewood and formalized in the Rosser and Selberg paradigms. Key lemmas include upper-bound sieves, lower-bound sieves, and duality principles related to Harmonic analysis on arithmetic groups studied by Harish-Chandra and spectral techniques invoked by Atle Selberg. These inequalities are expressed using multiplicative convolutions with the Möbius function and exploited through identities similar to those used in Dirichlet series theory as developed by Dirichlet and Riemann.
Combinatorial sieves have been applied to bound primes in short intervals and primes in arithmetic progressions in the tradition of Dirichlet's theorem and the Prime Number Theorem. Brun's sieve produced the first nontrivial result toward the Twin primes conjecture by showing the sum of reciprocals of twin primes converges (Brun's theorem), an advance contemporaneous with work by Paul Erdős on additive problems. Later advances combining combinatorial sieves with results like the Bombieri–Vinogradov theorem (stemming from Enrico Bombieri and A. I. Vinogradov) and innovations by D. A. Goldston and János Pintz yielded progress on small gaps between primes related to the Polymath Project and collaborative efforts including Yitang Zhang's breakthrough, which in turn drew on sieve refinements by James Maynard and Terence Tao.
Combinatorial sieve methods are limited by parity problems identified in work by Viggo Brun and formalized in obstructions noted by Atle Selberg; these prevent direct detection of primes rather than almost-primes. Analytic sieves, employing complex analysis from Bernhard Riemann and G. H. Hardy together with Iwaniec-style spectral methods and Automorphic forms associated with Harish-Chandra, can sometimes overcome these limitations by leveraging zero-density results for L-functions as studied by H. L. Montgomery and Andrew Wiles. Combinatorial sieves remain robust where analytic inputs such as explicit Riemann hypothesis-type bounds are unavailable.
Refinements include the Rosser–Iwaniec sieve developed by J. B. Rosser and Henryk Iwaniec, and Selberg's combinatorial quadratic form, both of which optimize weight functions to tighten bounds on sifted sets. These variants have informed breakthroughs by researchers like John Friedlander and Heath-Brown in detecting almost-primes in polynomial sequences and in applications to conjectures related to Hardy–Littlewood prime k-tuples. Modern research combines combinatorial sieves with inputs from Automorphic forms and trace formula techniques associated with Langlands program contributors such as Robert Langlands.
Category:Mathematical methods