Power-word extremality conjecture in symmetric two-groups
Statement
Let be the symmetric -group, let denote a generator, and let be a word of length . Power-word extremality conjecture.
The conjecture says that among words of a fixed length , the power word is the easiest to satisfy. It is presented as a strengthening of the preceding nontriviality conjecture and is left unresolved.
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.