Carmine Monetta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Carmine Monetta has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Raimundo Bastos
Departamento de Matemática , Universidade de Brasília , Brasilia - DF, 70910-900 Brazil
11 shared publications - Costantino Delizia
PRIMO Ž MORAVEC AND CHIARA NICOTERA
5 shared publications - Marialaura Noce
Dipartimento di Informatica, Università degli Studi di Salerno, Salerno, Italy
3 shared publications - Michele Gaeta
Dipartimento di Matematica , 19028 Università di Salerno , Fisciano 84084 (SA) , Italy
3 shared publications - Ricardo de Oliveira
Instituto de Matemática e Estatística , Universidade Federal de Goiás , Goiânia - GO, 74690-900 Brazil
3 shared publications Valentina Grazian
Department of Mathematics and Applications, University of Milano - Bicocca, Milano, Italy
3 shared publications
Latest Publications
- Open Access
- 16 March 2026
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 210 (2) , 213-222
Finite groups in which almost all class sizes are prime numbers
In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.
- 16 March 2026
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 210 (2) , 213-222
Open AccessFinite groups in which almost all class sizes are prime numbers
In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.
- Open Access
On finite groups with soluble centralisers
We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the case in which all non-central $π$-elements have soluble centralisers, for a suitable collection $π$ of primes. Our results yield further descriptions under mild local conditions and have applications to groups with soluble involution centralisers, as well as to questions concerning non-commuting graphs.Open AccessOn finite groups with soluble centralisers
We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the case in which all non-central $π$-elements have soluble centralisers, for a suitable collection $π$ of primes. Our results yield further descriptions under mild local conditions and have applications to groups with soluble involution centralisers, as well as to questions concerning non-commuting graphs. - Open Access
On the directed normalizing graph associated with a group
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x \rangle$ is normal in $\langle x, y \rangle$. Our analysis focuses on the set of bidirectional universal vertices and, in particular, on the induced subgraph obtained by removing them, where the most interesting connectivity phenomena occur. We characterize the groups for which this induced subgraph is strongly connected and determine bounds for its diameter. Finally, we show how properties of this graph reflect algebraic features of the underlying group.Open AccessOn the directed normalizing graph associated with a group
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x \rangle$ is normal in $\langle x, y \rangle$. Our analysis focuses on the set of bidirectional universal vertices and, in particular, on the induced subgraph obtained by removing them, where the most interesting connectivity phenomena occur. We characterize the groups for which this induced subgraph is strongly connected and determine bounds for its diameter. Finally, we show how properties of this graph reflect algebraic features of the underlying group. - 5 August 2025
- Published by Springer Nature in Archiv der Mathematik
- p. 1-8
Criteria for nilpotency of higher commutator subgroups
- 5 August 2025
- Published by Springer Nature in Archiv der Mathematik
- p. 1-8
Criteria for nilpotency of higher commutator subgroups
- Open Access
- 2 July 2025
- Published by Elsevier in Journal of Algebra
- Vol. 682, 771-786
Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group
- 2 July 2025
- Published by Elsevier in Journal of Algebra
- Vol. 682, 771-786
Open AccessNeighborhoods, connectivity, and diameter of the nilpotent graph of a finite group
- 24 June 2025
- Published by Taylor & Francis in Communications in Algebra
- Vol. 53 (12) , 5412-5417
On ambivalent groups
- 24 June 2025
- Published by Taylor & Francis in Communications in Algebra
- Vol. 53 (12) , 5412-5417
On ambivalent groups
- Open Access
- 10 February 2025
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 32 (5) , 779-787
On generating properties of the weak commutativity of p -groups, p odd
In the present paper, we examine the generating properties of Sidki’s weak commutativity group. More precisely, if G and G φ {G^{\varphi}} are two isomorphic groups, the weak commutativity group χ ( G ) {\chi(G)} is the group generated by G and G φ {G^{\varphi}} subject to the relations [ g , g φ ] = 1 {[g,g^{\varphi}]=1} for all g ∈ G {g\in G} . Here we provide bounds for the number of generators of some subgroups of χ ( G ) {\chi(G)} when G is a p -group of odd order and either G is powerful or D ( G ) {D(G)} is abelian.
- 10 February 2025
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
- Vol. 32 (5) , 779-787
Open AccessOn generating properties of the weak commutativity of p -groups, p odd
In the present paper, we examine the generating properties of Sidki’s weak commutativity group. More precisely, if G and G φ {G^{\varphi}} are two isomorphic groups, the weak commutativity group χ ( G ) {\chi(G)} is the group generated by G and G φ {G^{\varphi}} subject to the relations [ g , g φ ] = 1 {[g,g^{\varphi}]=1} for all g ∈ G {g\in G} . Here we provide bounds for the number of generators of some subgroups of χ ( G ) {\chi(G)} when G is a p -group of odd order and either G is powerful or D ( G ) {D(G)} is abelian.
- Open Access
- 2 December 2024
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (1) , 149-154
ON NEIGHBOURHOODS IN THE ENHANCED POWER GRAPH ASSOCIATED WITH A FINITE GROUP
We investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.
- 2 December 2024
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 112 (1) , 149-154
Open AccessON NEIGHBOURHOODS IN THE ENHANCED POWER GRAPH ASSOCIATED WITH A FINITE GROUP
We investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.
- Open Access
- 11 September 2024
- Published by Walter de Gruyter GmbH in Journal of Group Theory
On generalized concise words
The study of verbal subgroups within a group is well known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance. One of the most studied problems is to establish which words are concise, where a word 𝑤 is said to be concise if the verbal subgroup is finite in each group 𝐺 in which 𝑤 takes only a finite number of values. The purpose of this article is to present some results, in which a hierarchy among words is introduced, generalizing the concept of concise word.- 11 September 2024
- Published by Walter de Gruyter GmbH in Journal of Group Theory
Open AccessOn generalized concise words
The study of verbal subgroups within a group is well known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance. One of the most studied problems is to establish which words are concise, where a word 𝑤 is said to be concise if the verbal subgroup is finite in each group 𝐺 in which 𝑤 takes only a finite number of values. The purpose of this article is to present some results, in which a hierarchy among words is introduced, generalizing the concept of concise word. - Open Access
On neighborhoods in the enhanced power graph associated with a finite group
This article investigates neighborhoods' sizes in the enhanced power graph (as known as the cyclic graph) associated with a finite group. In particular, we characterize finite $p$-groups with the smallest maximum size for neighborhoods of nontrivial element in its enhanced power graph.
Open AccessOn neighborhoods in the enhanced power graph associated with a finite group
This article investigates neighborhoods' sizes in the enhanced power graph (as known as the cyclic graph) associated with a finite group. In particular, we characterize finite $p$-groups with the smallest maximum size for neighborhoods of nontrivial element in its enhanced power graph.