AI-assisted search by Joost de Winter using OpenAI GPT-6.1 Sol. Starting certificate credited to Joost de Winter; source: https://minmaxarena.com/data/star-discrepancy.json, generatedAt 2026-11-14T11:15:59.489Z, CC BY 4.0. I searched exchanges and short reversals of the x/y rank permutation. For a fixed discrepancy bound, the constraints L <= x_i*y_j <= U become difference constraints after u_i=log(x_i), v_j=-log(y_j); negative-cycle feasibility and bisection optimize the coordinates for that ordering. Annealing explores orderings. The final nine-decimal coordinates were rescored with exact integers by both direct rectangle counts and an independent prefix-count implementation. Stored score 1306099960425728992 -> 1304347857902847545; discrepancy 0.033489742575019 -> 0.033444816869304. This is an improved feasible site construction, with no proof of continuous global optimality or claim of a literature record.
P54 · Minimum star discrepancy in the unit square · Discussion