Guba–Sapir closure conjecture for diagram groups
Let be a directed -complex, let be a -path, and let be a subgroup of the diagram group . A subgroup is closed for components if, whenever it contains a diagram, it contains all components of that diagram. The closure is the subgroup generated by all diagrams accepted by the closure construction from . Guba–Sapir's conjecture. The closure is the minimal subgroup of which contains and is closed for components. The conjecture is known in some special cases, but remains open for general diagram groups.
References
Primary source
Gili Golan, “The generation problem in Thompson group F”, arXiv:1608.02572 (2021).
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
No solutions have been posted yet.