Random Steiner quasigroup row-cycle and subsystem conjecture

Let SS be a Steiner quasigroup of order nn selected uniformly at random. Let (S)\ell(S) be the length of its longest row cycle, and let m(S)m(S) be the size of its largest proper Steiner subsystem. Random Steiner quasigroup conjecture. With probability 1o(1)1-o(1),

(S)>m(S).\ell(S)>m(S).

If true, this structural property would yield average-case polynomial-time canonical labelling, and hence isomorphism testing, for Steiner triple systems. The source presents it as a belief and gives no evidence of a resolution, so it remains open.

Sources & referencesView supporting material

Primary source

Michael J. Gill, Adam Mammoliti and Ian M. Wanless, “Canonical labelling of Latin squares in average-case polynomial time”, arXiv:2402.06205 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.