Enumerating Dihedral Hopf-Galois Structures Acting on Dihedral Extensions

Timothy Kohl

arxiv: 1907.03844 · v1 · pith:ZSZJ5K5Vnew · submitted 2019-07-08 · 🧮 math.GR

Enumerating Dihedral Hopf-Galois Structures Acting on Dihedral Extensions

Timothy Kohl This is my paper

Pith reviewed 2026-05-25 00:32 UTC · model grok-4.3

classification 🧮 math.GR

keywords Hopf-Galois structuresdihedral groupsregular subgroupsnormal block systemsGalois extensionspermutation representationsnormalized subgroups

0 comments

The pith

All dihedral Hopf-Galois structures on dihedral Galois extensions arise from regular subgroups N that are located via the normal block systems of the left regular representation of D_n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how to enumerate every Hopf-Galois structure on a separable extension L/K with Gal(L/K) isomorphic to the dihedral group D_n when the regular subgroup N is also isomorphic to D_n. It does this by examining the normal block systems that appear inside the left regular representation of D_n. A reader would care because the construction gives an explicit list of the corresponding Hopf algebras (L[N])^G rather than an existence proof alone. The method applies uniformly for every n at least 3 and treats every regular permutation group isomorphic to D_n in the same way.

Core claim

For G and N both isomorphic to D_n, the Hopf-Galois structures correspond exactly to the regular subgroups N inside the permutation group B that are normalized by the left regular representation λ(G) and that can be identified using the normal block systems of λ(D_n).

What carries the argument

Normal block systems of the left regular representation of D_n, which partition the underlying set and are preserved by the group action in a way that locates every admissible regular subgroup N.

If this is right

For each fixed n the complete set of normalized regular subgroups N isomorphic to D_n is finite and can be listed by inspecting the block systems.
Each such N determines a distinct Hopf algebra (L[N])^G that gives a Hopf-Galois structure on the dihedral extension L/K.
The same block-system method applies to any other regular embedding of D_n into the symmetric group on the same degree.
The count of Hopf-Galois structures is therefore determined directly from the combinatorics of the block systems rather than from abstract group cohomology.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The technique may extend to other families of groups that possess similarly canonical block systems in their regular representations.
Explicit counts obtained this way could be compared with the total number of Hopf-Galois structures on the same extension to measure how large a fraction the dihedral N cases represent.
The classification supplies concrete examples that could be used to test conjectures about the possible orders of N relative to G in Hopf-Galois theory.

Load-bearing premise

The normal block systems already present in the left regular representation of D_n are enough to locate and classify every regular subgroup N isomorphic to D_n that is normalized by λ(D_n).

What would settle it

Discovery of even one regular subgroup N congruent to D_n that is normalized by λ(D_n) yet does not arise from any normal block system of λ(D_n) would show the enumeration is incomplete.

read the original abstract

The work of Greither and Pareigis details the enumeration of the Hopf-Galois structures (if any) on a given separable field extension. For an extension $L/K$ which is classically Galois with $G=Gal(L/K)$ the Hopf algebras in question are of the form $(L[N])^{G}$ where $N\leq B=Perm(G)$ is a regular subgroup that is normalized by the left regular representation $\lambda(G)\leq B$. We consider the case where both $G$ and $N$ are isomorphic to a dihedral group $D_n$ for any $n\geq 3$. Using the normal block systems inherent to the left regular representation of each $D_n$,(and every other regular permutation group isomorphic to $D_n$) we explicitly enumerate all possible such $N$ which arise.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Kohl gives the first explicit enumeration of dihedral N normalized by lambda(D_n) for dihedral G, using the normal block systems of the regular representation.

read the letter

Kohl's paper works out the dihedral-dihedral case inside the Greither-Pareigis framework for Hopf-Galois structures. It lists the regular subgroups N isomorphic to D_n that are normalized by the left regular copy of D_n inside the symmetric group, and it does so by examining the normal block systems that come with any regular action of D_n. This is new work; prior enumerations had not produced the counts or lists for this specific pair of groups. The method is a direct application of the existing correspondence, but the block-system search turns the abstract condition into something concrete that can be carried out for each n. That is the main positive contribution. The central claim is that every such N arises from these block systems, so the enumeration is complete. The abstract presents this as the way to locate all of them, and the paper presumably supplies the justification that no other normalized regular dihedral subgroups exist outside this construction. If that argument is there and holds, the result is reliable; if the block systems are only a convenient search tool without a proof of exhaustiveness, the list could miss some N. The paper is narrow but the computation is reproducible in principle, so the evidence is the explicit lists themselves. This is for people already working on Hopf-Galois structures or on explicit Galois module problems with small groups. A specialist who needs the dihedral case filled in will get direct value from the counts. It is worth sending to a referee because the claim is a specific, checkable enumeration that extends known methods to a new family, even if the scope stays limited.

Referee Report

2 major / 2 minor

Summary. The paper claims to explicitly enumerate all regular subgroups N ≅ D_n (n ≥ 3) normalized by λ(D_n) in the symmetric group, for use in constructing Hopf-Galois structures on dihedral Galois extensions L/K with Gal(L/K) ≅ D_n, by leveraging the normal block systems of the left regular representation of each such D_n.

Significance. A complete and correct enumeration would furnish an explicit classification of all dihedral Hopf-Galois structures on dihedral extensions, extending the Greither-Pareigis framework to a non-abelian family with concrete, n-dependent lists of admissible N.

major comments (2)

[Abstract] Abstract and opening paragraphs: the claim that the normal block systems of λ(D_n) suffice to locate and classify every regular N ≅ D_n normalized by λ(D_n) is load-bearing, yet the text supplies no separate argument establishing exhaustiveness; without a proof that no other normalized regular dihedral subgroups exist outside this construction, the resulting enumeration may be incomplete.
[§2 or §3] The manuscript must contain an explicit theorem (likely in §2 or §3) proving that every N normalized by λ(D_n) arises from (or is detectable via) the normal block systems of the left regular representation; the current description treats this as a search tool rather than a proven classifier.

minor comments (2)

[Abstract] The abstract would benefit from stating the main enumeration result (e.g., the number or form of admissible N for small n) rather than only describing the method.
Notation for the ambient symmetric group B = Perm(G) and the precise definition of 'normal block system' should be introduced with a reference or short definition on first use.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and for highlighting the need for an explicit proof of exhaustiveness. We address each major comment below and will revise the manuscript to incorporate a dedicated theorem establishing that the normal block systems provide a complete classifier.

read point-by-point responses

Referee: [Abstract] Abstract and opening paragraphs: the claim that the normal block systems of λ(D_n) suffice to locate and classify every regular N ≅ D_n normalized by λ(D_n) is load-bearing, yet the text supplies no separate argument establishing exhaustiveness; without a proof that no other normalized regular dihedral subgroups exist outside this construction, the resulting enumeration may be incomplete.

Authors: We agree that the abstract and introduction present the block-system method as yielding the complete list without a standalone proof of exhaustiveness. In the revised manuscript we will add a short but self-contained argument (new subsection in §2) showing that any regular dihedral N normalized by λ(D_n) must preserve the normal block systems of the regular representation; this follows from the fact that the blocks are the orbits of the unique minimal normal subgroup of D_n and that normalization forces N to map blocks to blocks. The enumeration in later sections will then be presented as exhaustive. revision: yes
Referee: [§2 or §3] The manuscript must contain an explicit theorem (likely in §2 or §3) proving that every N normalized by λ(D_n) arises from (or is detectable via) the normal block systems of the left regular representation; the current description treats this as a search tool rather than a proven classifier.

Authors: We accept the criticism that the current text treats the block systems primarily as a computational device. We will insert an explicit theorem (e.g., Theorem 2.4) in §2 stating: “Let N ≤ Perm(D_n) be regular, N ≅ D_n, and λ(D_n)-normalized. Then N preserves every normal block system of λ(D_n).” The proof will use the imprimitivity of the regular action together with the normality condition in the normalizer. This will reframe the subsequent enumeration as a classification rather than a search. revision: yes

Circularity Check

0 steps flagged

Enumeration via inherent block systems is self-contained combinatorial construction

full rationale

The paper sets up the problem using the Greither-Pareigis framework (external citation) for Hopf-Galois structures as regular N normalized by λ(G) in Perm(G). It then enumerates the dihedral case by direct inspection of the normal block systems that are already present in any regular permutation representation of D_n. This is a standard group-theoretic enumeration over a fixed, independently defined object (the left regular representation and its block systems); no parameter is fitted, no quantity is defined in terms of the output being enumerated, and no self-citation supplies a uniqueness or completeness theorem. The derivation therefore remains self-contained against external combinatorial benchmarks and receives the default non-circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the Greither-Pareigis correspondence and on standard facts about regular permutation representations of dihedral groups; no new entities or fitted constants are introduced.

axioms (1)

standard math Left regular representation of a finite group is regular and its normal block systems are well-defined and computable from the group structure
Invoked to reduce the search for normalized regular subgroups N

pith-pipeline@v0.9.0 · 5662 in / 1134 out tokens · 67334 ms · 2026-05-25T00:32:59.710856+00:00 · methodology

Enumerating Dihedral Hopf-Galois Structures Acting on Dihedral Extensions

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)