Emanuele Pacifici
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
Research Subjects
Emanuele Pacifici has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Silvio Dolfi
Dipartimento di Matematica e Informatica Università di Firenze Italy
20 shared publications - Lucia Sanus
Departament de Matemàtiques, Facultat de Matemàtiques, Universitat de València, Burjassot, Valencia, Spain
16 shared publications - Mariagrazia Bianchi
Dipartimento di Matematica F. Enriques , Università degli Studi di Milano , via Saldini 50, 20133 Milano , Italy
8 shared publications - Mark L. Lewis
Department of Mathematical Sciences, Kent State University, Kent, USA
6 shared publications - Rachel Deborah Camina
Fitzwilliam College, Cambridge, UK
5 shared publications - Víctor Sotomayor
Departamento de Álgebra, Universidad de Granada, Granada, Spain
5 shared publications
Latest Publications
- Open Access
On Camina pairs and the Fitting subgroup
In this paper, we consider the relationship between the Fitting subgroup and the Camina kernel of a Camina pair.
Open AccessOn Camina pairs and the Fitting subgroup
In this paper, we consider the relationship between the Fitting subgroup and the Camina kernel of a Camina pair.
- Open Access
- 3 September 2025
- Published by Taylor & Francis in Communications in Algebra
- Vol. 54 (3) , 1061-1081
On quadratic rational Frobenius groups
- 3 September 2025
- Published by Taylor & Francis in Communications in Algebra
- Vol. 54 (3) , 1061-1081
Open AccessOn quadratic rational Frobenius groups
- Open Access
- 20 February 2025
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 28 (2) , 395-406
On Common Zeros of Characters of Finite Groups
Let G be a finite group, and let $$\textrm{Irr}(G)$$ denote the set of the irreducible complex characters of G. An element $$g\in G$$ is called a vanishing element of G if there exists $$\chi \in \textrm{Irr}(G)$$ such that $$\chi (g)=0$$ (i.e., g is a zero of $$\chi $$ ) and, in this case, the conjugacy class $$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)$$ 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.- 20 February 2025
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 28 (2) , 395-406
Open AccessOn Common Zeros of Characters of Finite Groups
Let G be a finite group, and let $$\textrm{Irr}(G)$$ denote the set of the irreducible complex characters of G. An element $$g\in G$$ is called a vanishing element of G if there exists $$\chi \in \textrm{Irr}(G)$$ such that $$\chi (g)=0$$ (i.e., g is a zero of $$\chi $$ ) and, in this case, the conjugacy class $$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)$$ 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
- 22 January 2024
- Published by Elsevier in Journal of Algebra
- Vol. 644, 428-441
Element orders and codegrees of characters in non-solvable groups
- 22 January 2024
- Published by Elsevier in Journal of Algebra
- Vol. 644, 428-441
Open AccessElement orders and codegrees of characters in non-solvable groups
- Open Access
- 21 June 2023
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 51 (3) , 731-753
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Let G be a finite group. Denoting by $$\textrm{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)$$ , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{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.- 21 June 2023
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 51 (3) , 731-753
Open AccessNon-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Let G be a finite group. Denoting by $$\textrm{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)$$ , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{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
- 6 April 2023
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (5) , 2517-2540
Non-solvable groups whose character degree graph has a cut-vertex. III
Let G be a finite group. Denoting by $$\textrm{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)$$ , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{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)$$ for some integer $$a\ge 2$$ ; the remaining case is addressed in the present paper.- 6 April 2023
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (5) , 2517-2540
Open AccessNon-solvable groups whose character degree graph has a cut-vertex. III
Let G be a finite group. Denoting by $$\textrm{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)$$ , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{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)$$ for some integer $$a\ge 2$$ ; the remaining case is addressed in the present paper. - Open Access
- 2 February 2023
- Published by Walter de Gruyter GmbH in Journal of Group Theory
Conjugacy classes of maximal cyclic subgroups
In this paper, we study the number of conjugacy classes of maximal cyclic subgroups of a finite group 𝐺, denoted . First we consider the properties of this invariant in relation to direct and semi-direct products, and we characterize the normal subgroups 𝑁 with . In addition, by applying the classification of finite groups whose nontrivial elements have prime order, we determine the structure of , where is the set of elements of 𝐺 generating non-maximal cyclic subgroups of 𝐺. More precisely, we show that is either trivial, elementary abelian, a Frobenius group or isomorphic to .- 2 February 2023
- Published by Walter de Gruyter GmbH in Journal of Group Theory
Open AccessConjugacy classes of maximal cyclic subgroups
In this paper, we study the number of conjugacy classes of maximal cyclic subgroups of a finite group 𝐺, denoted . First we consider the properties of this invariant in relation to direct and semi-direct products, and we characterize the normal subgroups 𝑁 with . In addition, by applying the classification of finite groups whose nontrivial elements have prime order, we determine the structure of , where is the set of elements of 𝐺 generating non-maximal cyclic subgroups of 𝐺. More precisely, we show that is either trivial, elementary abelian, a Frobenius group or isomorphic to . - 11 January 2023
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (4) , 1753-1780
Non-solvable groups whose character degree graph has a cut-vertex. II
- 11 January 2023
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 202 (4) , 1753-1780
Non-solvable groups whose character degree graph has a cut-vertex. II
- Open Access
Non-solvable groups whose character degree graph has a cut-vertex. II
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 AccessNon-solvable groups whose character degree graph has a cut-vertex. II
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
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.
Open AccessNon-solvable groups whose character degree graph has a cut-vertex. I
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.