Cinna Davis and GPT-6.2 Astra · November 2026 · Unrefereed proof
Let be three distinct positive integers. Write for the supremum of the upper densities of sets of integers in which no two elements differ by a member of . Write for distance to the nearest integer and set
Theorem. For every such , . An optimal periodic set exists with period equal to one of the three pair sums .
This is the three-element conjecture attributed to Haralambis (1977). Liu and Robinson state it as Conjecture 3 and determine the density for several infinite families. The character lower bound was already known. We prove the reverse inequality by comparing three short intervals in an arbitrary avoiding set. Haralambis’s paper · Liu and Robinson, Section 6
A finite interval inequality
Assume first that , and put . Given any avoiding set in , let count its members in . We prove
We use the lattice height and its kernel . In the unit cubic lattice, take the union of closed cubes with lower corners of negative height. Its boundary is a stepped plane. Indeed, is closed and is downward closed in the coordinatewise order. Every line in direction starts inside and ends outside it. Translating a point of a positive distance in the strictly negative diagonal direction puts it in the interior. Thus each such line meets the boundary exactly once. The boundary height along these lines is continuous because moving the base point by a vector of sup norm at most moves its diagonal parameter by at most , by coordinatewise comparison. Diagonal projection therefore identifies the boundary with a plane. Translations in act on that plane as a rank-two lattice, since diagonal projection restricts to a linear isomorphism on the real kernel of . The quotient surface is a torus.
The boundary vertices are the lattice points of heights . At a vertex , the cubes with lowest and highest possible lower-corner heights have lower corners and , respectively. They lie on different sides exactly in that range. Similarly an edge in direction with lower endpoint of height belongs to the boundary exactly when . A square in directions with lower corner of height belongs to it exactly when , where is the remaining index. These facts follow by comparing the cubes incident on the edge or square. In the quotient, vertices of the same height coincide, and every integer height occurs by coprimality. We can therefore mark a vertex occupied precisely when its height belongs to the given avoiding set. Each edge has at most one occupied endpoint.
Sign the edges with two empty endpoints
Call an edge a defect if both endpoints are empty. Every square has an even number of defects. Indeed, each occupied corner removes its two incident sides from the four possible defects, and occupied corners are never adjacent. Form the dual graph on the squares, with a dual edge across each defect. Its degrees are even, so its edges can be oriented along Euler circuits with equal indegree and outdegree at every square.
Orient the torus. Assign each oriented surface edge a number as follows. A nondefect gets zero. A defect gets or according to the direction in which its oriented dual edge crosses it. Reversing negates . The sum of around the boundary of every square is zero, since it counts signed dual crossings at a balanced vertex.
On the stepped plane the sum of the lifted along a path depends only on its endpoints. Every closed edge path in this simply connected square tiling is a sum of oriented square boundaries as an integer chain. For , write for the sum along a path from a fixed vertex to its translate by . Path independence and translation invariance imply that this sum is the same for any starting vertex and that is additive. For example, translating a path joining two starting vertices by gives the same edge sum, so those two contributions cancel on the closed path comparing the starting vertices.
Parity fixes the periods. On any edge from to , we have , with the indicators evaluated at the vertex heights. The indicator terms cancel on any closed quotient walk. A lift ending at displacement has length congruent to modulo two. Hence on . In particular there are three odd integers such that for all . To see the integral extension explicitly, choose with . The integer homomorphism on extends to by evaluating it at . Twice the coefficients of this extension, plus one in each coordinate, give .
Read the three interval counts on the same torus
Fix , put and . On the permutation follows a positive edge when and a negative edge otherwise. All these edges belong to the surface. Its cycles have length . Each lifts to displacement , since the cycle uses positive steps and negative steps. Thus the sum of the signed edge values over all the cycles is .
The cycles contain exactly defect edges in total. Each occupied vertex accounts for its two incident cycle edges, and no edge is counted by two occupied vertices. Since is the defect indicator, we obtain simultaneously for all three pairs
Set . Inequality (2) says precisely that the three closed real intervals
intersect pairwise. Thus they have a common point . Each is within of the odd integer , so its distance from every even integer is at least . The single rotation satisfies for every . This proves (1).
From intervals to density and attainment
At each position in any avoiding set on the line, apply (1) to the next sites. At least one block starting there, of length , has density at most . Take that block and repeat at its right endpoint. In any interval of length the complete blocks contain at most times their total length in occupied sites, and the final unused piece has length less than . This gives the uniform bound , and hence the upper density bound. For a common divisor , partition into classes modulo and apply the primitive result for in each class. Their sum gives the same asymptotic upper bound. Also since multiplication by maps the circle onto itself.
For completeness, the maximum defining occurs at some with for a pair . The maximized function is the lower envelope of three triangular waves. Its positive maximum, if strictly below , must have active linear pieces of opposite slopes. Otherwise a small displacement in one direction increases every active wave. At such a crossing and have opposite signed distances of equal magnitude from integers, so is integral. If the maximum is , every wave equals there and the same integrality holds. The maximum is positive because sufficiently small positive makes every wave positive.
Reduce this maximizing fraction to and put . It is an integer. Take the centers with in . These residues give density , since is a unit modulo . A difference between two centers has circular residue distance less than after multiplication by , whereas each forbidden difference has distance at least . This attains , and divides the pair sum . Thus is a period of the construction.
For example, for the finite maximum over the three pair sums is , attained at . The residues modulo attain this density. The upper bound applies to every avoiding set.
An algebraic check on the period argument
One can also obtain the odd vector without using the topology of the stepped plane. Write for the signed value on the positive -edge at height . The square equations are
whenever the four heights are inside the window. Extend the occupancy indicator to be zero outside. We claim the edge values extend integrally to all integer heights, preserving both the square equations and the parity . Outside the original window their magnitudes may grow.
To add the next height , the only new unknowns are on the three incoming edges. Each square with upper height prescribes the difference of two of the . These three differences sum to zero around the cube with lower height , because the three opposite squares are already closed. More explicitly, the alternating sum of all six square boundaries of a cube cancels every edge. Thus one can choose freely and solve for in integers. Choose of the prescribed parity. The other parities follow because the prescribed edge parities themselves sum to zero around every square. Continue upwards, then perform the reflected construction downwards with outgoing edges at each new lowest height.
Pull the extended values back to the whole cubic lattice by height. Their sum on any closed lattice walk vanishes, since steps in different coordinate directions may be interchanged across elementary squares and opposite steps cancel. Integrating therefore gives a potential. Translating by preserves all edge values, so potential differences under these translations are an integer homomorphism on . Its parity is the coordinate sum by the prescribed edge parities. The same integral extension on as above yields odd . All pair cycles used in (2) remain inside the original window, where the absolute values still count defects.
Verification and priority
The verifier constructs the dual orientations, checks every square sum and reconstructs an odd period vector and common rotation from the signed pair cycles. It uses only standard Python and can be run with python3 results/haralambis-three-differences/verify.py. The general proof uses no computational assumption. A literature search located the conjecture, earlier special cases and the known character bound. We found no earlier resolution for arbitrary triples. Priority remains provisional.