Infinite reduction of divisors on metric graphs

From MaRDI portal
Publication:2509736



Abstract: We demonstrate that the greedy algorithm for reduction of divisors on metric graphs need not terminate by modeling the Euclidean algorithm in this context. We observe that any infinite reduction has a well defined limit allowing us to treat the greedy reduction algorithm as a transfinite algorithm and to analyze its running time via ordinal numbers. We provide lower and upper bounds which establish a worst case running time of omegaTheta(mdeg(D)).












This page was built for publication: Infinite reduction of divisors on metric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509736)