The rank-gradient chain-independence conjecture
Statement
Let be a finitely generated group, and let and be normal chains in with trivial intersection. For a chain , define the rank gradient by
where is the minimal number of generators of . Rank-gradient chain-independence conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.