activity
20102022
most citedA new solvability criterion for finite groups

1 citations · 4 across the 6 of their papers we have counts for

collaborators
Showing math.GRShow all

6 papers · 1 filter

math.GR2022

Non-solvable groups whose character degree graph has a cut-vertex. II

Silvio Dolfi, Emanuele Pacifici, Lucia Sanus

Let be a finite group, and let denote the set of degrees of the irreducible complex characters of . Define then the character degree graph as the (simp…

math.GR20221 cited

Non-solvable groups whose character degree graph has a cut-vertex. I

Silvio Dolfi, Emanuele Pacifici, Lucia Sanus +1

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirecte…

math.GR2022

On the proportion of vanishing elements in finite groups

Yu Zeng, Dongfang Yang, Silvio Dolfi

We prove that the function , measuring the proportion of the elements of a finite group that are zeros of irreducible characters of , takes very…

math.GR20161 cited

Groups whose character degree graph has diameter three

Carlo Casolo, Silvio Dolfi, Emanuele Pacifici +1

Let \(G\) be a finite group, and let \(Δ(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whene…

math.GR20121 cited

On the maximal number of coprime subdegrees in finite primitive permutation groups

Silvio Dolfi, Robert Guralnick, Cheryl Praeger +1

The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the large…

math.GR20101 cited

A new solvability criterion for finite groups

Silvio Dolfi, Marcel Herzog, Cheryl E. Praeger

In 1968, John Thompson proved that a finite group is solvable if and only if every -generator subgroup of is solvable. In this paper, we prove that solvability of a fini…