An algorithm to determine Hopf Galois structures

Publication date 1 April 2017

Separable extensions, Galois theory (12F10) General theory for finite permutation groups (20B05) Hopf algebras and their applications (16T05) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Abstract: A Hopf Galois structure on a finite field extension L/K is given by a finite cocommutative K-Hopf algebra and a Hopf action. In this paper we present an algorithm written in the computational algebra system Magma which gives all Hopf Galois structures on separable field extensions of a given degree and several properties of those. We describe the results obtained for extensions of degree up to 11. Besides, we prove that separable extensions of degree equal to the square of an odd prime have at most one type of Hopf Galois structures.

This page was built for publication: An algorithm to determine Hopf Galois structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285061)