ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a finitely generated group, and let (Γi)(\Gamma_i) and (Δi)(\Delta_i) be normal chains in Γ\Gamma with trivial intersection. For a chain (Γi)(\Gamma_i), define the rank gradient by

RG(Γ,(Γi))=lim⁡i→∞d(Γi)−1[Γ:Γi],\mathrm{RG}(\Gamma,(\Gamma_i))=\lim_{i\rightarrow\infty}\frac{d(\Gamma_i)-1}{[\Gamma:\Gamma_i]},

where d(Γi)d(\Gamma_i) is the minimal number of generators of Γi\Gamma_i. Rank-gradient chain-independence conjecture.

RG(Γ,(Γi))=RG(Γ,(Δi)).\mathrm{RG}(\Gamma,(\Gamma_i))=\mathrm{RG}(\Gamma,(\Delta_i)).

The conjecture asks whether rank gradient depends only on the group rather than on the chosen normal chain. It is related to measurable group actions and cost, and the source describes it as an open problem.

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.