Bounded-Step Walks on Gaussian Primes
For every finite real there is a finite such that every connected component of has at most vertices, independent of the starting prime and including primes on the coordinate axes; consequently every sequence of distinct Gaussian primes whose successive distances are at most has at most terms.
The reduction from Theorem 1.2 to Theorem 1.1 via Proposition 2.1 is complete and rigorous, and Theorem 1.2 is proved in full in Sections 3-8.
“Theorem 1.1 (Uniform component bound). For every finite real D there is a finite BD such that every connected component of GD has at most BD vertices. The bound is independent of the starting prime and includes primes on the coordinate axes. Consequently every sequence of distinct Gaussian primes whose successive distances are at most D has at most BD terms.” · Show in paper