On kernel isomorphisms of $m$-Cayley digraphs and finite $2$PCI-groups
Xing Zhang, Yan-Quan Feng, Jin-Xin Zhou, Fu-Gang Yin

TL;DR
This paper advances the understanding of $m$-Cayley digraph isomorphisms by classifying finite 2-PCI-groups, proving their solvability, and exploring kernel isomorphisms, thereby completing the classification of finite non-abelian BCI-groups.
Contribution
It introduces kernel isomorphisms for $m$-Cayley digraphs and classifies finite 2-PCI-groups, providing a complete classification of finite non-abelian BCI-groups.
Findings
Every finite 2-PCI-group is solvable.
Sylow 3-subgroup isomorphic to Z_3, Z_3×Z_3, or Z_9.
Sylow p-subgroup with p≠3 is elementary abelian, Z_4, or Q_8.
Abstract
The isomorphism problem for digraphs is a fundamental problem in graph theory. In this paper, we consider this problem for -Cayley digraphs which are generalization of Cayley digraphs. Let be a positive integer. A digraph admitting a group of automorphisms acting semiregularly on the vertices with exactly orbits is called an -Cayley digraph of . In our previous paper, we developed a theory for -Cayley isomorphisms of -Cayley digraphs, and classified finite CI-groups for each , and finite PCI-groups for each . The next natural step is to classify finite PCI-groups for or . Note that BCI-groups form an important subclass of the PCI-groups, which were introduced in 2008 by Xu et al. Despite much effort having been made on the study of BCI-groups, the problem of classifying finite BCI-groups is still widely open. In this…
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Geometric and Algebraic Topology
