An algorithm to determine Hopf Galois structures

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…