Generalization of the alternating-word lemmas
Statement
Let be a word in the free group on two generators, and let be the automorphisms and the graph-vertex notation defined in the surrounding lemmas. The preceding lemmas establish relations among under the additional assumption that is alternating. Generalization of the alternating-word lemmas. Lemmas 1, 2, and 3 remain true after removing the requirement that be alternating. The paper presents this as an experimentally suggested generalization without a proof, so its resolution is not established here.
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.