Subexponential growth conjecture for equal-length Whitehead orbit elements
Statement
Let be a free group, and let be a word whose length cannot be reduced by any elementary Whitehead automorphism; in particular, is cyclically reduced. Consider the elements in the automorphic orbit of having the same length as . Subexponential equal-length orbit conjecture. The number of such elements is subexponential in . This conjecture would imply that, for arbitrary rank , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.