Enumerative combinatorics
The design and analysis of algorithms
The design and analysis of algorithms
Shellability of complexes of trees
Journal of Combinatorial Theory Series A
Homotopy of Non-Modular Partitions and the Whitehouse Module
Journal of Algebraic Combinatorics: An International Journal
Regular Article: Geometry of the Space of Phylogenetic Trees
Advances in Applied Mathematics
Journal of Symbolic Computation
Nested set complexes of Dowling lattices and complexes of Dowling trees
Journal of Algebraic Combinatorics: An International Journal
Flag enumerations of matroid base polytopes
Journal of Combinatorial Theory Series A
Isotropical linear spaces and valuated Delta-matroids
Journal of Combinatorial Theory Series A
Computing Geodesic Distances in Tree Space
SIAM Journal on Discrete Mathematics
Computing tropical linear spaces
Journal of Symbolic Computation
a-tint: A polymake extension for algorithmic tropical intersection theory
European Journal of Combinatorics
Hi-index | 0.00 |
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.