ProbXiv
Explorersign in
Problem archiveProblem record

Statement

(Conjugator length bounds). Prove that there exist constants C,K, depend- ing only on S, so that if u,v ∈ Modg are conjugate, then there exists g ∈ Modg with||g||≤ K max{||u||,||v||} +C so that u =gvg −1. Masur-Minsky ([ MM2], Theorem 7.2) solved this problem in the case where u and v are pseudo-Anosov; their method of hierarchies seems quite applicable to solving Problem 3.2 in the general case. While interesting in its own right, even the solution to Problem 3.2 would not answer the following basic problem.

Record

Added
Links

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.