Generating-set invariance conjecture for forcing properties

From papers

Let Γ\Gamma be a finitely generated, residually finite group, and let SiS_i for i=1,2i=1,2 be finite generating sets with IdSi\operatorname{Id}\notin S_i and Si1=SiS_i^{-1}=S_i. Set

Fi=Cay(Γ,Si).F_i=\operatorname{Cay}(\Gamma,S_i).

Let PP be one of the properties of being connectivity-forcing, being expansion-forcing, or forcing a giant component. Generating-set invariance conjecture. The pair (F1,r)(F_1,r) has property PP for all sufficiently large rr if and only if (F2,r)(F_2,r) has property PP for all sufficiently large rr. This predicts that, for residually finite groups, each of the three forcing properties is independent of the chosen finite symmetric generating set once the radius is sufficiently large.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Itai Benjamini and David Ellis, “On the structure of random graphs with constant r-balls”, arXiv:1802.02002 (2020).

Solutions 0

No solutions have been posted yet.