3:45PM: The Belyi degree of a curve is computableJohn VoightWe exhibit an algorithm that, given input a curve over a number field, computes as output the minimal degree of a Belyi map from the curve to the projective line. We discuss in detail the example of the Fermat curve of degree four and genus three.

5:00PM: A RiemannHurwitzPlucker FormulaAdrian ZahariucThe classical RiemannHurwitz and Plucker formulas count the number of ramification points of maps from projective curves into other curves and projective spaces respectively, and overlap in the case of maps to the projective line. In this talk, after reviewing these two formulas, I will state a common generalization which applies to maps from curves into arbitrary projective varieties, with ramification defined relative to an arbitrary flat family of divisors on the target. (This is joint work with Brian Osserman.)
