One takeaway from the examples above is that computing ranks by hand can be rather time consuming. The Riemann–Roch theorem [1]}, [2]}, [3]}, which shall soon be discussed, allows for a much easier computation of the rank in some cases, or at least a good estimate in others with little effort.
First, we need to introduce a special divisor which exists for every graph.
