The free-factor complex, recursive corank-one links, and a dynamical transfer test
Statement
Problem 1.1. Construct a δ-hyperbolic graph on which Out (Fn) acts so that: (1) Every iwip γ has positive translation distance ( |γ| > 0)(2) Polynomially growing γ are elliptic ( |γ| = 0)(3) The construction is elegant/beautiful/useful/truthful (4) Local structure allows for inductive arguments (5) The graph is highly connected (with highly connected links)
Record
- Source
- Added
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.