Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.14984

The Engel graph of almost simple groups

Andrea Lucchini·Pablo Spiga
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a finite group $G$, the Engel graph of $G$ is a directed graph encoding pairs of elements satisfying some Engel word. From the work of Detomi, Lucchini and Nemmi, the strongly connectivity of the Engel graph of an arbitrary group $G$ is reduced to the understanding of the strongly connectivity of the Engel graph of non-abelian simple groups. In this paper, we investigate the strongly connectivity of the Engel graph of finite non-abelian simple groups.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Andrea Lucchini, Pablo Spiga. 2022-05-30. The Engel graph of almost simple groups. https://arxiv.org/abs/2205.14984

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗