NRNorai Romeu Rocco
Norai Romeu Rocco
*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
Norai Romeu Rocco has a total of 24 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
14 shared publications - Irene Naomi Nakaoka
Departamento de Matemática, Universidade Estadual, de Maringá, Maringá-PR 87020-900, Brazil
4 shared publications - Ivonildes Ribeiro Martins Dias
Instituto de Matemática e Estatística , Universidade Federal de Goiás , Goiânia - GO, 74.001-970 , Brazil
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 - Carmine Monetta
Dipartimento di Matematica, Università di Salerno, Fisciano, Italy
2 shared publications - Ewerton R. Vieira
Departamento de Matemática, Universidade Federal de Goias, Goiânia, Brazil
2 shared publications
Latest Publications
- Open Access
The Non-Abelian Tensor Square of Finite Metacyclic Groups
In this paper, we investigate the group $ν(G)$, an extension of the non-abelian tensor square $G$ by the direct product $G\times G$, in order to determine a presentation of $G \otimes G$ when $G$ is a general finite metacyclic group, $G=g(a,b; m,n, r, s)$, with $m$ odd. A presentation of $ν(G)$ is obtained from that of $G$ and, consequently, we describe the appropriate relevant sections of $ν(G)$, such as the non-abelian tensor square, the exterior square $G \wedge G$ and the Schur multiplier, $M(G)$.Open AccessThe Non-Abelian Tensor Square of Finite Metacyclic Groups
In this paper, we investigate the group $ν(G)$, an extension of the non-abelian tensor square $G$ by the direct product $G\times G$, in order to determine a presentation of $G \otimes G$ when $G$ is a general finite metacyclic group, $G=g(a,b; m,n, r, s)$, with $m$ odd. A presentation of $ν(G)$ is obtained from that of $G$ and, consequently, we describe the appropriate relevant sections of $ν(G)$, such as the non-abelian tensor square, the exterior square $G \wedge G$ and the Schur multiplier, $M(G)$. - 16 October 2024
- Published by Elsevier in Journal of Algebra
- Vol. 664, 251-267
On the finiteness of the non-abelian tensor product of groups
- 16 October 2024
- Published by Elsevier in Journal of Algebra
- Vol. 664, 251-267
On the finiteness of the non-abelian tensor product of groups
- 26 December 2022
- Published by Springer Nature in Applied Categorical Structures
- Vol. 31 (1) , 1-16
q-Tensor and Exterior Centers, Related Degrees and Capability
- 26 December 2022
- Published by Springer Nature in Applied Categorical Structures
- Vol. 31 (1) , 1-16
q-Tensor and Exterior Centers, Related Degrees and Capability
- Open Access
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)$.Open AccessOn 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)$. - 7 February 2022
- Published by Elsevier in Journal of Algebra
- Vol. 598, 236-253
On some series of a group related to the non-abelian tensor square of groups
- 7 February 2022
- Published by Elsevier in Journal of Algebra
- Vol. 598, 236-253
On some series of a group related to the non-abelian tensor square of groups
- Open Access
- 15 January 2022
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 17 (1) , 1-17
A new 1.375-approximation algorithm for sorting by transpositions
Background: sorting by transpositions(SBT) is a classical problem in genome rearrangements. In 2012, SBT was proven to be $$\mathcal {NP}$$ -hard and the best approximation algorithm with a 1.375 ratio was proposed in 2006 by Elias and Hartman (EH algorithm). Their algorithm employssimplification, a technique used to transform an input permutation $$\pi$$ into asimple permutation $${\hat{\pi }}$$ , presumably easier to handle with. The permutation $${\hat{\pi }}$$ is obtained by inserting new symbols into $$\pi$$ in a way that the lower bound of the transposition distance of $$\pi$$ is kept on $${\hat{\pi }}$$ . The simplification is guaranteed to keep the lower bound, not the transposition distance. A sequence of operations sorting $${\hat{\pi }}$$ can be mimicked to sort $$\pi$$ .Results and conclusions: First, using an algebraic approach, we propose a new upper bound for the transposition distance, which holds for all $$S_n$$ . Next, motivated by a problem identified in the EH algorithm, which causes it, in scenarios involving how the input permutation is simplified, to require one extra transposition above the 1.375-approximation ratio, we propose a new approximation algorithm to solve SBT ensuring the 1.375-approximation ratio for all $$S_n$$ . We implemented our algorithm and EH’s. Regarding the implementation of the EH algorithm, two other issues were identified and needed to be fixed. We tested both algorithms against all permutations of sizen, $$2\le n \le 12$$ . The results show that the EH algorithm exceeds the approximation ratio of 1.375 for permutations with a size greater than 7. The percentage of computed distances that are equal to transposition distance, computed by the implemented algorithms are also compared with others available in the literature. Finally, we investigate the performance of both implementations on longer permutations of maximum length 500. From the experiments, we conclude that maximum and the average distances computed by our algorithm are a little better than the ones computed by the EH algorithm and the running times of both algorithms are similar, despite the time complexity of our algorithm being higher.- 15 January 2022
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 17 (1) , 1-17
Open AccessA new 1.375-approximation algorithm for sorting by transpositions
Background: sorting by transpositions(SBT) is a classical problem in genome rearrangements. In 2012, SBT was proven to be $$\mathcal {NP}$$ -hard and the best approximation algorithm with a 1.375 ratio was proposed in 2006 by Elias and Hartman (EH algorithm). Their algorithm employssimplification, a technique used to transform an input permutation $$\pi$$ into asimple permutation $${\hat{\pi }}$$ , presumably easier to handle with. The permutation $${\hat{\pi }}$$ is obtained by inserting new symbols into $$\pi$$ in a way that the lower bound of the transposition distance of $$\pi$$ is kept on $${\hat{\pi }}$$ . The simplification is guaranteed to keep the lower bound, not the transposition distance. A sequence of operations sorting $${\hat{\pi }}$$ can be mimicked to sort $$\pi$$ .Results and conclusions: First, using an algebraic approach, we propose a new upper bound for the transposition distance, which holds for all $$S_n$$ . Next, motivated by a problem identified in the EH algorithm, which causes it, in scenarios involving how the input permutation is simplified, to require one extra transposition above the 1.375-approximation ratio, we propose a new approximation algorithm to solve SBT ensuring the 1.375-approximation ratio for all $$S_n$$ . We implemented our algorithm and EH’s. Regarding the implementation of the EH algorithm, two other issues were identified and needed to be fixed. We tested both algorithms against all permutations of sizen, $$2\le n \le 12$$ . The results show that the EH algorithm exceeds the approximation ratio of 1.375 for permutations with a size greater than 7. The percentage of computed distances that are equal to transposition distance, computed by the implemented algorithms are also compared with others available in the literature. Finally, we investigate the performance of both implementations on longer permutations of maximum length 500. From the experiments, we conclude that maximum and the average distances computed by our algorithm are a little better than the ones computed by the EH algorithm and the running times of both algorithms are similar, despite the time complexity of our algorithm being higher. - 1 December 2021
- Published by Elsevier in Journal of Algebra
- Vol. 587, 594-612
Finiteness conditions for the box-tensor product of groups and related constructions
- 1 December 2021
- Published by Elsevier in Journal of Algebra
- Vol. 587, 594-612
Finiteness conditions for the box-tensor product of groups and related constructions
- 9 April 2021
- Published by Taylor & Francis in Communications in Algebra
- Vol. 49 (6) , 2491-2504
Some structural and closure properties of an extension of the q-tensor product of groups, q≥0
In this work we study some structural properties of the group q a non-negative integer, which is an extension of the q-tensor product where G and H are normal subgroups of some group L. We establish by simple arguments some closure properties of when G and H belong to certain Schur classes. This extends similar results concerning the case q = 0 found in the literature. Restricting our considerations to the case G = H, we compute the q-tensor square for q odd, where Dn denotes the dihedral group of order 2n. Upper bounds for the exponent of are also established for nilpotent groups G of class which extend to all similar bounds found by Moravec, P. (2008). The exponents of nonabelian tensor products of groups. J. Pure Appl. Algebra. 212(7):1840–1848.- 9 April 2021
- Published by Taylor & Francis in Communications in Algebra
- Vol. 49 (6) , 2491-2504
Some structural and closure properties of an extension of the q-tensor product of groups, q≥0
In this work we study some structural properties of the group q a non-negative integer, which is an extension of the q-tensor product where G and H are normal subgroups of some group L. We establish by simple arguments some closure properties of when G and H belong to certain Schur classes. This extends similar results concerning the case q = 0 found in the literature. Restricting our considerations to the case G = H, we compute the q-tensor square for q odd, where Dn denotes the dihedral group of order 2n. Upper bounds for the exponent of are also established for nilpotent groups G of class which extend to all similar bounds found by Moravec, P. (2008). The exponents of nonabelian tensor products of groups. J. Pure Appl. Algebra. 212(7):1840–1848.- 1 June 2020
- Published by Elsevier in Journal of Algebra
- Vol. 551, 9-22
The q-tensor square of a powerful p-group
- 1 June 2020
- Published by Elsevier in Journal of Algebra
- Vol. 551, 9-22
The q-tensor square of a powerful p-group
- Open AccessSome Structural and Closure Properties of an Extension of the $q$-tensor Product of Groups, $q \geq 0$In this work we study some structural properties of the group $\eta^q(G, H)$, $q$ a non-negative integer, which is an extension of the $q$-tensor product $G \otimes^q H)$, where $G$ and $H$ are normal subgroups of some group $L$. We establish by simple arguments some closure properties of $\eta^q(G,H)$ when $G$ and $H$ belong to certain Schur classes. This extends similar results concerning the case $q = 0$ found in the literature. Restricting our considerations to the case $G = H$, we compute the $q$-tensor square $D_n \otimes^q D_n$ for $q$ odd, where $D_n$ denotes the dihedral group of order $2n$. Upper bounds to the exponent of $G \otimes^q G$ are also established for nilpotent groups $G$ of class $\leq 3$, which extend to all $q \geq 0$ similar bound found by Moravec in [21].Open AccessSome Structural and Closure Properties of an Extension of the $q$-tensor Product of Groups, $q \geq 0$In this work we study some structural properties of the group $\eta^q(G, H)$, $q$ a non-negative integer, which is an extension of the $q$-tensor product $G \otimes^q H)$, where $G$ and $H$ are normal subgroups of some group $L$. We establish by simple arguments some closure properties of $\eta^q(G,H)$ when $G$ and $H$ belong to certain Schur classes. This extends similar results concerning the case $q = 0$ found in the literature. Restricting our considerations to the case $G = H$, we compute the $q$-tensor square $D_n \otimes^q D_n$ for $q$ odd, where $D_n$ denotes the dihedral group of order $2n$. Upper bounds to the exponent of $G \otimes^q G$ are also established for nilpotent groups $G$ of class $\leq 3$, which extend to all $q \geq 0$ similar bound found by Moravec in [21].