Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subgroup Perfect Codes of At\mathcal{A}_t-Groups and Their Applications

Published 21 Jul 2025 in math.CO | (2507.15206v1)

Abstract: A subset CC of the vertex set of a graph Γ\Gamma is called a perfect code in Γ\Gamma if every vertex of Γ\Gamma is at distance no more than 1 to exactly one vertex of CC. A subgroup HH of a group GG is called a subgroup perfect code of GG if HH is a perfect code in some Cayley graph of GG. Recently, Zhang reveals that the study of subgroup perfect codes of finite groups naturally reduces to the case of pp-groups, especially $2$-groups. Based on the combined works of Berkovich, Janko and Zhang, every pp-group is an At\mathcal{A}_t-group. In this work, we establish a complete classification of subgroup perfect codes of At\mathcal{A}_t-groups for t∈0,1t \in{0, 1}. Moreover, subgroup perfect codes of finite groups with abelian Sylow $2$-subgroups are also characterized.

Authors (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.