The single-letter characterization of words with trivial fixed-point excess
Statement
Let be the free group on generators , let be the number of fixed points of the word map associated with , and let denote the equivalence relation on words used in the paper. Single-letter characterization conjecture.
if and only if is equivalent under to a single-letter word.
The conjecture identifies precisely the words for which . It is presented as being suggested by simulations; the source gives no general proof or resolution.
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.