Maximal-chain conjecture for the subgroups of Thompson's group F
Let be the partially ordered family of relevant subgroups under embeddability, let be the ordinal used to index the chain, and extend the chain by setting . Maximal-chain conjecture.
is a maximal chain in . The conjecture proposes a complete maximal chain of subgroup-complexity representatives indexed through ; its status is not resolved in the supplied source.
References
Primary source
Collin Bleak, Matthew G. Brin and Justin Tatch Moore, “Complexity among the finitely generated subgroups of Thompson's group”, arXiv:1711.10998 (2021).
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.