A polynomial bound for multiplication groups of Moufang loops
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.