ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Theorem 2 above has applications to the study of profinite rigidity. Since the abelianizations of all finite-index subgroups of a given group are a profinite in- variant of that group, the theorem implies that free products of free and surface groups are profinitely rigid among hyperbolic graphs of free groups with cyclic edges. This solves additional cases of the following long-standing conjecture: Wilton proved that if G is a non-free hyperbolic group which splits as a graph of free groups with Z edges, then G has a surface subgroup [6]. The assumption that G is not free can be translated into an assumption on the complexity of links in the geometric realization of a graph of spaces XG with \pi1 (XG ) = G (a graph of graphs whose edge spaces are cylinders). The links corresponding to a group G as in Theorem 2 are even more complicated, which allows us to construct maps from more complicated 2-complexes into XG . In particular, we construct a branched surface B and a homomorphism f : \pi1 (B) \to G such that for every finite abelian group A, the map f∗ : (\pi1 (BA ))ab = A ⊕ A′ \to Gab is injective on A. Using virtual retractions, we obtain a finite-index subgroup G′ \leq G such that A is a direct factor of (G′ )ab . Conjecture 4. Let F be a non-abelian free group of rank n and let w \in F . For every finite group G, w induces a word map w : Gn \to G and a word measure −1 given by Pw (A \subset G) = |w|G|(A)| n . If two words w, w′ \in F induce the same word measure on every finite group, then there exists f \in Aut(F ) such that f (w) = w′ .

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.