Back to results

University of Illinois at Urbana-Champaign

Algorithmic and statistical properties of filling elements of a free group, and quantitative residual properties of gamma-limit groups

Abstract

dc:description

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. In higher ranks, we discuss two types of non-filling subgroups: those contained in loop vertex subgroups and those contained in segment vertex subgroups. We construct a combinatorial algorithm to determine whether or not a given finitely generated subgroup is contained in a segment vertex subgroup. We further give a combinatorial algorithm which identifies a certain kind of subgroup contained in a loop vertex subgroup. Finally, we show that the set of filling elements of F(X) is exponentially generic in the sense of Arzhantseva-Ol’shanskii, refining a result of Kapovich and Lustig. Let Γ be a fixed hyperbolic group. The Γ-limit groups of Sela are exactly the finitely generated, fully residually Γ groups. We give a new invariant of Γ-limit groups called Γ-discriminating complexity and show that the Γ-discriminating complexity of any Γ-limit group is asymptotically dominated by a polynomial. Our proof relies on an embedding theorem of Kharlampovich-Myasnikov which states that a Γ-limit group embeds in an iterated extension of centralizers over Γ.The result then follows from our proof that if G is an iterated extension of centralizers over Γ, the G-discriminating complexity of a rank n extension of a cyclic centralizer of G is asymptotically dominated by a polynomial of degree n.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Solie, Brent B.
Contributors dc:contributor
  • Kapovitch, Ilia
  • Leininger, Christopher J.
  • Mineyev, Igor
  • Robinson, Derek J.S.

Subjects

dc:subject × 10

Rights

dc:rights
Statement dc:rights
  • Copyright 2011 Brent B. Solie
Language dc:language
en

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2142/24044
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/24044

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Solie, Brent B.. Algorithmic and statistical properties of filling elements of a free group, and quantitative residual properties of gamma-limit groups. Dissertation thesis, University of Illinois at Urbana-Champaign, 2011. http://hdl.handle.net/2142/24044