Inaccessible groups and protrees

\(\mathbb{R}\)-tree ends of groups finite edge stabilizers finitely generated inaccessible groups inaccessible groups inverse limit of trees partially ordered set

Mathematics Subject Classification ID

Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Review text

The author discusses how the theory of ends of groups needs to be modified to accommodate inaccessible groups and graphs. For this purpose it is necessary to introduce the concept of a protree, which can either be thought of as an inverse limit of trees or as a partially ordered set satisfying certain conditions. New examples are given of finitely generated inaccessible groups. In particular examples are given of an inaccessible 2-generator group and of a 1-transitive 4-regular inaccessible graph. Finally, it is shown that if a minimal nice protree \(P\) for a group \(G\) has finite edge stabilizers, then \(P\) has a realization as an \(\mathbb{R}\)-tree on which \(G\) acts by isometries.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Inaccessible groups and protrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686022)