SearcharxivSearch

arXiv · 2408.03879

Engel and co-Engel graphs of finite groups

Abstract

Let $G$ be a group. Associate a directed graph $\vec{E}(G)$ (called the Engel digraph of $G$) with $G$ whose vertex set is $G$, with an arc $(x,y)$ if $[y, {}_k x]=1$ for some positive integer $k$, where $[y,{}_kx]$ is the iterated commutator $[y,x,x,\ldots,x]$, with $k$ terms $x$ in the expression. From this we define the Engel graph $E(G)$ by ignoring directions; the co-Engel graph $E_c(G)$ is its complement. The co-Engel graph, under the name ``Engel graph'', was introduced by Abdollahi. However, the name we use is more natural. We begin with some general results about the Engel digraph and graph, before turning our attention to the co-Engel graph. Among other things, we show that the undirected Engel graph does not determine the directed version up to isomorphism, though counterexamples seem to be fairly rare: there are just two orders less than $100$ for which this happens. We also prove a universality theorem: every finite digraph is an induced sub-digraph of the Engel digraph of a finite group. The isolated vertices of $E_c(G)$ form the Fitting subgroup $F(G)$ of $G$. In this paper, we realize the induced subgraph of co-Engel graphs of certain finite non-Engel groups $G$ induced by $G \setminus F(G)$. We write $E_c^-(G)$ to denote the subgraph of $E_c(G)$ induced by $G \setminus F(G)$. We also compute genus, various spectra, energies and Zagreb indices of $E_c^-(G)$ for those groups. As a consequence, we determine (up to isomorphism) all finite non-Engel group $G$ such that the clique number of $E_c^-(G)$ is at most $4$ and $E_c^-(G)$ is toroidal or projective. Further, we show that $E_c^-(G)$ is ALQ-integral and satisfies the E-LE conjecture and the Hansen-Vuki{\v{c}}evi{\'c} conjecture for the groups considered in this paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter J. Cameron, Rishabh Chakraborty, Rajat Kanti Nath, Deiborlang Nongsiang. 2024-08-07. Engel and co-Engel graphs of finite groups. https://arxiv.org/abs/2408.03879

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