Nontriviality conjecture for short words in symmetric two-groups
Statement
Let be the symmetric -group, and let be a word of length . Short-word nontriviality conjecture. If , then
This conjecture asserts that no word below the natural threshold is identically satisfied by random elements of ; the paper notes that the condition is sharp because is satisfied by every element of . No proof is given.
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.