AI Science Tracker

AI-assisted work proves a Latin-square imbalance bound, with optimal examples through order 52

Cornell University; TU Wien · 9 Mar 2026 · mathematics

Discovery

AI-assisted work proves a Latin-square imbalance bound, with optimal examples through order 52

A collaborative LLM-plus-symbolic-computation study proved that every n×n Latin square with n ≡ 1 (mod 3) has imbalance at least 4n(n−1)/9. It introduced near-perfect permutations that attain the bound and computationally found independently verified matching examples for every such order from 4 through 52. The universal lower-bound theorem was formally checked in Lean 4.

Technology: Claude Opus 4.5 LLM agent with SageMath, Rust exhaustive solver, simulated annealing and Lean 4 verification tools

Family Claude: profile · models page

Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.

Result, AI contribution and limits

Evidence context (descriptions follow the cited sources; test type is a catalog classification):

  • Publication status: Preprint
  • Test type: prospective or independent check
  • Tested: A collaborative LLM-plus-symbolic-computation study proved that every n×n Latin square with n ≡ 1 (mod 3) has imbalance at least 4n(n−1)/9.
  • Still unknown: This is an arXiv preprint (v2 dated 2026-08-13), not yet peer-reviewed in the sources checked. The universal proven theorem is a lower bound for n ≡ 1 mod 3. Matching constructions, and hence demonstrated tightness, are computationally established only for n=4,7,…,52; the paper does not prove that the bound is attained for every larger order. Lean 4 formalizes the lower-bound inequality, not the finite construction search or universal tightness.
  • AI role: The agent identified an all-even row-distance parity pattern in numerical search data, formulated and helped prove the lower bound, and used model review to catch proof errors. SageMath and a Rust solver supported symbolic analysis and enumeration; simulated annealing found matching constructions through n=52. Human strategic direction supplied the decisive pivot to the minimum-positive-imbalance question. Lean 4 formally verifies the lower-bound theorem itself.

Evidence sources: https://arxiv.org/html/2603.08322v2

Source checked · editorial details

The source page was checked against this entry. Independent confirmation is not assessed by this label.

Source type: paper. Paper: linked separately.

Review scope and date are not recorded; source checked does not establish full-text review.

Editorial assessment: Impact 3/5 · Validation 4/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.

Follow-up and relationships

No follow-up recorded; this is not a claim that no follow-up exists.

Follow-up review scope and date are not recorded.

No source-supported relationships recorded.

Open in the full catalog for filters, charts and related discoveries.