ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let w0w_0 be a word in the free group on two generators, and let ϕ1,ϕ2,ϕ3,ϕ4\phi_1,\phi_2,\phi_3,\phi_4 be the automorphisms and [ ⋅ ][\,\cdot\,] the graph-vertex notation defined in the surrounding lemmas. The preceding lemmas establish relations among [ϕi(w0)][\phi_i(w_0)] under the additional assumption that w0w_0 is alternating. Generalization of the alternating-word lemmas. Lemmas 1, 2, and 3 remain true after removing the requirement that w0w_0 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 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.