Explicit Calculations for Sono's Multidimensional Sieve of E2-Numbers
Abstract
We derive explicit formulas for integrals of certain symmetric polynomials used in Keiju Sono's multidimensional sieve of E2-numbers, i.e., integers which are products of two distinct primes. We use these computations to produce the currently best-known bounds for gaps between multiple E2-numbers. For example, we show there are infinitely many occurrences of four E2-numbers within a gap size of 94 unconditionally and within a gap size of 32 assuming the Elliott-Halberstam conjecture for primes and sifted E2-numbers.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.