Double Sieve with Feedback: Adaptive Sieve Methods for Detecting Dense Additive Structures

Building on Allakhverdov’s (2014) work on double sieves for the Goldbach-Euler and twin primes conjectures, this idea introduces adaptivity: instead of a static sieve, the method continuously adjusts based on detected local irregularities in density or structure. For example, when the sieve detects a cluster of almost-primes or dense sumsets, it “zooms in” by tightening parameters or introducing auxiliary constraints, akin to a feedback loop. This approach is novel in that it combines the rigidity of classical sieves with the flexibility of modern probabilistic or machine-learning inspired methods. It could unearth new dense configurations missed by traditional sieves and provide fresh insight into longstanding additive problems, leveraging the “question the norm” and “generate theories from conflict” heuristics.

References:

1. Some problems in additive number theory. A. Allakhverdov (2014).
2. Some problems in additive number theory. A. Allakhverdov (2014).