BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260314T052857EDT-3401JwFdug@132.216.98.100
DTSTAMP:20260314T092857Z
DESCRIPTION:Title:  Enumerating Orders in Number Fields\n	 \n	Abstract: For a
  given number field K we study the distribution of suborders of the maxima
 l order O_K of K. The Chinese Remainder Theorem shows that it suffices to 
 describe the orders whose index in O_K is a power of p for some prime p.\n
 \nZassenhaus' well-known Round 2 algorithm yields an effective method to c
 ompute the p-maximal order of a given order in K. We show how to reverse t
 his process to enumerate the orders of a given prime power index in O_K.\n
 \nOn the one hand\, we get an algorithm which is implemented in the comput
 er algebra system OSCAR. On the other hand\, our approach highlights struc
 tures which allow us to describe the distribution of suborders whose index
  is a prime power in an explicit way. This is joint work with Markus Kirsc
 hmer.\n\nLocation: University of Montreal AA-6214\n
DTSTART:20260312T180000Z
DTEND:20260312T193000Z
SUMMARY:Jürgen Klüners (Universität Paderborn)
URL:/mathstat/channels/event/jurgen-kluners-universita
 t-paderborn-371864
END:VEVENT
END:VCALENDAR