The graph-product conjecture for weakly sofic groups

Less than 1 year old · traced to

Let VV be a set and let {Γv:v∈V}\lbrace \Gamma_v: v \in V \rbrace be a family of weakly sofic groups. For a graph X=(V,E)X=(V,E), write

GX=(∗v∈VΓv)/≪h−1k−1hk:(v,w)∈E, h∈Γv, k∈Γw≫.G_X=\left(\ast_{v\in V}\Gamma_v\right)/\ll h^{-1}k^{-1}hk:(v,w)\in E,\ h\in\Gamma_v,\ k\in\Gamma_w\gg.

The graph-product conjecture. The free product ∗v∈VΓv\ast_{v\in V}\Gamma_v is weakly sofic, and, more generally, GXG_X is weakly sofic for every graph X=(V,E)X=(V,E) on VV.

The source says that direct sums of weakly sofic groups are known to be weakly sofic, whereas the corresponding question for other graph products, including free products, appears to be open.

References

Primary source

Vadim Alekseev and Henry Bradford, “Sofic actions, halo products, and metric approximations of groups”, arXiv:2601.18742 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.