For an integer and an order , write for the minimum, over all -colourings , of , where the maximum is over labelled Steiner triple systems of order and . Following Gishboliner, Glock, and Sgueglia \cite{GishbolinerGlockSgueglia2025}, the bulk of the recent work on this quantity has been on lower bounds for (proving ) and on structural characterisation of the low-discrepancy 2-colourings. We give three small computational contributions in the small- regime : An exact value of for each such , matching the formula obtained by optimising the GGS Example 1.1 family. Rigorous for via exhaustive search over labelled STSs ( resp. systems) and over all -colourings; computational for by simulated-annealing search; A wide near-optimal basin: at , every two-colour-flip neighbour of the optimal Example~1.1 colouring that maintains discrepancy exists; about of two-flip perturbations preserve optimality; Random-colouring statistics for : grows linearly in , in agreement with a heuristic Gaussian estimate over sampled labellings; the typical-case discrepancy is far below the GGS worst-case . We additionally state a conjectural exact formula for that holds for every .

生成讲解博客的中文版本

生成AI智能校验的中文版本