2018/06/28 by M. B. Branco, Branco, M. B., Ignacio Ojeda +3
Computer Science · Mathematics · #11D07 #20M14 #Algebraic structures and combinatorial models #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.1806.11097
openalex publication_date 2018/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our algorithms allow to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number with similar or even higher efficiency that the known ones. They have been implemented in the GAP (http://www.gap-system.org) package NumericalSgps (http://www.gap-system.org/Packages/numericalsgps.html).