Subgroup Perfect Codes in Cayley Graphs

• Subgroup perfect codes are subgroups of finite groups that serve as perfect codes in Cayley graphs, ensuring every vertex outside the subgroup is uniquely adjacent to one subgroup element.
• The local complement criterion and Diamond Lemma provide a structural framework to determine when a subgroup can function as an efficient dominating set.
• Methods adapted from circulant graph domination are used to classify maximal subgroup perfect codes, offering actionable insights for both theoretical study and algorithmic detection.

A subgroup perfect code is a subgroup of a finite group that serves as a perfect code (efficient dominating set) in some Cayley graph of the group. The study of subgroup perfect codes in Cayley graphs connects group theory, combinatorics, and the structural theory of error-correcting codes. Recent research has emphasized necessary and sufficient conditions for maximal subgroups of a finite group to act as perfect codes, structural reduction techniques, and methods for explicit construction or classification across broad group families.

1. Formal Framework and Definitions

A perfect code in a graph $\Gamma = (V, E)$ is a set $C \subseteq V$ such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$, and no two vertices in $C$ are adjacent. In the setting of group theory, if $\Gamma$ is the Cayley graph $\mathrm{Cay}(G, S)$ of a finite group $G$ with inverse-closed connection set $S \subseteq G \setminus \{1\}$, a subgroup $H$ of $C \subseteq V$0 is a subgroup perfect code if there exists $C \subseteq V$1 making $C \subseteq V$2 a perfect code in $C \subseteq V$3. The emphasis on maximal subgroups $C \subseteq V$4 interrogates which group–subgroup pairs admit this combinatorial tiling structure (Qiao et al., 31 Jul 2025).

The essential algebraic–combinatorial link is the existence of an inverse-closed left transversal $C \subseteq V$5 for $C \subseteq V$6, ensuring every group element can be written uniquely as $C \subseteq V$7 with $C \subseteq V$8, $C \subseteq V$9. This is equivalent, in most group types, to finding “local complements” for $V \setminus C$0 within certain overgroups and to the presence of specific semidirect product decompositions detailed below (Chen et al., 2019, Zhang et al., 2020).

2. Local Complementation and the Main Criterion

A central structural result characterizes when a $V \setminus C$1-subgroup $V \setminus C$2 of a finite group $V \setminus C$3 is a perfect code via the local structure in the normalizer $V \setminus C$4 (Qiao et al., 31 Jul 2025). The necessary and sufficient condition is as follows:

Local Complement Criterion:

Let $V \setminus C$5 be a $V \setminus C$6-subgroup of $V \setminus C$7. Then $V \setminus C$8 is a perfect code of $V \setminus C$9 if and only if for every $C$0 with $C$1, the subgroup $C$2 splits as the semidirect product $C$3—that is, $C$4 has a complement of order $C$5 in $C$6. This guarantees an inverse-closed left transversal exists.

This criterion generalizes to arbitrary maximal subgroups $C$7 when the Sylow $C$8-subgroup case is used as a reduction (Qiao et al., 31 Jul 2025, Zhang, 2022). The semidirect product requirement encodes the capacity to “resolve” possible obstructions arising from involutive elements outside $C$9 whose squares land inside $C$0.

3. The Diamond Lemma and Reduction Techniques

A principal structural tool is the "Diamond Lemma" (Qiao et al., 31 Jul 2025), a two-layer result analogous to lattice theory transitivity, formalized as follows. Suppose $C$1 has subgroups $C$2 such that $C$3 is a perfect code in $C$4. Then $C$5 is a perfect code in $C$6. If the $C$7-parts of $C$8 and $C$9 coincide, the converse holds.

This lemma enables the "lifting" of perfect code properties from subgroups and quotient groups, thereby constructing maximal subgroup perfect codes from corresponding subgroups in normal sections or index subgroups. In particular, Theorem 4.5 in (Qiao et al., 31 Jul 2025) shows that for any group extension $\Gamma$0, a maximal subgroup $\Gamma$1 with $\Gamma$2 is a perfect code in $\Gamma$3 if and only if its image in $\Gamma$4 is a perfect code.

Such reduction strategies are instrumental in classifying perfect codes among maximal subgroups in the O'Nan–Scott types: holomorphs of abelian groups (HA), HS, HC, TW, SD, CD, and almost simple (AS) types (Qiao et al., 31 Jul 2025).

4. Primitive and Almost Simple Groups: Classification of Maximal Subgroup Perfect Codes

For several primitive group types, every point-stabilizer is proved to be a perfect code via the existence of regular or transitive normal subgroups and the Diamond Lemma (Qiao et al., 31 Jul 2025). In almost simple groups (particularly those with socle $\Gamma$5 or $\Gamma$6), a more nuanced analysis is essential.

For $\Gamma$7, the main exceptions occur for large $\Gamma$8 in the dihedral-type maximal subgroups:

• For $\Gamma$9, $\mathrm{Cay}(G, S)$0 and $\mathrm{Cay}(G, S)$1, or
• For $\mathrm{Cay}(G, S)$2, $\mathrm{Cay}(G, S)$3 and $\mathrm{Cay}(G, S)$4, $\mathrm{Cay}(G, S)$5 is not a perfect code (Qiao et al., 31 Jul 2025). Further exceptional cases arise due to the action of certain outer automorphisms, as fully classified in Theorem 6.5 of (Qiao et al., 31 Jul 2025). For groups of type $\mathrm{Cay}(G, S)$6 with socle $\mathrm{Cay}(G, S)$7, techniques using wreath products are employed; in many cases, perfect code status is preserved under wreath product extensions, but the converse can fail (Corollary 7.9).

5. Connections to Circulant Graphs, Efficient Domination, and Broader Context

Earlier work on efficient domination (perfect codes) in circulant graphs (Cayley graphs of cyclic groups) with two chord lengths [Peters, Ruži, 2007] and in "metric-induced" configurations [Medina, Beivide, Gabidulin] laid the foundation for graph-theoretic approaches to perfect codes. These studies focus on explicit enumeration and construction in highly symmetric graphs.

Techniques from circulant graph domination theory (inverse-closed transversals, local complementations, two-local analysis) are parallel to those employed for arbitrary Cayley graphs in (Qiao et al., 31 Jul 2025), and are referenced for context and methodological continuity. For example, in circulant graphs, the efficient dominating set problem corresponds to subgroup perfect codes in cyclic settings, fully described via tiling by coset representatives (Ma et al., 2019, Huang et al., 2016).

6. Table: Characterization Criteria for Maximal Subgroup Perfect Codes

Group Situation	Key Criterion	References
2-subgroup $\mathrm{Cay}(G, S)$8	$\mathrm{Cay}(G, S)$9 has order-2 complement in $G$0 for all $G$1	(Qiao et al., 31 Jul 2025)
Maximal $G$2 with $G$3	$G$4 is perfect code in $G$5	(Qiao et al., 31 Jul 2025)
$G$6, maximal $G$7	Exceptions for $G$8 as above; otherwise $G$9 is a perfect code	(Qiao et al., 31 Jul 2025)
Primitive (HA, HS, HC, TW, SD, CD) types	Every stabilizer perfect code via Diamond Lemma	(Qiao et al., 31 Jul 2025)

7. Implications and Open Questions

The characterization of maximal subgroup perfect codes via local complement conditions unifies structural, algebraic, and combinatorial perspectives. The result that transversality or tiling with involutive resolutions is necessary and sufficient for efficient domination generalizes both previous results on abelian and dihedral cases and recent reduction techniques to $S \subseteq G \setminus \{1\}$0-groups (Zhang, 2022, Ma et al., 2019).

Further directions include:

• Systematic exploration of perfect code existence in additional almost simple group types.
• Analysis of the possible failure of the converse implications in wreath products and other group extensions.
• Extension and adaptation of techniques from circulant graph domination to broader non-cyclic, non-abelian settings.
• Algorithmic detection of local complements and efficient dominating sets in large or computationally constructed groups.

The theoretical advances bridge algebraic coding theory, group analysis, and combinatorics, showing that maximal subgroup perfect codes reflect subtle local group symmetries and have direct, rigorously characterizable graph-theoretic consequences.