The graph-product conjecture for weakly sofic groups
The graph-product conjecture for weakly sofic groups
Let be a set and let be a family of weakly sofic groups. For a graph , write
The graph-product conjecture. The free product is weakly sofic, and, more generally, is weakly sofic for every graph on .
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.
Sources & referencesView supporting material
Primary source
Vadim Alekseev and Henry Bradford, “Sofic actions, halo products, and metric approximations of groups”, arXiv:2601.18742 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.