Graphs and separability properties of groups (Q1355505)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Graphs and separability properties of groups
scientific article

    Statements

    Graphs and separability properties of groups (English)
    0 references
    0 references
    26 June 1997
    0 references
    The author starts the study of separability properties of groups by using graph methods. A group \(G\) is called LERF (locally extended residually finite) if for any finitely generated subgroup \(S\) of \(G\) and any element \(g\in G\) not in \(S\), there exists a subgroup \(S_0\) of finite index in \(G\) containing \(S\) but not \(g\). The main result of the paper is that a free product of a free group and a LERF group amalgamated over a cyclic subgroup maximal in the free factor is LERF. She also gives short proofs of some old results including the theorem that a free product of free groups, amalgamated over a cyclic subgroup, is LERF. The method is by transferring to properties of a Cayley graph of a presentation and a relative Cayley graph with respect to a subgroup and then by using the notions of a cover of the graph \(G\) and \(G\)-based graphs.
    0 references
    locally extended residually finite groups
    0 references
    subgroups of finite index
    0 references
    separability properties
    0 references
    finitely generated subgroups
    0 references
    LERF groups
    0 references
    free products of free groups
    0 references
    Cayley graphs
    0 references
    presentations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references