RT journal article
T1 The complexity of a numerical semigroup
A1 García García, Juan Ignacio
A1 Moreno Frías, María Ángeles
A1 Rosales, José Carlos
A1 Vigneron Tenorio, Alberto
A2 Matemáticas
K1 Complexity
K1 extension
K1 i-chain
K1 i-pertinentmap
K1 ideal
K1 numerical semigroup
AB Let S and Δ be numerical semigroups.A numerical semigroup Sis an I(Δ)-semigroup if S \ {0} is an ideal of Δ.We denote by J (Δ) = {S |S is an I(Δ)-semigroup}, and we say that Δ is an ideal extension of S if S ∈ J (Δ).In this work,we present an algorithm to build all the ideal extensions of a numerical semigroup.We recursively denote by J_0(N) = N, J_1(N) = J (N) andJ_{ k+1}(N) = J (J_k(N)) forall k ∈ N. The complexity of a numerical semigroup S isthe minimum of the set {k ∈ N | S ∈ J k(N)}. In addition,we introduce an algorithmto compute all the numerical semigroups with fixed multiplicity and complexity.
PB Taylos & francis
SN 1727-933X
YR 2023
FD 2023
LK http://hdl.handle.net/10498/35379
UL http://hdl.handle.net/10498/35379
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026