Papers
Topics
Authors
Recent
Search
2000 character limit reached

Riemann-Roch for Sub-Lattices of the Root Lattice $A_n$

Published 15 Jul 2010 in math.CO | (1007.2454v1)

Abstract: Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general Riemann-Roch Theory for sub-lattices of the root lattice $A_n$ by following the work of Baker and Norine, and establish connections between the Riemann-Roch theory and the Voronoi diagrams of lattices under certain simplicial distance functions. In this way, we rediscover the work of Baker and Norine from a geometric point of view and generalise their results to other sub-lattices of $A_n$. In particular, we provide a geometric approach for the study of the Laplacian of graphs. We also discuss some problems on classification of lattices with a Riemann-Roch formula as well as some related algorithmic issues.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.