Let G be a finite group. An element g ∈ G is called a vanishing element of G if there exists an irreducible complex character χ of G such that χ(g) = 0. In this paper we study the vanishing prime graph Γ(G), whose vertices are the prime numbers dividing the orders of some vanishing element of G, and two distinct vertices p and q are adjacent if and only if G has a vanishing element of order divisible by pq. Among other things we prove that, similarly to what holds for the prime graph of G, the graph Γ(G) has at most six connected components.
On the vanishing prime graph of finite groups / S. Dolfi, E. Pacifici, L. Sanus, P. Spiga. - In: JOURNAL OF THE LONDON MATHEMATICAL SOCIETY. - ISSN 0024-6107. - 82:1(2010), pp. 167-183. [10.1112/jlms/jdq021]
On the vanishing prime graph of finite groups
E. PacificiSecondo
;
2010
Abstract
Let G be a finite group. An element g ∈ G is called a vanishing element of G if there exists an irreducible complex character χ of G such that χ(g) = 0. In this paper we study the vanishing prime graph Γ(G), whose vertices are the prime numbers dividing the orders of some vanishing element of G, and two distinct vertices p and q are adjacent if and only if G has a vanishing element of order divisible by pq. Among other things we prove that, similarly to what holds for the prime graph of G, the graph Γ(G) has at most six connected components.File | Dimensione | Formato | |
---|---|---|---|
2010NonSolvableVanGraph.pdf
accesso aperto
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
328.25 kB
Formato
Adobe PDF
|
328.25 kB | Adobe PDF | Visualizza/Apri |
jlms%2Fjdq021.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
207.6 kB
Formato
Adobe PDF
|
207.6 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.