Generic monotonicity conjecture for restricted Whitehead descent
Statement
Let be a free group, and let be the restricted set of Whitehead automorphisms described in the source. For each length , let be the set of non-minimal elements of length , and let be the subset on which Whitehead descent with respect to is monotone, meaning that it encounters no local minimum. Generic monotonicity conjecture.
with exponentially fast convergence. This conjecture would imply that, on most non-minimal inputs, restricted Whitehead descent has a complexity bounded by a polynomial factor in times . The source gives no resolution status.
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.