RT journal article
T1 The Covariety of Saturated Numerical Semigroups with Fixed Frobenius Number
A1 Rosales, José Carlos
A1 Moreno Frías, María Ángeles
A2 Matemáticas
K1 Numerical semigroup
K1 covariety
K1 Frobenius number
K1 genus
K1 saturated numerical semigroup
K1 algorithm
AB In this work, we show that if F is a positive integer, then Sat(F) = {S | S is a saturated numericalsemigroup with Frobenius number F} is a covariety. As a consequence, we present twoalgorithms: one that computes Sat(F), and another which computes all the elements of Sat(F) witha fixed genus. If X ⊆ S\Δ(F) for some S ∈ Sat(F), then we see that there exists the least elementof Sat(F) containing X. This element is denoted by Sat(F)[X]. If S ∈ Sat(F), then we define theSat(F)-rank of S as the minimum of {cardinality(X) | S = Sat(F)[X]}. In this paper, we present analgorithm to compute all the elements of Sat(F) with a given Sat(F)-rank.
PB MDPI
YR 2024
FD 2024
LK http://hdl.handle.net/10498/35409
UL http://hdl.handle.net/10498/35409
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026