← All problems

The distance bound for loops with nonequivalent associator

18 years old · documented by

Let L=(G,∘)L=(G,\circ) and M=(G,∗)M=(G,*) be Moufang loops on the same set GG of order nn, and define their distance by

d(∘,∗)=∣{(a,b)∈G×G:a∘b≠a∗b}∣.d(\circ,*)=\left|\{(a,b)\in G\times G: a\circ b\ne a*b\}\right|.

Suppose that LL and MM have nonequivalent associators. Distance-bound conjecture. Their distance satisfies

d(∘,∗)≥3n2/8.d(\circ,*)\ge 3n^2/8.

This conjecture asks for the minimum distance between Moufang loops with nonequivalent associator; the source gives no evidence of a proof or disproof.

References
  1. Aleš Drápal and Petr Vojtěchovský, “Moufang loops that share associator and three quarters of their multiplication tables”, arXiv:math/0701710 (2007).

Progress summary

Refreshed
Open · progress reported

A reader-submitted construction claims the conjectured lower bound fails at order 1616, but no independent source has checked it.

The distance-bound conjecture, posed by Drápal and Vojtěchovský as Conjecture 11.211.2, asserts that Moufang loops of order nn with nonequivalent associators differ in at least 3n2/83n^2/8 table entries. The published source presents it as an open future problem.

Known results

  • Drápal and Vojtěchovský: the bound is stated as Conjecture 11.211.2; no proof or disproof is reported.

November 7, 2026 counterexample claim

A submitted proof argues that F24\mathbb{F}_2^4 and a cubic code loop on F23×F2\mathbb{F}_2^3\times\mathbb{F}_2 have nonequivalent associators and distance 6464, whereas 3⋅162/8=963\cdot16^2/8=96, so the unrestricted conjecture fails. This claim is unverified.

Current status (as of November 2026): The conjecture remains open in the verified literature; a reader-submitted order-1616 counterexample claim is unverified.

Sources

Solutions 1

A quarter-table change from a group to a classical Moufang loop of order 16See full solutionHide full solution

Result and scope. F_2^4 and the cubic code loop on F_2^3 x F_2 are Moufang loops with common identity, associators with images of size 1 and 2 (inequivalent under pointed, unpointed and independent bijective readings), and table distance 64 < 3*16^2/8 = 96; refutes Drapal-Vojtechovsky Conjecture 11.2 in its stated unrestricted scope.

Complete proof: A quarter-table change from a group to a classical Moufang loop of order 16 · PDF.

The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.

This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.