A polynomial bound for multiplication groups of Moufang loops
Let be the order of a Moufang loop, and let denote its multiplication group. Polynomial-bound conjecture. The function
solves the problem of finding a function such that the order of the multiplication group of every Moufang loop of order is less than . The proposed bound is motivated by the finite Paige loops , for which the source derives ; the source does not state whether this claim has been resolved.
References
Primary source
Gábor P. Nagy and Petr Vojtěchovský, “Octonions, simple Moufang loops and triality”, arXiv:math/0701707 (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.