Searcharxiv⌕ Search

arXiv subjects

Carmine Monetta

Publications and source records attributed to Carmine Monetta.

At least 19 recordsLinked to original sources
arXiv2025

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 $\pi$-elements have soluble centralisers, for a suitable collection $\pi$ 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.

math.GR↗
arXiv2025

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.

math.GR↗
arXiv2025

Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of the nilpotent graph of a finite group $G$. Indeed, we characterize finite solvable groups whose closed neighborhoods are nilpotent subgroups. Moreover, we study the connectivity of the graph $\Gamma(G)$ obtained removing all universal vertices from the nilpotent graph of $G$. Some upper bounds to the diameter of $\Gamma(G)$ are provided when $G$ belongs to some classes of groups.

math.GR↗
arXiv2024

A generalization of 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 $w$ is said to be concise if the verbal subgroup $w(G)$ is finite in each group $G$ in which $w$ 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.

math.GR↗
arXiv2023

Group nilpotency from a graph point of view

Let $Γ_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $Γ_H$ is isomorphic to $Γ_G$ for a finite nilpotent group $G$. In the present work we analyze the problem for different graphs that one can associate with a finite group, both reporting on existing answers and contributing to new ones.

math.GR↗
arXiv2023

On the structure of finite groups determined by the arithmetic and geometric means of element orders

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every prime $p$, we prove a sufficient condition for a finite group to be $p$-nilpotent, that is, a group whose elements of $p'$-order form a normal subgroup. Moreover, we characterize finite cyclic groups with prescribed number of prime divisors.

math.GR↗
arXiv2023

A conjecture related to the nilpotency of groups with isomorphic non-commuting graphs

In this work we discuss whether the non-commuting graph of a finite group can determine its nilpotency. More precisely, Abdollahi, Akbari and Maimani conjectured that if $G$ and $H$ are finite groups with isomorphic non-commuting graphs and $G$ is nilpotent, then $H$ must be nilpotent as well (Conjecture 2). We pose a new conjecture (Conjecture 3) that, together with the assumption $|Z(G)|\geq|Z(H)|$, implies Conjecture 2 and we prove it for groups in which all centralizers of non-central elements are abelian.

math.GR↗
arXiv2023

Upper bounds for the product of element orders of finite groups

Let $G$ be a finite group of order $n$, and denote by $ρ(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $ρ(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs to some classes of non-cyclic groups.

math.GR↗
arXiv2022

On the solubilizer of an element in a finite group

The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this paper, we focus on the set of neighbors of a vertex $x$ which we call the solubilizer of $x$ in $G$, $\mathrm{Sol}_G(x)$, investigating both arithmetic and structural properties of this set.

math.GR↗
arXiv2021

$p$-nilpotency criteria for some verbal subgroups

Let $G$ be a finite group, let $p$ be a prime and let $w$ be a group-word. We say that $G$ satisfies $P(w,p)$ if the prime $p$ divides the order of $xy$ for every $w$-value $x$ in $G$ of $p'$-order and for every non-trivial $w$-value $y$ in $G$ of order divisible by $p$. If $k \geq 2$, we prove that the $k$th term of the lower central series of $G$ is $p$-nilpotent if and only if $G$ satisfies $P(\gamma_k,p)$. In addition, if $G$ is soluble, we show that the $k$th term of the derived series of $G$ is $p$-nilpotent if and only if $G$ satisfies $P(\delta_k,p)$.

math.GR↗
arXiv2021

On some series of a group related to the non-abelian tensor square of groups

Let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. In this paper we prove that the derived subgroup $\nu(G)'$ is a central product of three normal subgroups of $\nu(G)$, all isomorphic to the non-abelian tensor square $G \otimes G$. As a consequence, we describe the structure of each term of the derived and lower central series of the group $\nu(G)$.

math.GR↗
arXiv2019

Boundedly finite conjugacy classes of tensors

Let $n$ be a positive integer and let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. Set $T_{\otimes}(G) = \{g \otimes h \mid g,h \in G\}$. We prove that if the size of the conjugacy class $\left |x^{\nu(G)} \right| \leq n$ for every $x \in T_{\otimes}(G)$, then the second derived subgroup $\nu(G)''$ is finite with $n$-bounded order. Moreover, we obtain a sufficient condition for a group to be a BFC-group.

math.GR↗
arXiv2018

A nilpotency criterion for some verbal subgroups

The word $w=[x_{i_1},x_{i_2},\dots,x_{i_k}]$ is a simple commutator word if $k\geq 2, i_1\neq i_2$ and $i_j\in \{1,\dots,m\}$, for some $m>1$. For a finite group $G$, we prove that if $i_{1} \neq i_j$ for every $j\neq 1$, then the verbal subgroup corresponding to $w$ is nilpotent if and only if $|ab|=|a||b|$ for any $w$-values $a,b\in G$ of coprime orders. We also extend the result to a residually finite group $G$, provided that the set of all $w$-values in $G$ is finite.

math.GR↗
arXiv2018

Coprime commutators in finite groups

Let $G$ be a finite group and let $k \geq 2$. We prove that the coprime subgroup $\gamma_k^*(G)$ is nilpotent if and only if $|xy|=|x||y|$ for any $\gamma_k^*$-commutators $x,y \in G$ of coprime orders (Theorem A). Moreover, we show that the coprime subgroup $\delta_k^*(G)$ is nilpotent if and only if $|ab|=|a||b|$ for any powers of $\delta_k^*$-commutators $a,b\in G$ of coprime orders (Theorem B).

math.GR↗