For every integer and each we determine the maximum upper density of a set of integers avoiding all differences in . For both families this proves Haralambis's prediction , where and is distance to the nearest integer. The prediction for an arbitrary triple is open in the sources checked. Liu and Robinson, Conjecture 3
For gap five, use Theorem 1 of the original proof and the small cases below. For gap seven, the following table gives the density for outside the eight listed small cases. Each pair denotes .
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|---|
| Entry |
At , , the answer is . The published preprint's prediction exceeds this by . Thus the two formulas agree at 41 and differ at every . At the original prediction holds. The other eight residue branches agree with the preprint throughout its stated domain. Carraher et al., Conjecture 39
For the value is at gap five and at gap seven, by the residue- argument below. The remaining small cases complete the two formulas.
| Gap | Values of | Densities in the same order |
|---|---|---|
| 5 | 2, 3, 4, 5, 7, 12 | |
| 7 | 2, 3, 4, 5, 6, 7 | |
| 7 | 9, 11, 14, 16, 18, 23, 25, 32 |
Constructions and the Lonely Runner value
For rational in lowest terms, put . The residues define an independent set of density . Rational times are dense and the objective is continuous, hence . The constructions below attain the stated density at a particular time. Together with the upper bounds, they imply equality. The gap-five constructions are in the original proof.
At gap seven and residue , take . All forbidden differences are modulo 9. The eight consecutive sites and the site form a nine-cycle, which contains at most four occupied sites. Averaging gives the reverse inequality. This argument also applies to . For gap five use the seven-cycle and .
For gap-seven residues , put , and . The table makes integral. Modulo , the forbidden steps multiplied by are , and . They all belong to since . In the seven classes the first eligible values are respectively , where this inequality can be checked directly. It persists as grows.
For residue put , and . Writing gives odd. Since and is odd, . The identity gives . Also and . Thus works.
For each of the 20 small cases the Python verifier exhibits a rational time by enumerating denominators that are sums of two forbidden differences. It checks the three modular distances, the cardinality and independence of the residue set. Using the strict-prefix lemma from the original proof, it then excludes a denser independent set by direct enumeration on a specified interval of length at most 128. The denominators used for the construction suffice because the verifier finds a witness. Small cases and finite-word verifier
The upper bound at gap seven
The shortening proof for gap five applies with the following constants and local counts. For clarity, the two cycles at index consist of the sites and . Each has nine vertices. Subtract each occupation count from four, and call the sum of the two deficits . These nonnegative integers have mean at density . A better periodic set therefore yields a rotation with at every , where the sum starts at zero and . Periodic approximation covers arbitrary sets.
Use rows of width with states storing the last seven bits of each row. For , take or as the table specifies. The finite strip construction, seam equalities, final transitions and prefix tests are exactly those defined in the gap-five proof, with the history length seven and the nine-cycle costs above. In the two-row graph there are 577 states. The states with both a four-step incoming and a four-step outgoing zero-cost walk induce a single directed nine-cycle. The verifier generates all states and checks these assertions. In any 17 zero steps, states 4 and 13 therefore agree. The indices work simultaneously for both adjacent pairs of a three-row strip.
For , divide the first columns into segments at , and reserve the first and last 17 columns of each segment. Every interior has length at least . There are at most positive columns in total. If every zero run in one interior had length at most 16, its length would be at most . Hence each interior admits deletion of a closed nine-step walk of zero cost, leaving the seams and the remembered first bits intact.
Set and . Write , . The checkpoint occurs within columns to the right of segment boundary in row , or within the final extension at . Exactly steps preceding it have been deleted in row order. Its cost is unchanged at the shortened checkpoint . By monotonicity these checkpoints imply all strict prefix bounds. The new parameter has the same residue modulo nine. A step from above 4000 lands at or above 3875, so all small exceptions are avoided.
Iteration reaches . The C++ verifier excludes such a path at all 3,541 required base parameters from 8 through 4000 and accepts the relaxed-budget controls. This proves the upper bound in all remaining cases. Strip verifier
The supplementary tables of Carraher et al. already contain many exact small values and construction bounds. The classification gives a uniform upper bound and the corrected branch for all . A related result of Pandey treats under the hypothesis . The representation of the present families falls outside that hypothesis for . Original data, Pandey, Theorems 2.1, 3.1 and 4.1