Tame combings, almost convexity and rewriting systems for groups (Q1360056)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Tame combings, almost convexity and rewriting systems for groups
scientific article

    Statements

    Tame combings, almost convexity and rewriting systems for groups (English)
    0 references
    0 references
    0 references
    2 November 1997
    0 references
    A finite complete rewriting system for a group is a finite presentation which gives an algorithmic solution to the word problem. Finite complete rewriting systems have proven to be useful objects in geometric group theory, yet little is known about the geometry of groups admitting such rewriting systems. We show that a group \(G\) with a finite complete rewriting system admits a tame 1-combing; it follows (by work of Mihalik and Tschantz) that if \(G\) is an infinite fundamental group of a closed irreducible 3-manifold \(M\), then the universal cover of \(M\) is \(\mathbb{R}^3\). We also establish that a group admitting a geodesic rewriting system is almost convex in the sense of Cannon, and that almost convex groups are tame 1-combable.
    0 references
    finite complete rewriting systems
    0 references
    finite presentations
    0 references
    algorithmic solutions
    0 references
    word problem
    0 references
    geometry of groups
    0 references
    tame 1-combings
    0 references
    fundamental groups
    0 references
    closed irreducible 3-manifolds
    0 references
    universal covers
    0 references
    geodesic rewriting systems
    0 references
    almost convex groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references