Costantino Delizia
Research Subjects
Costantino Delizia has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Primož Moravec
Faculty of Mathematics and Physics, University of Ljubljana , Jadranska 21, 1000 Ljubljana, and , Jadranska 19, 1000 Ljubljana
9 shared publications - Chiara Nicotera
University of Salerno Italy
7 shared publications - Antonio Tortora
Dipartimento di Matematica Università di Salerno Via Giovanni Paolo II 132 -84084 - Fisciano (SA Italy
5 shared publications - Carmine Monetta
Dipartimento di Matematica, Università di Salerno, Fisciano, Italy
5 shared publications - Chiara Nicotera
Department of Mathematics, University of Salerno, Fisciano, Italy
3 shared publications - Michele Gaeta
Dipartimento di Matematica , 19028 Università di Salerno , Fisciano 84084 (SA) , Italy
3 shared publications
Latest Publications
- 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. - 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
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.Open AccessA 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. - Open Access
- 19 February 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (3) , 1-9
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.- 19 February 2023
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 20 (3) , 1-9
Open AccessOn 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. - Open Access
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.Open AccessOn 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. - Open Access
- 6 July 2021
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 197 (3) , 397-406
On infinite groups in which all abelian subgroups are locally cyclic
The structure of locally soluble periodic groups in which every abelian subgroup is locally cyclic was described over 20 years ago. We complete the aforementioned characterization by dealing with the non-periodic case. We also describe the structure of locally finite groups in which all abelian subgroups are locally cyclic.
- 6 July 2021
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 197 (3) , 397-406
Open AccessOn infinite groups in which all abelian subgroups are locally cyclic
The structure of locally soluble periodic groups in which every abelian subgroup is locally cyclic was described over 20 years ago. We complete the aforementioned characterization by dealing with the non-periodic case. We also describe the structure of locally finite groups in which all abelian subgroups are locally cyclic.
- Open Access
- 1 July 2020
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 23 (4) , 629-639
On semiconcise words
Let w be a group-word. For a group G, let G(w), denote the set of all w-values in G and w(G) the verbal subgroup of G corresponding to w. The word w is semiconcise if the subgroup [w(G), G] is finite whenever G(w), is finite. The group G is an FC(w)-group if the set of conjugates x(Gw) is finite for all x is an element of G. We prove that if w is a semiconcise word and G is an FC(w)-group, then the subgroup [w(G), G] is FC-embedded in G, that is, the intersection C-G(x) boolean AND [w(G), G] has finite index in [w(G), G] for all x is an element of G. A similar result holds for BFC(w)-groups, that are groups in which the sets x(Gw) are boundedly finite. We also show that this is no longer true if w is not semiconcise.
- 1 July 2020
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 23 (4) , 629-639
Open AccessOn semiconcise words
Let w be a group-word. For a group G, let G(w), denote the set of all w-values in G and w(G) the verbal subgroup of G corresponding to w. The word w is semiconcise if the subgroup [w(G), G] is finite whenever G(w), is finite. The group G is an FC(w)-group if the set of conjugates x(Gw) is finite for all x is an element of G. We prove that if w is a semiconcise word and G is an FC(w)-group, then the subgroup [w(G), G] is FC-embedded in G, that is, the intersection C-G(x) boolean AND [w(G), G] has finite index in [w(G), G] for all x is an element of G. A similar result holds for BFC(w)-groups, that are groups in which the sets x(Gw) are boundedly finite. We also show that this is no longer true if w is not semiconcise.
- 4 April 2020
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 237 (1) , 115-140
Gaps in probabilities of satisfying some commutator-like identities
- 4 April 2020
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 237 (1) , 115-140
Gaps in probabilities of satisfying some commutator-like identities
- 1 March 2020
- Vol. 9 (1) , 43-57
GROUPS WITH MANY SELF-CENTRALIZING OR SELF-NORMALIZING SUBGROUPS
- Open Access
Gaps in probabilities of satisfying some commutator-like identities
We show that there is a positive constant $\delta < 1$ such that the probability of satisfying either the $2$-Engel identity $[X_1, X_2, X_2] = 1$ or the metabelian identity $[[X_1, X_2], [X_3, X_4]] = 1$ in a finite group is either $1$ or at most $\delta$.Open AccessGaps in probabilities of satisfying some commutator-like identities
We show that there is a positive constant $\delta < 1$ such that the probability of satisfying either the $2$-Engel identity $[X_1, X_2, X_2] = 1$ or the metabelian identity $[[X_1, X_2], [X_3, X_4]] = 1$ in a finite group is either $1$ or at most $\delta$.