On the isomorphism problem of Cayley digraphs
math.GR, math.CO
Submitted: 2026-10-24
Updated: 2026-10-24
Comments: 7 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: A finite group G is called a DCI-group provided any two Cayley digraphs Cay(G,S) and Cay(G,T) are isomorphic iff the two connection sets S and T are images of each other via automorphisms of the…
Abstract
A finite group G is called a DCI-group provided any two Cayley digraphs Cay(G,S) and Cay(G,T) are isomorphic iff the two connection sets S and T are images of each other via automorphisms of the group G. Building on the vast literature on CI- and DCI-groups we present an updated list of possible DCI-groups. In addition, we give an alternative proof that does not rely on deep results from group theory. We also point out the three most important open problems related to the classification of DCI-groups.
Related papers
- Idempotence criteria for lazy cellular automata
- From algebraic orthogonality to RAAG embedding obstructions in hierarchically hyperbolic groups
- A finitely generated Linear group without property (T) that is neither inner amenable nor properly proximal
- On the Order of Products of Coprime Elements in Finite Groups
- From almost tight p-group enumeration to 2-group domination among finite groups
- Character Nonvanishing under Coprime Actions