How Associative Can a Non-Associative Moufang Loop Be?
arXiv:2501.02294
Abstract
We prove a non-associative analog to the well-known Theorem. Namely, for a finite Moufang loop with nuclear commutators, we show that if the probability that three randomly chosen elements associate is greater than , then the loop must be a group. The bound is tight as demonstrated by the 16-element Octonion loop.