The distance bound for loops with nonequivalent associator

At least 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

Primary source

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

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.