Non-amenability conjecture for product replacement graphs of the Grigorchuk group
Statement
Let be the Grigorchuk group. The Grigorchuk non-amenability conjecture asserts that the product replacement graphs are non-amenable for all . This is a special case of the broader non-amenability conjecture and is stated as an independent problem because the paper's methods do not establish it. The source gives no resolution, so the conjecture remains open.
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.