Sufficient conditions and an algorithm for generating Fn are provided, with a construction showing that each Fn (n≥2) has a maximal infinite-index subgroup fixing no point in (0,1) and isomorphic to F_{2n-1}.
Title resolution pending
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the generation problem in Thompson's groups $F_n$
Sufficient conditions and an algorithm for generating Fn are provided, with a construction showing that each Fn (n≥2) has a maximal infinite-index subgroup fixing no point in (0,1) and isomorphic to F_{2n-1}.