EPEmanuele Pacifici

Emanuele Pacifici

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Emanuele Pacifici has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On Camina pairs and the Fitting subgroup

    by Mark L. Lewis, Emanuele Pacifici

    In this paper, we consider the relationship between the Fitting subgroup and the Camina kernel of a Camina pair.

  • Open Access

    On quadratic rational Frobenius groups

    by Emanuele Pacifici, Marco Vergani


  • Open Access

    On Common Zeros of Characters of Finite Groups

    by Mark L. Lewis, Lucia Morotti, Emanuele Pacifici, Lucia Sanus, Hung P. Tong-Viet

    Let G be a finite group, and let $$\textrm{Irr}(G)$$ Irr ( G ) denote the set of the irreducible complex characters of G. An element $$g\in G$$ g ∈ G is called a vanishing element of G if there exists $$\chi \in \textrm{Irr}(G)$$ χ ∈ Irr ( G ) such that $$\chi (g)=0$$ χ ( g ) = 0 (i.e., g is a zero of $$\chi $$ χ ) and, in this case, the conjugacy class $$g^G$$ g G of g in G is called a vanishing conjugacy class. In this paper we consider several problems concerning vanishing elements and vanishing conjugacy classes; in particular, we consider the problem of determining the least number of conjugacy classes of a finite group G such that every non-linear $$\chi \in \textrm{Irr}(G)$$ χ ∈ Irr ( G ) vanishes on one of them. We also consider the related problem of determining the minimum number of non-linear irreducible characters of a group such that two of them have a common zero.


  • Open Access

    Element orders and codegrees of characters in non-solvable groups

    by Zeinab Akhlaghi, Emanuele Pacifici, Lucia Sanus


  • Open Access

    Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I

    by Silvio Dolfi, Emanuele Pacifici, Lucia Sanus, Victor Sotomayor

    Let G be a finite group. Denoting by $$\textrm{cd}(G)$$ 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 undirected) graph whose vertices are the prime divisors of the numbers in $$\textrm{cd}(G)$$ cd ( G ) , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{cd}(G)$$ cd ( G ) . In the series of three papers starting with the present one, we analyze the structure of the finite non-solvable groups whose character degree graph possesses a cut-vertex, i.e. a vertex whose removal increases the number of connected components of the graph.


  • Open Access

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

    by Silvio Dolfi, Emanuele Pacifici, Lucia Sanus

    Let G be a finite group. Denoting by $$\textrm{cd}(G)$$ cd ( G ) the set of the degrees of the irreducible complex characters of G, we consider the character degree graph of G: this, is the (simple, undirected) graph whose vertices are the prime divisors of the numbers in $$\textrm{cd}(G)$$ cd ( G ) , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{cd}(G)$$ cd ( G ) . This paper completes the classification, started in Dolfi et al. (Non-solvable groups whose character degree graph has a cut-vertex. II, 2022. https://doi.org/10.1007/s10231-022-01299-3) and Dolfi et al. (Non-solvable groups whose character degree graph has a cut-vertex. I, 2022. https://doi.org/10.48550/arXiv.2207.10119), of the finite non-solvable groups whose character degree graph has a cut-vertex, i.e., a vertex whose removal increases the number of connected components of the graph. More specifically, it was proved in Dolfi et al. (Non-solvable groups whose character degree graph has a cut-vertex. I, 2022. https://doi.org/10.48550/arXiv.2207.10119 that these groups have a unique non-solvable composition factor S, and that S is isomorphic to a group belonging to a restricted list of non-abelian simple groups. In Dolfi et al. (Non-solvable groups whose character degree graph has a cut-vertex. II, 2022. https://doi.org/10.1007/s10231-022-01299-3) and Dolfi et al. (Non-solvable groups whose character degree graph has a cut-vertex. I, 2022. https://doi.org/10.48550/arXiv.2207.10119) all isomorphism types for S were treated, except the case $$S\cong \textrm{PSL}_{2}(2^a)$$ S ≅ PSL 2 ( 2 a ) for some integer $$a\ge 2$$ a ≥ 2 ; the remaining case is addressed in the present paper.


  • Open Access

    Conjugacy classes of maximal cyclic subgroups

    by Mariagrazia Bianchi, Rachel D. Camina, Mark L. Lewis, Emanuele Pacifici

    In this paper, we study the number of conjugacy classes of maximal cyclic subgroups of a finite group 𝐺, denoted η ⁢ ( G ) . First we consider the properties of this invariant in relation to direct and semi-direct products, and we characterize the normal subgroups 𝑁 with η ⁢ ( G / N ) = η ⁢ ( G ) . In addition, by applying the classification of finite groups whose nontrivial elements have prime order, we determine the structure of G / ⟨ G − ⟩ , where G − is the set of elements of 𝐺 generating non-maximal cyclic subgroups of 𝐺. More precisely, we show that G / ⟨ G − ⟩ is either trivial, elementary abelian, a Frobenius group or isomorphic to A 5 .

  • Open Access

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

    by Silvio Dolfi, Emanuele Pacifici, Lucia Sanus

    Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime divisors of the numbers in ${\rm{cd}}(G)$, and two distinct vertices $p$, $q$ are adjacent if and only if $pq$ divides some number in ${\rm{cd}}(G)$. This paper continues the work, started in [7], toward the classification of the finite non-solvable groups whose degree graph possesses a cut-vertex, i.e., a vertex whose removal increases the number of connected components of the graph. While, in [7], groups with no composition factors isomorphic to ${\rm{PSL}}_2(t^a)$ (for any prime power $t^a\geq 4$) were treated, here we consider the complementary situation in the case when $t$ is odd and $t^a> 5$. The proof of this classification will be then completed in the third and last paper of this series ([8]), that deals with the case $t=2$.

  • Open Access

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

    by Silvio Dolfi, Emanuele Pacifici, Lucia Sanus, Victor Sotomayor

    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 undirected) graph whose vertices are the prime divisors of the numbers in cd(G), and two distinct vertices p, q are adjacent if and only if pq divides some number in cd(G). In the series of three papers starting with the present one, we analyze the structure of the finite non-solvable groups whose character degree graph possesses a cut-vertex, i.e., a vertex whose removal increases the number of connected components of the graph.