The distance bound for loops with nonequivalent associator
The distance bound for loops with nonequivalent associator
Let and be Moufang loops on the same set of order , and define their distance by
Suppose that and have nonequivalent associators. Distance-bound conjecture. Their distance satisfies
This conjecture asks for the minimum distance between Moufang loops with nonequivalent associator; the source gives no evidence of a proof or disproof.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.