Inaccessible groups and protrees (Q686022): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3994461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessibility and Groups of Cohomological Dimension One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups Acting on Protrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of finitely generated subgroups of free groups and resolutions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On accessibility of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ends of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs and accessibility / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-4049(93)90013-j / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042304439 / rank
 
Normal rank

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Inaccessible groups and protrees
scientific article

    Statements

    Inaccessible groups and protrees (English)
    0 references
    0 references
    9 May 1995
    0 references
    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.
    0 references
    ends of groups
    0 references
    inaccessible groups
    0 references
    inverse limit of trees
    0 references
    partially ordered set
    0 references
    finitely generated inaccessible groups
    0 references
    finite edge stabilizers
    0 references
    \(\mathbb{R}\)-tree
    0 references

    Identifiers