Enumeration of geometric Weierstrass points of metric graphs
Abstract
A classical result states that on a smooth algebraic curve of genus g the number of Weierstrass points, counted with multiplicity, is g3-g. In this paper, we introduce the notion of geometric Weierstrass points of metric graphs and show that a generic metric graph of genus g has g3-g geometric Weierstrass points counted with multiplicity. Our methods also provide a new proof of the existence of Weierstrass points on metric graphs of genus bigger than or equal to 2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.