How to compute subfields quickly

Andy Novocin - FSU

I will expain an algorithm by Jeurgen Kleuners to find all subfields of a given number field. This algorithm is currently one of the fastest for accomplishing such a task. We will use Galois Theory to reduce the problem into one of finding things called Blocks of Imprimitivity which can be done quickly using combinatorics.

Note: This series of talks fulfills the requirements for the ATE exam.