Stackable groups, tame filling invariants, and algorithmic properties of groups

Details Stackable groups, tame filling invariants, and algorithmic properties of groups Stackable groups, tame filling invariants, and algorithmic properties of groups

2011-09-28

arxiv.org/abs/1109.6309v2

Mathematics

Group Theory

11 figures; added material on regularly stackable groups

Scientific paper

We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define algorithmically stackable groups, for which this procedure is an effective algorithm. This property gives a common model for algorithms arising from both rewriting systems and almost convexity for groups. We also introduce a new pair of asymptotic invariants that are filling inequalities refining the notions of intrinsic and extrinsic diameter inequalities for finitely presented groups. These tame filling inequalities are quasi-isometry invariants, up to Lipschitz equivalence of functions (and, in the case of the intrinsic tame filling inequality, up to choice of a sufficiently large set of defining relators). We show that radial tameness functions are equivalent to the extrinsic tame filling inequality condition, and so intrinsic tame filling inequalities can be viewed as the intrinsic analog of radial tameness functions. We discuss both intrinsic and extrinsic tame filling inequalities for many examples of stackable groups, including groups with a finite complete rewriting system, Thompson's group F, Baumslag-Solitar groups and their iterates, and almost convex groups. We show that the fundamental group of any closed 3-manifold with a uniform geometry is algorithmically stackable using a regular language of normal forms.

Affiliated with

Also associated with

No associations

Rating

Stackable groups, tame filling invariants, and algorithmic properties of groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stackable groups, tame filling invariants, and algorithmic properties of groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stackable groups, tame filling invariants, and algorithmic properties of groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44559