SearcharxivSearch

arXiv · 2006.15249

$K_4$-free character graphs with diameter three

Abstract

Let $G$ be a finite group and let $\rm{Irr}(G)$ be the set of all irreducible complex characters of $G$. Let $\rm{cd}(G)$ be the set of all character degrees of $G$ and denote by $ρ(G)$ the set of primes which divide some character degrees in $\rm{cd}(G)$. The character graph $Δ(G)$ associated to $G$ is a graph whose vertex set is $ρ(G)$ and there is an edge between two distinct primes $p$ and $q$ if and only if the product $pq$ divides some character degree of $G$. Suppose the character graph $Δ(G)$ is $K_4$-free with diameter $3$. In this paper, we show that $|ρ(G)|\neq 5$, if and only if $G\cong J_1 \times A$, where $J_1$ is the first Janko's sporadic simple group and $A$ is abelian.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahdi Ebrahimi. 2020-06-27. $K_4$-free character graphs with diameter three. https://arxiv.org/abs/2006.15249

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