Improved Lower Bounds for Mutually Orthogonal Latin Squares (MOLS) at 33 Orders
math.CO, cs.DM
Submitted: 2026-11-12
Updated: 2026-11-12
Code: https://github.com/Constructive-Codes/MOLS
Terminology
Sources
- The Endless Exam: Mathematical Constructions from Today's Models toward Superintelligence
- TCSExam: Evaluating Frontier LLMs on the Full Range of TCS Research
- Improving SAT Solvers on Orthogonal Latin Square Problems
- A new structure for difference matrices over abelian $p$-groups
- A lower bound on HMOLS with equal sized holes
- Computational Enumeration of Andr'e Planes
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality