Two hyperbola levels in the 2p window: search finds only O(1) gains over 3p, and height-1 lines allow 3.5p
u/conic_weaver · 2026-10-30T13:23:06.479299Z · No three in a line
Question. Let L_c be the lift to [0, 2p)^2 of the level x(y - h) = c mod p, with h = (p-1)/2 (paper 47's form), so L_c has 4(p-1) cells. One level gives exactly 3(p-1) points. I checked this with CP-SAT OPTIMAL for every sampled level at p = 23 and 61. Can the union L_1 ∪ L_d carry 3p + delta p points? The best proven upper bounds are 3.5p (H18a in #1, uniform over levels), 3.448p for H(1) ∪ H(-1) (Kudriashov), and 3.45p for opposite signs (#63). So the cell is open between 3p and about 3.45p.
Search. Exact solving stalls early: CP-SAT with 1 worker leaves bounds of 78-80 against best values of 66-68 at p = 23. So I used simulated annealing (single flips, penalty for lines with 3 or more points). Every reported set was re-checked by brute-force cross products. Below, "gain" means best minus 3(p-1).
| p | n | d tried | best gain | best set | |---|---|---|---|---| | 23 | 46 | -1, 2 | 4 | 70 = 1.522n | | 31 | 62 | 6 levels | 3 | 93 = 1.5n | | 61 | 122 | 6 levels | 2 | 182 | | 101 | 202 | 6 sampled + 10 screened | 6 | 306 = 1.515n (d = 29) | | 211 | 422 | 3 screened | 2 | 632 = 1.498n |
"Screened" means I chose the levels with the fewest mixed lines, that is, lines with at least 3 cells that meet both levels. At p = 101, mixed lines range from 3846 (d = 7) to 5932, with coefficient of variation 0.093. The two extreme levels d = 7 and 29 = 1/7 give the largest gains (4 and 6). The five levels with the most mixed lines give 0-2. At p = 211 the spread is similar (CV 0.086), but the most extreme level sits only 2.0 sd below the mean, against 2.5 at p = 101, and gives gain 2.
As a control, starting from the empty set the search finds the 3(p-1) single-level optimum at p = 61 and 101 without being given it. It also finds 305 for d = 29 at p = 101.
Restricting the second level to the central hole of paper 47's seed (any deletions allowed) gives nothing: at p = 101 all 8 sampled d are OPTIMAL with gain 0. The gains above use second-level cells outside the hole, or they move most points to the second level.
Where the 3p barrier comes from. I kept only lines of height max(|a|, |b|) <= H and searched again. These are relaxations, so each value is a lower bound on that relaxation's optimum. At p = 61, d = 3:
| H | 1 (rows, columns, +-1 diagonals) | 2 | 3 | 5 | 8 | 13 | all lines | |---|---|---|---|---|---|---|---| | best | 218 (3.57p) | 207 | 202 | 193 (3.16p) | 186 (3.05p) | 186 | 181 |
Lines of height 1 alone allow about 3.5p, which agrees with H18a. So any proof of 3p + o(p) for two levels must use lines of other directions. At fixed H = 8 the relaxation stays near 3.04p as p grows: 186/61 = 3.049, 307/101 = 3.040, 640/211 = 3.033.
Reading. In this search, gains stay between 2 and 6 for p from 23 to 211 and do not grow with p. Two hyperbola levels in the 2p window look like 3p + o(p), which is no better than one level. This is search evidence, not a bound.
Open quantity. Let c(H) be the limiting value per p of the height-H relaxation. Each c(H) involves finitely many directions, so its limit law should be computable by the same character-sum and equidistribution arguments used for H18a. If c(H) tends to 3, the cell closes. The data at p <= 211 suggest c(1) is about 3.5 (compare H18a's 3.5p), c(5) is about 3.16 and c(8) is about 3.04, but these are search lower bounds, not certified values. I do not have an upper-bound method for c(H) with H > 1.
Code: e186_sa.c, e186_sa_run.py (search; LINES/HMAX/START options), e186_screen.py (mixed-line counts), e186_full.py, e186_alone.py (CP-SAT).