Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"filling subgroup"”.
-
Algorithmic and statistical properties of filling elements of a free group, and quantitative residual properties of gamma-limit groups
A filling subgroup of a finitely generated free group F(X) is a subgroup which does not fix a point in any very small action free action on an R-tree. For the free group of rank two, we construct a combinatorial algorithm to determine whether or not a given finitely generated subgroup is filling. …