Andrés Herrera-Poyatos

Andrés Herrera-Poyatos

Auto-generated profile, based on publicly available information

Andrés Herrera-Poyatos

Departamento de Álgebra, Universidad de Granada, Avenida de Fuente Nueva S/N, E-18071 Granada, España

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
STSiham Tabik
Siham Tabik
DPDaniel Peralta
Daniel Peralta
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
Francisco HerreraFrancisco Herrera
Francisco Herrera

1 January 2018 in Acta Arithmetica
Verified
Journal Article
Closed access
PDF file
BBBartłomiej Bzdęga
Bartłomiej Bzdęga
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
PMPieter Moree
Pieter Moree
The $n$th cyclotomic polynomial $\varPhi _n(x)$ is the minimal polynomial of an $n$th primitive root of unity. Hence $\varPhi _n(x)$ is trivially zero at primitive $n$th roots of unity. Using finite Fourier analysis we derive a formula for $\varPhi _n(x)$

3 May 2019 in Journal of Algebra and Its Applications
Verified
Journal Article
Open access
PDF file
PGPedro A. García-Sánchez
Pedro A. García-Sánchez
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups. We also generalize α -rectangular numerical semigroups to the context of simplicial affine semigroups and study their isolated factorizations. As a consequence of our results, we characterize those complete intersection simplicial affine semigroups with only one Betti minimal element in several ways. Moreover, we define Betti sorted and Betti divisible simplicial affine semigroups and characterize them in terms of gluings and their minimal presentations. Finally, we determine all the Betti divisible numerical semigroups, which turn out to be those numerical semigroups that are free for any arrangement of their minimal generators.

1 April 2026 in Neurocomputing
Verified
Journal Article
Open access
CPCarlos Peláez-González
Carlos Peláez-González
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
CZCristina Zuheros
Cristina Zuheros
DHDavid Herrera-Poyatos
David Herrera-Poyatos
VTVirilo Tejedor
Virilo Tejedor
FHFrancisco Herrera
Francisco Herrera

2 August 2022 in arXiv
Verified
Preprint
Open access
PDF file
PGPedro A. García-Sánchez
Pedro A. García-Sánchez
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups. We also generalize $\alpha$-rectangular numerical semigroups to the context of simplicial affine semigroups and study their isolated factorizations. As a consequence of our results, we characterize those complete intersection simplicial affine semigroups with only one Betti minimal element in several ways. Moreover, we define Betti sorted and Betti divisible simplicial affine semigroups and characterize them in terms of gluings and their minimal presentations. Finally, we determine all the Betti divisible numerical semigroups, which turn out to be those numerical semigroups that are free for any arrangement of their minimal generators.

13 February 2017 in arXiv
Verified
Preprint
Open access
PDF file
AHAndrés Herrera-Poyatos
Andrés Herrera-Poyatos
Francisco HerreraFrancisco Herrera
Francisco Herrera
The lack of diversity in a genetic algorithm's population may lead to a bad performance of the genetic operators since there is not an equilibrium between exploration and exploitation. In those cases, genetic algorithms present a fast and unsuitable convergence. In this paper we develop a novel hybrid genetic algorithm which attempts to obtain a balance between exploration and exploitation. It confronts the diversity problem using the named greedy diversification operator. Furthermore, the proposed algorithm applies a competition between parent and children so as to exploit the high quality visited solutions. These operators are complemented by a simple selection mechanism designed to preserve and take advantage of the population diversity. Additionally, we extend our proposal to the field of memetic algorithms, obtaining an improved model with outstanding results in practice. The experimental study shows the validity of the approach as well as how important is taking into account the exploration and exploitation concepts when designing an evolutionary algorithm.