Computing Linear Systems on Metric Graphs
主 题: Computing Linear Systems on Metric Graphs
报告人: Bo Lin (U C Bekeley)
时 间: 2016-05-05 10:00-11:00
地 点: Rm 1493, No 1 Sci Bldg (理科一号楼1493)
The linear system $|D|$ of a divisor $D$ on a metric graph has the structure of a cell complex. We introduce the anchor divisors and anchor cells in it - they serve as the landmarks for us to compute the f-vector of the complex and find all cells in the complex. A linear system can also be identified as a tropical convex hull of rational functions. We compute its extremal generators using the landmarks. We apply these methods to some examples - namely the canonical linear systems on $K_{4}$ and $K_{3,3}$.
