Both number theory and geometry have a lot of common algorithmic tasks,
albeit hidden behind different languanges. For example, while
geometers compute normalizations, number theorists are interested in
integral closures or maximal orders (if they come from representation
theory). As diverse as the languages are the techniques that are traditionally
applied—although recently the algorithms seem to converge.
In this workshop we aim to bring together experts in (algebraic) geometry and algorithmic number theory in order to faciliate a strong exchange of ideas. In particular, techniques employed in the computation of normalization or integral closures as well as ideal(class) and divisor(class) methods will be discussed.
The workshop is to be held at Technische Universität Kaiserslautern, Germany.
You will (soon) find a poster for the workshop here.
For registration please contact Claus Fieker at firstname.lastname@example.org.
The workshop gratefully acknowledges support from DFG Priority programme 1489 “Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory”.