A polynomial bound for multiplication groups of Moufang loops

From papers

Let nn be the order of a Moufang loop, and let Mlt(L)\operatorname{Mlt}(L) denote its multiplication group. Polynomial-bound conjecture. The function

f(n)=4n4f(n)=4n^4

solves the problem of finding a function f:NNf:\mathbb N\to\mathbb N such that the order of the multiplication group of every Moufang loop of order nn is less than f(n)f(n). The proposed bound is motivated by the finite Paige loops M(q)M^*(q), for which the source derives Mlt(M(q))<4M(q)4|\operatorname{Mlt}(M^*(q))|<4|M^*(q)|^4; the source does not state whether this claim has been resolved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Gábor P. Nagy and Petr Vojtěchovský, “Octonions, simple Moufang loops and triality”, arXiv:math/0701707 (2007).

Solutions 0

No solutions have been posted yet.