ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FrF_r be a free group, and let T=TrT=T_r be the restricted set of Whitehead automorphisms described in the source. For each length ll, let NMinl⊂FrNMin_l\subset F_r be the set of non-minimal elements of length ll, and let NMinl,TNMin_{l,T} be the subset on which Whitehead descent with respect to TT is monotone, meaning that it encounters no local minimum. Generic monotonicity conjecture.

lim⁡m→∞∣NMinl,T∣∣NMinl∣=1,\lim_{m\rightarrow\infty}\frac{|NMin_{l,T}|}{|NMin_l|}=1,

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 rr times WC(w)∣w∣WC(w)|w|. 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 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.