The Setting
A walk in moves at time by the step , itself a Gaussian integer. Over a window of consecutive times the walk is described by its steps in order, a word of length over the alphabet , and one asks what that word records of the walk’s position.
The primes fall into dyadic batches, the batch of index holding those with . Each batch is given a word length, a power of two that depends on alone, and the question is how these lengths compare across batches and how fast they grow with .
The Claim
Definition 1. Let be a walk in , and let be integers. The increment word of length at time of the walk is the word of Gaussian integers (1)✦ Writing for its th letter, the letters sum to the displacement of the walk from time to time : (2)✦ For an integer , the word length of the dyadic batch of index is (3)✦ For integers , (4)✦ and for every integer , (5)✦
In the paper, the result reads: , with dyadic lengths , where is the scale of the paper’s batch of primes in .
What Is Checked
The word (1), the lengths (3) and the facts (2), (4) and (5) are stated over any walk in , self-avoiding or not and with steps of any size, and over all integers and , the logarithms in (5) being natural logarithms of real numbers.