Seminar series
Date
Wed, 02 Nov 2016
11:30
Location
N3.12
Speaker
Adam Jones

The problem of computing the Galois group of an irreducible, rational polynomial has been studied for many years. I will discuss the methods developed over the years to approach this problem, and give some examples of them in practice. These methods mainly involve constructing and factorising resolvent polynomials, and thereby determining better upper bounds for the conjugacy class of the Galois group within the symmetric group, i.e. describe its action on the roots of the polynomial explicitly. I will describe how using approximations to the zeros of the polynomial allows us to construct resolvents, and in particular, how using p-adic approximations can be advantageous over numerical approximations, and how this can yield a direct and systematic method of determining the Galois group.

Please contact us with feedback and comments about this page. Last updated on 03 Apr 2022 01:32.