217,005 research outputs found

    Distances on the tropical line determined by two points

    Get PDF
    Let p,qRnp',q'\in R^n. Write pqp'\sim q' if pqp'-q' is a multiple of (1,,1)(1,\ldots,1). Two different points pp and qq in Rn/R^n/\sim uniquely determine a tropical line L(p,q)L(p,q), passing through them, and stable under small perturbations. This line is a balanced unrooted semi--labeled tree on nn leaves. It is also a metric graph. If some representatives pp' and qq' of pp and qq are the first and second columns of some real normal idempotent order nn matrix AA, we prove that the tree L(p,q)L(p,q) is described by a matrix FF, easily obtained from AA. We also prove that L(p,q)L(p,q) is caterpillar. We prove that every vertex in L(p,q)L(p,q) belongs to the tropical linear segment joining pp and qq. A vertex, denoted pqpq, closest (w.r.t tropical distance) to pp exists in L(p,q)L(p,q). Same for qq. The distances between pairs of adjacent vertices in L(p,q)L(p,q) and the distances \dd(p,pq), \dd(qp,q) and \dd(p,q) are certain entries of the matrix F|F|. In addition, if pp and qq are generic, then the tree L(p,q)L(p,q) is trivalent. The entries of FF are differences (i.e., sum of principal diagonal minus sum of secondary diagonal) of order 2 minors of the first two columns of AA.Comment: New corrected version. 31 pages and 9 figures. The main result is theorem 13. This is a generalization of theorem 7 to arbitrary n. Theorem 7 was obtained with A. Jim\'enez; see Arxiv 1205.416
    corecore