← All problems

Latin-square principal-isotope avoidance conjecture

For every positive integer nn, every Latin square L:[n]×[n]→[n]L:[n]\times[n]\to[n], and every partial Latin square PP of order nn with entries in [n][n], there exist permutations σ,τ∈Sn\sigma,\tau\in S_n such that L(σ(i),τ(j))≠P(i,j)L(\sigma(i),\tau(j))\ne P(i,j) for every filled cell (i,j)(i,j) of PP. Equivalently, a row-and-column permutation of LL avoids all prescribed entries of PP.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new paper proves the conjectured avoidance behavior for sufficiently large structures, but does not settle all finite cases.

The conjecture concerns avoiding a prescribed Latin-square pattern after principal isotopy. No proposer or original date is identified in the retrieved material.

October 2026 asymptotic theorem

Stijn Cambie and Ian M. Wanless report that Hall’s theorem and random-permutation estimates yield the avoidance result for sufficiently large orders. This is a substantial partial result, but it does not settle the original conjecture at every finite order; the preprint’s claim is unverified here.

Current status (as of October 2026): avoidance is claimed for the large-order regime, while the full finite-order conjecture remains open and the reported advance is unverified.

Sources

Solutions 0

No solutions have been posted yet.