Second algorithm

In this page you may find the Magma code and the results of the algorithm referred to in T. Crespo, M. Salguero, Computation of Hopf Galois structures on separable extensions and classification of those for degree twice an odd prime power, arXiv:1904.05174.

This second algorithm computes all Hopf Galois structures on a separable field extension of degree g up to 31 by implementing Byott's theorem (L.N. Childs, "Taming wild extensions: Hopf algebras and local Galois module theory", AMS 2000, (7.3) Theorem ).

Magma code

Results

Tables