ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let WnW_n be the symmetric 22-group, and let ww be a word of length 2m2^m. Short-word nontriviality conjecture. If m<nm<n, then

P(w=1)<1in Wn.P(w=1)<1\quad\text{in }W_n.

This conjecture asserts that no word below the natural 2n2^n threshold is identically satisfied by random elements of WnW_n; the paper notes that the condition m<nm<n is sharp because a2na^{2^n} is satisfied by every element of WnW_n. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.