The Bergman complex of a matroid and phylogenetic trees

https://doi.org/10.1016/j.jctb.2005.06.004Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural subdivision of the Bergman complex of M is a geometric realization of the order complex of the proper part of its lattice of flats. In addition, we show that the Bergman fan B˜(Kn) of the graphical matroid of the complete graph Kn is homeomorphic to the space of phylogenetic trees Tn×R. This leads to a proof that the link of the origin in Tn is homeomorphic to the order complex of the proper part of the partition lattice Πn.

Keywords

Bergman complex
Greedy algorithm
Lattice of flats
Matroid
Matroid polytope
Phylogenetic tree
Tropical algebraic geometry
Ultrametric
Whitehouse complex

Cited by (0)

1

Present address. Department of Mathematics, University of Washington, Seattle, WA 98195, USA.

2

present address. Department of Mathematics and Computer Science, University of Chicago, Chicago, IL 60637, USA.