Pairwise orthogonal Italian squares: transversal criteria, and new entries at orders 6 and 7
Abstract
An Italian square of order n is the compressed presentation of an alternating sign hypermatrix, and two of them are orthogonal when every plane of one meets every plane of the other in Frobenius inner product 1. Ernst, Lia, O'Brien, Sheekey and Zumbrägel introduced this notion of orthogonality, proved that a pairwise orthogonal set (a POIS) of order n has at most n-1 members, and closed with a table recording, for each order n ≤ 7 and each i, the largest POIS with exactly i non-Latin members; several of its entries are lower bounds or blanks. Applying the partial-sum description of an alternating sign matrix along the third axis, we obtain that an alternating sign hypermatrix is exactly a chain 0 = Q₀, Q₁, …, Qₙ = J of (0,1)-matrices whose successive differences are alternating sign matrices, that orthogonality telescopes along that chain, and that the first plane of such a hypermatrix is a permutation matrix. The last of these turns the common-transversal argument the authors use for one order-4 pair into a criterion that tests a pair, and then into one that tests a single square. Using them we raise the (7,1) entry of the table from ≥ 2 to ≥ 3 by exhibiting three pairwise orthogonal Italian squares of order 7 exactly one of which is not Latin; and we decide two instances of its open (6,3) cell, showing that the order-6 pair the authors print is maximal — no Italian square of order 6, Latin or not, is orthogonal to both members — and exhibiting a non-Latin Italian square of order 6 that lies in no set of three POIS. Every theorem stated here is machine-checked in Lean 4.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
ca9f8414f2d4276e12d24be535ea776e6296e56ce8e78a62172f59e1537a39c1
Claim ledger
Stated results
P1known2026-08-22
The source's definitions, and every worked example in it, kernel-checked
P2routine2026-08-22
Alternation is the partial-sum condition; an ASHM is a chain of 0/1 matrices whose successive differences are ASMs; orthogonality telescopes
P3routine2026-08-22
The gate: the first plane of an ASHM is a permutation matrix, so a pair of MOLS with no common transversal is a maximal POIS
P4known data2026-08-22
An explicit set of three POIS of order 5 with exactly one non-Latin member
P5known2026-08-22
Order 10: a POIS of size two exists and passes the gate; whether three exist is OPEN
P6candidate2026-08-23
A set of three POIS of order 7 with exactly one non-Latin member (source's table records >= 2)
P7routine2026-08-23
Permutation matrices as injective index functions; the gate of commonₜransversalₒfₜriple restated as a decidable search
P8routine2026-08-23
A single-square criterion: an Italian square no two of whose permutation transversals meet in exactly one cell lies in no set of three POIS
P9candidate2026-08-23
The source's own order-6 POIS of size two is maximal, and a non-Latin order-6 Italian square that lies in no triple
P10measurement2026-08-23
Order 6 is a settled *frontier*, not a settled cell: (6,3) is open and now priced
This ledger entry is reported in prose and is not bound to a Lean theorem.Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Source. A. Ernst, S. Lia, C. O'Brien, J. Sheekey, J. Zumbrägel, *Generalising Latin square orthogonality and Frobenius–König with alternating sign matrices*, arXiv:2606.25884 (24 June 2026).
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7