If a word in the free group on two letters is a law for S_n when every pair of permutations evaluates to the identity, how short can a nontrivial such law be?
Statement
If a word in the free group on two letters is a law for S_n when every pair of permutations evaluates to the identity, how short can a nontrivial such law be?
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.