Concept# Galois group

Summary

In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois who first discovered them.
For a more elementary discussion of Galois groups in terms of permutation groups, see the article on Galois theory.
Definition
Suppose that E is an extension of the field F (written as E/F and read "E over F "). An automorphism of E/F is defined to be an automorphism of E that fixes F pointwise. In other words, an automorphism of E/F is an isomorphism \alpha:E\to E such that \alpha(x) = x for each x\in F. The set of all automorphisms of E/F forms a

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related people

Related publications (10)

No results

Related units

No results

Loading

Loading

Loading

Let $F/E$ be a finite Galois extension of fields with abelian Galois group $\Gamma$. A self-dual normal basis for $F/E$ is a normal basis with the additional property that $Tr_{F/E}(g(x),h(x))=\delta_{g,h}$ for $g,h\in\Gamma$. Bayer-Fluckiger and Lenstra have shown that when $char(E)\neq 2$, then $F$ admits a self-dual normal basis if and only if $[F:E]$ is odd. If $F/E$ is an extension of finite fields and $char(E)=2$, then $F$ admits a self-dual normal basis if and only if the exponent of $\Gamma$ is not divisible by $4$. In this paper we construct self-dual normal basis generators for finite extensions of finite fields whenever they exist. Now let $K$ be a finite extension of $\Q_p$, let $L/K$ be a finite abelian Galois extension of odd degree and let $\bo_L$ be the valuation ring of $L$. We define $A_{L/K}$ to be the unique fractional $\bo_L$-ideal with square equal to the inverse different of $L/K$. It is known that a self-dual integral normal basis exists for $A_{L/K}$ if and only if $L/K$ is weakly ramified. Assuming $p\neq 2$, we construct such bases whenever they exist.

2010In this paper we study an asymptotically optimal tame tower over the field with p(2) elements introduced by Garcia-Stichtenoth. This tower is related with a modular tower, for which explicit equations were given by Elkies. We use this relation to investigate its Galois closure. Along the way, we obtain information about the structure of the Galois closure of X-0(p(n)) over X-0(p(r)), for integers 1 < r < n and prime p and the Galois closure of other modular towers (X-0(p(n)))n.

Related concepts (58)

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus

In mathematics, a group is a non-empty set with an operation that satisfies the following constraints: the operation is associative, has an identity element, and every element of the set has an inver

In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ring is a set equipped wit

Related courses (6)

P-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applications, notably we will prove rationality of the Weil Zeta function.

The goal of the course is to introduce basic notions from public key cryptography (PKC) as well as basic number-theoretic methods and algorithms for cryptanalysis of protocols and schemes based on PKC.

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented.

Related lectures (25)