Das Seminar findet Dienstag, 14-16 Uhr, statt.

14.5.: Jakob Kröker, Hannover, Algorithmic construction of Hurwitz maps

Joint project with Laurent Bartholdi, Hans-Christian von Bothmer, Xavier Buff.

Heuristic algorithms over finite fields together with number theory methods, algorithm optimization and parallelization techniques can be used to solve moderate polynomial systems and applied e.g. for complex approximation of sphere coverings: Given a fixed set Q of branch values and a k-tuple of permutations representing the monodromy of a sphere covering degree-d rational map, compute an arbitraryly precise floating point complex approximation of that map.

The computation was used to construct an approximation of Cui's "Sierpinski map", a rational map whose Julia set is a Sierpinski carpet.

21.5. Stefan Wewers, Der Modulraum der Kurven vom Geschlecht g

28.5. Julian Rüth, A construction for absolute values in polynomial rings

04.06. Irene Bouw, Modellen von Modulkurven.

           Das Oberseminar findet aussnahmsweise in O29, LGM 2002 statt.

11.06. Michael Eskin, 3-Punkt-Überlagerungen mit schlechter Reduktion.