ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FrF_r be a free group, and let w∈Frw\in F_r be a word whose length cannot be reduced by any elementary Whitehead automorphism; in particular, ww is cyclically reduced. Consider the elements in the automorphic orbit of ww having the same length as ww. Subexponential equal-length orbit conjecture. The number of such elements is subexponential in ∣w∣|w|. This conjecture would imply that, for arbitrary rank r>2r>2, the average-case time complexity of the Whitehead algorithm is linear, extending the known rank-two result. The paper describes the required orbit-growth estimate as an open problem.

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.