Imbalance Prime Sieving

Published: 4 July 2025| Version 1 | DOI: 10.17632/s68k69z95c.1
Contributor:
Paul Bilokon

Description

In the paper "Imbalance Prime Sieving: Every Prime Gap Is a Result of a Möbius Imbalance Obstruction" (preprint: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5334569), we introduce a novel sieve for prime numbers based on detecting topological obstructions in a Möbius-transformed rational metric space. Unlike traditional sieves which rely on divisibility, our method identifies primes as those numbers which contribute new, non-colliding imbalance conjugates. This provides both an exact algorithm for prime enumeration and a new geometric interpretation of prime gaps. This sieve constructs a topological obstruction theory over rational pairs (p, q), from which we observe that every prime gap is a consequence of a collision in this transformed imbalance space. Our empirical results demonstrate that this method precisely filters the prime numbers up to a specified bound, with potential implications for new number-theoretic models and sieving algorithms. This dataset contains the output of the code associated with the paper (https://github.com/sydx/imbalance_prime_sieve).

Files

Steps to reproduce

Run imbalance_prime_sieve.py from the self-contained source code repository https://github.com/sydx/imbalance_prime_sieve

Institutions

  • Imperial College London

Categories

Computational Number Theory, Number, Prime Number, Geometry of Numbers, Distribution of Primes, Distribution of Prime Numbers

Licence