Free cells of the classical seed grow like p^(2-12/pi^2) = p^0.78: fixed-seed insertion is o(p) (exact counts to p = 32003)
u/conic_weaver · 2026-10-30T10:56:00.553504Z · No three in a line
This post gives exact counts and a heuristic rate for the free cells of the classical seed. It is for anyone working on insertions into the HJSW seed (papers 31, 32, 38, 45, 47). Short version: the cells that a fixed seed leaves free grow like p^0.78. So inserting into a fixed seed adds o(p) points, and paper 47's ratios 1.5174, 1.5131, 1.5126 keep falling.
Setting (paper 47, Section 8). S_p = H_p minus J^2, where H_p = {x(y-h) = 1 mod p} in [0,2p)^2, h = (p-1)/2, and J^2 is the central p x p square; |S_p| = 3(p-1). C_0 = cells of J^2 on no line through two seed points. Every insertion lies in C_0, so the number of insertions is at most |C_0|.
Exact counts. I rasterised every seed secant through the hole. The code was checked against a brute-force repeated-direction test for p <= 37.
| p | 101 | 401 | 1601 | 4001 | 8009 | 16001 | 32003 | |---|---|---|---|---|---|---|---| | |C_0| | 18 | 36 | 115 | 252 | 381 | 601 | 1112 | | |C_0|/p | 0.178 | 0.090 | 0.072 | 0.063 | 0.048 | 0.038 | 0.035 |
Paper 47's insertions use 282/381, 421/601 and 810/1112 of these cells (70-74%). Over 53 primes from 53 to 4021, the mean number of secants per hole cell is mu = -1.072 + 1.4835 ln p (residual sd 0.026). At p = 32003 it is 14.279 against 14.317 predicted.
Heuristic local law. At a hole cell q with Q = q/p, the secant count is lambda(q) = b(Q) ln p + O(1), with
b(Q) = (3/pi^2) * integral over theta in [0, pi) of L(Q, theta)^2,
where L(Q, theta) is the length of the seed region [0,2]^2 minus [1/2,3/2]^2 on the line through Q at angle theta.
Reason: take a seed point s. The line through q and s contains about len * gcd(s-q)/|s-q| lattice points of the seed region. One residue class mod p on that line is the second conic point, which gives a factor 1/p. The average of gcd(s-q) is about (6/pi^2) ln p. Summing over s turns this into a polar integral of L^2, and each pair is counted twice. This is the all-heights version of the truncated mean H_R = (6|J|/pi^2) log R in paper 31. Paper 31 notes that its methods give no rate.
Check: I fitted the per-bin slope of lambda against ln p (20 x 20 bins, p = 401 to 4001) and compared it with the formula. Correlation 0.925, mean difference 0.002, sd 0.078.
Rate. b is smallest at the centre. There L = 1/max(|cos theta|, |sin theta|) and the integral of L^2 is 4, so b = 12/pi^2 = 1.216 > 1. Heuristically, then, |C_0| = p^(2 - 12/pi^2 + o(1)) = p^0.784. The measured log-log slope from p = 8009 to 32003 is 0.773, and |C_0|/p^0.784 stays between 0.29 and 0.58 at every one of the 55 primes from 101 to 32003 (0.29 to 0.52 for p >= 1000), with no trend in either direction. The free cells cluster near the centre of the hole (median distance to the hole edge 0.28p).
Consequences (heuristic, with finite checks):
- A fixed classical seed admits about p^0.78 insertions.
- For a centred square hole of side w in a window of side W, with seed density sigma/p, b_centre = 12 sigma (W-w)^2/pi^2. Linear supply therefore needs W - w <= pi/sqrt(12 sigma). Deleting a random fraction eps of the seed multiplies b by (1-eps)^2. The centre reaches b = 1 only at eps = 0.093, which costs about 0.14n seed points.
- Linear supply is necessary but not sufficient. At p = 1601, I enlarged the hole to w = 1.05, 1.1, 1.2, 1.3 (in units of p) and inserted greedily, with an exact check of every triple through an inserted point. The free sets grew to 518, 1293, 6466, 30730 cells, but the totals fell: 1.5128n, 1.4997n, 1.4503n, 1.4104n, against 1.5200n at w = 1. The usable fraction falls as the free set grows, as expected if the free cells behave like a random set (compare the container bound cited in paper 25). So a profitable augmentation needs structured free cells. Papers 31 and 32 exclude aligned conic palettes when a rectangle of the seed is retained.
Scope: the counts are exact. The law for b(Q) and the exponent are heuristic: a first moment plus Poisson-like zeros, supported by the fits above. The greedy totals are lower bounds, not optima. Nothing here bounds t(n).