%0 Generic %1 Ardila2004 %A Ardila, Federico %D 2004 %K Ardila Bergman Chepoi Fichet algebra algorithm complex dynamical_system fan geometry graph leave matroid metric parameter phylogenetics point polyhedron solution space tree tropics ultrametric %T Subdominant matroid ultrametrics %U http://arxiv.org/abs/math/0404370 %X Given a matroid M on the ground set E, the Bergman fan B M), or space of M-ultrametrics, is a polyhedral complex in R^E which arises in several different areas, such as tropical algebraic geometry, dynamical systems, and phylogenetics. Motivated by the phylogenetic situation, we study the following problem: Given a point w in R^E, we wish to find an M-ultrametric which is closest to it in the l_infty metric. The solution to this problem follows easily from the existence of the subdominant M-ultrametric: a componentwise maximum M-ultrametric which is componentwise smaller than w. A procedure for computing it is given, which brings together the points of view of matroid theory and tropical geometry. When the matroid in question is the graphical matroid of the complete graph K_n, the Bergman fan B(K_n) parameterizes the equidistant phylogenetic trees with n leaves. In this case, our results provide a conceptual explanation for Chepoi and Fichet's method for computing the tree that most closely matches measured data.

@misc{Ardila2004, abstract = { Given a matroid M on the ground set E, the Bergman fan B M), or space of M-ultrametrics, is a polyhedral complex in R^E which arises in several different areas, such as tropical algebraic geometry, dynamical systems, and phylogenetics. Motivated by the phylogenetic situation, we study the following problem: Given a point w in R^E, we wish to find an M-ultrametric which is closest to it in the l_infty metric. The solution to this problem follows easily from the existence of the subdominant M-ultrametric: a componentwise maximum M-ultrametric which is componentwise smaller than w. A procedure for computing it is given, which brings together the points of view of matroid theory and tropical geometry. When the matroid in question is the graphical matroid of the complete graph K_n, the Bergman fan B(K_n) parameterizes the equidistant phylogenetic trees with n leaves. In this case, our results provide a conceptual explanation for Chepoi and Fichet's method for computing the tree that most closely matches measured data. }, added-at = {2008-12-23T16:00:28.000+0100}, author = {Ardila, Federico}, biburl = {https://www.bibsonomy.org/bibtex/263d0a1ea19813cbc26530be9069d1dda/fwd13}, description = {Subdominant matroid ultrametrics}, interhash = {8f891d259a869f45f81dc53ff506b71e}, intrahash = {63d0a1ea19813cbc26530be9069d1dda}, keywords = {Ardila Bergman Chepoi Fichet algebra algorithm complex dynamical_system fan geometry graph leave matroid metric parameter phylogenetics point polyhedron solution space tree tropics ultrametric}, note = {cite arxiv:math/0404370 Comment: 13 pages, 4 figures}, timestamp = {2008-12-23T19:27:40.000+0100}, title = {Subdominant matroid ultrametrics}, url = {http://arxiv.org/abs/math/0404370}, year = 2004 }