SearcharxivSearch

arXiv · 2102.10876

Normal edge-transitive Cayley graphs and Frattini-like subgroups

Abstract

For a finite group $G$ and an inverse-closed generating set $C$ of $G$, let $Aut(G;C)$ consist of those automorphisms of $G$ which leave $C$ invariant. We define an $Aut(G;C)$-invariant normal subgroup $\Phi(G;C)$ of $G$ which has the property that, for any $Aut(G;C)$-invariant normal set of generators for $G$, if we remove from it all the elements of $\Phi(G;C)$, then the remaining set is still an $Aut(G;C)$-invariant normal generating set for $G$. The subgroup $\Phi(G;C)$ contains the Frattini subgroup $\Phi(G)$ but the inclusion may be proper. The Cayley graph $Cay(G,C)$ is normal edge-transitive if $Aut(G;C)$ acts transitively on the pairs $\{c,c^{-1}\}$ from $C$. We show that, for a normal edge-transitive Cayley graph $Cay(G,C)$, its quotient modulo $\Phi(G;C)$ is the unique largest normal quotient which is isomorphic to a subdirect product of normal edge-transitive graphs of characteristically simple groups. In particular, we may therefore view normal edge-transitive Cayley graphs of characteristically simple groups as building blocks for normal edge-transitive Cayley graphs whenever the subgroup $\Phi(G;C)$ is trivial. We explore several questions which these results raise, some concerned with the set of all inverse-closed generating sets for groups in a given family. In particular we use this theory to classify all $4$-valent normal edge-transitive Cayley graphs for dihedral groups; this involves a new construction of an infinite family of examples, and disproves a conjecture of Talebi.

Explore related subjects

Keep this discovery

BibTeXRIS

Behnam Khosravi, Cheryl E. Praeger. 2021-02-22. Normal edge-transitive Cayley graphs and Frattini-like subgroups. https://arxiv.org/abs/2102.10876

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR