The Bergman complex of a matroid and phylogenetic trees (Q2581498): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2005.06.004 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2005.06.004 / rank
 
Normal rank

Latest revision as of 08:46, 19 December 2024

scientific article
Language Label Description Also known as
English
The Bergman complex of a matroid and phylogenetic trees
scientific article

    Statements

    The Bergman complex of a matroid and phylogenetic trees (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    The Bergman complex \({\mathcal B}(M)\) of a matroid \(M\) is a polyhedral complex which arises in algebraic geometry, but which the authors describe purely combinatorially. The main result of this paper is that, appropriately subdivided, the Bergman complex of a matroid \(M\) is the order complex of the proper part of the lattice of flats \(L_M\) of the matroid. As a corollary, the authors have the Bergman complex \({\mathcal B}(M)\) is homotopy equivalent to a wedge of \((r-2)\)-dimensional spheres, where \(r\) is the rank of \(M\). The authors show the Bergman fan \(\widetilde {\mathcal B}(K_n)\) of the graphical matroid of the complete graph \(K_n\) is homeomorphic to the space of phylogenetic trees \({\mathcal T}_n \times R\). As a corollary, the authors have that the order complex of the proper part of the partition lattice \(\Pi_n\) is a subdivision of the link of the origin in the coarse subdivision of \({\mathcal T}_n\).
    0 references
    greedy algorithm
    0 references
    lattice of flats
    0 references
    matroid polytope
    0 references
    tropical algebraic geometry
    0 references
    ultrametric
    0 references
    Whitehouse complex
    0 references

    Identifiers