Subgroups of free groups: a contribution to the Hanna Neumann conjecture (Q1855279): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q244485 / rank
Normal rank
 
Property / author
 
Property / author: Pascal Weil / rank
Normal rank
 
Property / author
 
Property / author: John C. Meakin / rank
 
Normal rank
Property / author
 
Property / author: Pascal Weil / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1020900823482 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1482741147 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Subgroups of free groups: a contribution to the Hanna Neumann conjecture
scientific article

    Statements

    Subgroups of free groups: a contribution to the Hanna Neumann conjecture (English)
    0 references
    4 February 2003
    0 references
    The Strengthened Hanna Neumann Conjecture as formulated by \textit{W. D. Neumann} [in Lect. Notes Math. 1456, 161-170 (1990; Zbl 0722.20016)] is treated here with graph theoretic tools and proven to hold for a large class of groups characterized by geometric properties. As one of the applications of their methods the authors provide a proof that the Strengthened Hanna Neumann Conjecture holds for positively generated subgroups of a free group generated by a finite alphabet. An alternate proof for the result on positively generated subgroups was given by \textit{B. Khan} [in Contemp. Math. 296, 155-170 (2002; Zbl 1013.20018)].
    0 references
    free groups
    0 references
    finitely generated subgroups
    0 references
    basic paths
    0 references
    admissible graphs
    0 references
    0 references
    0 references

    Identifiers

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