Infinite Greedy Reduction of Divisors on Metric Graphs

Details Infinite Greedy Reduction of Divisors on Metric Graphs Infinite Greedy Reduction of Divisors on Metric Graphs

2012-04-16

arxiv.org/abs/1204.3647v1

Mathematics

Combinatorics

12 pages, 6 figures

Scientific paper

We demonstrate that the greedy algorithm for reduction of divisors on metric
graphs need not terminate. We then treat the greedy reduction algorithm as a
transfinite algorithm and analyze its running time via ordinal numbers.
Matching lower and upper bounds on worst case running time of O(\omega^n) are
provided.

Affiliated with

Also associated with

No associations

Rating

Infinite Greedy Reduction of Divisors on Metric Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite Greedy Reduction of Divisors on Metric Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Greedy Reduction of Divisors on Metric Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-288580