English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

A finite complete rewriting system for a group is a finite presenta- tion 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 R3. 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.

Tame combings, almost convexity and rewriting systems for groups