On non-normal subgroup perfect codes
Angelot Behajaina, Roghayeh Maleki, Andriaherimanana Sarobidy, Razafimahatratra

TL;DR
This paper constructs an infinite family of finite groups with non-normal subgroup perfect codes, answering a question about the existence of such codes with specific algebraic properties.
Contribution
It provides the first known infinite family of finite groups with non-normal subgroup perfect codes exhibiting particular element square properties.
Findings
Existence of non-normal subgroup perfect codes in certain finite groups.
Construction of an infinite family of such groups.
Answer to an open question by Wang, Xia, and Zhou.
Abstract
Let be a graph. A subset is a \emph{perfect code} of if is a coclique of with the property that any vertex in is adjacent to exactly one vertex in . Given a finite group with identity element and , is a \emph{subgroup perfect code} of if there exists an inverse-closed subset such that is a perfect code of the Cayley graph of with connection set . In this short note, we give an infinite family of finite groups admitting a non-normal subgroup perfect code such that there exists with but , for all ; thus, answering a question raised by Wang, Xia, and Zhou in [Perfect sets in Cayley graphs. {\it arXiv preprint} arXiv:2006.05100, 2020].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Coding theory and cryptography · Finite Group Theory Research
