Learning objectives
To give a deepening of the argument "Finite fields" beginned in the first year, argument which has applications in the theory of codes, in the finite geometries, in the combinatorics.
Prerequisites
Course of Algebra
Course unit content
<br />Complements on the derivates of the polynomials, multiple roots, splitting fields. Existence and unicity unless isomorphisms of the finite field of order Pn.<br />Subfields of the finite fields. Roots of the irreducible polynomials. Automorphisms. Norms and traces. Cyclotomic polynomials. The function of Möbius in the theory of finite fields. Orders of the polynomials with coifficients in finite field. Algorithm of Berlekamp. Algorithm of Zassenhaus.
Full programme
- - -
Bibliography
M. Girardi, G. Israel 'Teoria dei Campi', Feltrinelli.
Teaching methods
- - -
Assessment methods and criteria
- - -
Other information
- - -