Text only print
Full screen print
Seminar on Geometric Complex Analysis
Seminar information archive ～04/23｜Next seminar｜Future seminars 04/24～
| Date, time & place | Monday 10:30 - 12:00 128Room #128 (Graduate School of Math. Sci. Bldg.) |
|---|---|
| Organizer(s) | Kengo Hirachi, Shigeharu Takayama |
2019/07/08
10:30-12:00 Room #128 (Graduate School of Math. Sci. Bldg.)
Hiroshi Kaneko (Tokyo University of Science)
A Riemann-Roch theorem on a weighted infinite graph (Japanese)
Hiroshi Kaneko (Tokyo University of Science)
A Riemann-Roch theorem on a weighted infinite graph (Japanese)
[ Abstract ]
A Riemann-Roch theorem on a connected finite graph was initiated by M. Baker and S. Norine, where connected graph with finite vertices was investigated and unit weight was given on each edge and vertex of the graph. Since a counterpart of the lowest exponents of the complex variable in the Laurent series was proposed as divisor for the Riemann-Roch theorem on graph, its relationships with tropical geometry were highlighted earlier than other complex analytical observations on graphs. On the other hand, M. Baker and F. Shokrieh revealed tight relationships between chip-firing games and potential theory on graphs, by characterizing reduced divisors on graphs as the solution to an energy minimization problem. The objective of this talk is to establish a Riemann-Roch theorem on an edge-weighted infinite graph. We introduce vertex weight assigned by the given weights of adjacent edges other than the units for expression of divisors and assume finiteness of total mass of graph. This is a joint work with A. Atsuji.
A Riemann-Roch theorem on a connected finite graph was initiated by M. Baker and S. Norine, where connected graph with finite vertices was investigated and unit weight was given on each edge and vertex of the graph. Since a counterpart of the lowest exponents of the complex variable in the Laurent series was proposed as divisor for the Riemann-Roch theorem on graph, its relationships with tropical geometry were highlighted earlier than other complex analytical observations on graphs. On the other hand, M. Baker and F. Shokrieh revealed tight relationships between chip-firing games and potential theory on graphs, by characterizing reduced divisors on graphs as the solution to an energy minimization problem. The objective of this talk is to establish a Riemann-Roch theorem on an edge-weighted infinite graph. We introduce vertex weight assigned by the given weights of adjacent edges other than the units for expression of divisors and assume finiteness of total mass of graph. This is a joint work with A. Atsuji.
