Cinna Davis and GPT-6.2 Astra · November 2026 · Unrefereed proof
Let be positive integers with . Consider the tile
and its set of positive differences
A set of centers packs translates of precisely when no two centers differ by an element of . Write for the supremum of their upper densities. Write , where the norm denotes distance to the nearest integer.
Theorem. Put and write , with . Then
This proves the tightness conjecture following Theorem 2 of Natalchenko and Sagdeev and answers their question about in Section 4. They proved the packing lower bound in full generality, proved optimality when or , and identified the two candidate interval lengths for an upper bound. We use their two intervals. The new step is an integer inequality relating their occupancy counts. Original article · Authors' formulation and proof
For example, has two gaps of length five followed by two of length three. Three centers at modulo give a packing. The theorem shows that every packing, periodic or otherwise, has upper density at most .
The two interval counts
Exchanging with preserves . For this sends to and interchanges the two formulas. Thus we can assume for the upper bound when . Put
Suppose and avoids . Let and .
Counting lemma. There exists an integer such that
Lift each site to an integer pair with . Such lifts exist by coprimality. They differ by multiples of . Give a lift the weight . Translation by adds to its weight, so choose the unique lift of each site with weight in . The lift of is . Include as a final endpoint of weight and height zero. Here height means .
We check how two lifts can differ. For distinct lifted sites, and also for the two endpoints lifting , take the difference in the direction of nondecreasing weight, so . The following are the only possibilities.
| Type | Bounds on the displacement |
|---|---|
| Both coordinates positive | |
| , with | |
| , with |
Indeed, if then for a nonzero displacement of nonnegative weight. If , the weight condition forces , so the positive height difference belongs to . This contradicts avoidance. Thus . If also , the height would increase by at least , impossible inside . This gives row . If , the same weight argument shows that would put in . Hence . Then would give a height decrease of at least . This proves row . The two copies of have displacement in the positive direction, which lies in the first row.
All three rows have strictly positive weight. In particular, distinct chosen lifts have distinct weights. Sort the lifts by weight, from to . There are exactly steps. Write for the numbers of steps of the indicated types and set . Summing the second coordinates in the table gives
For the first coordinates, a step ordinarily contributes at least . The one exception is . Such a step drops in height by at least . Its starting site therefore lies in . Each starting site occurs once, so at most steps have this exception. Summing gives
This proves (1).
The upper bound
Let be the claimed density. Each center starts an interval of length or in which the fraction of centers is at most . To see this, translate the center to zero and apply (1).
- If and , then . If , then . The last inequality follows from .
- If and , then . If , then . Here .
Starting at the left endpoint of any integer interval, take such a block if the first site is a center, and take a single empty site otherwise. Continue until the next block would overrun the interval. Each complete block has density at most , and the remaining length is less than . Dividing by the interval length and taking a limit gives for arbitrary packings. If , simple counting gives the same bound , since each disjoint tile contains sites and has bounded diameter.
Attainment by a character
For rational in lowest terms, the residues permute the classes modulo . If , centers whose residues lie in have density and avoid every difference in . Continuity in and density of rationals give .
For , both are the same unit modulo by coprimality. Taking with sends the differences to the nonzero classes on the circle, attaining .
For , exchange the two steps if necessary so that . We now allow either order of . Write and . We have for , and for this follows from . Directly,
Choose integers with and put . The second identity gives and . Thus each forbidden difference , multiplied by , has representative in . The largest occurs at since . The difference attains , so gives . The upper bound already proved gives equality throughout. The step exchange gives the last branch of the theorem as well.
The proof covers noncoprime steps after dividing by their greatest common divisor. Indeed each residue class modulo that divisor carries a copy of the reduced packing problem, and repeating a reduced packing in every class attains the same density. For the character value, multiplication by the divisor maps the circle onto itself.
Reproducibility
The argument above is independent of computation. The verifier enumerates finite anchored packings directly from forbidden differences and checks (1) and the two interval bounds. It also checks character attainment and the density of the associated periodic packing in a larger parameter range. Run python3 results/nonmixed-gap-packing/verify.py from the repository root. A literature search located the original 2025 statement and no earlier general resolution. Priority remains provisional.