ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let Γ\Gamma be a closed subgroup of Aut⁡(G)\operatorname{Aut}(G) acting transitively on GG, and let w\mathbf{w} be the induced relative weight function. Let ph(G,Γ)p_h(G,\Gamma) be the heavy-cluster threshold and let pu(G)p_u(G) be the uniqueness threshold. Hutchcroft's conjecture. The graph GG is w\mathbf{w}-amenable if and only if

ph(G,Γ)=pu(G).p_h(G,\Gamma)=p_u(G).

This is presented as a generalization of the Benjamini–Schramm conjecture relating amenability to equality of percolation thresholds. Its status is not resolved in the supplied text.

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.