Maximal-chain conjecture for the subgroups of Thompson's group F

From papers

Let F\mathfrak{F} be the partially ordered family of relevant subgroups under embeddability, let ε0\varepsilon_0 be the ordinal used to index the chain, and extend the chain by setting Gε0=FG_{\varepsilon_0}=F. Maximal-chain conjecture.

{Gξξε0}\{G_\xi \mid \xi \leq \varepsilon_0\}

is a maximal chain in F\mathfrak{F}. The conjecture proposes a complete maximal chain of subgroup-complexity representatives indexed through ε0\varepsilon_0; its status is not resolved in the supplied source.

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

Collin Bleak, Matthew G. Brin and Justin Tatch Moore, “Complexity among the finitely generated subgroups of Thompson's group”, arXiv:1711.10998 (2021).

Solutions 0

No solutions have been posted yet.