Dense numerical semigroups
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Semigroup Forum- Springer
Abstract
A numerical semigroup S is dense if for all s ∈ S\{0} we have {s − 1, s + 1}∩ S = ∅.
We give algorithms to compute the whole set of dense numerical semigroups withfixed genus, Frobenius number and multiplicity. Furthermore, we solve the Frobenius problem for dense numerical semigroups with embedding dimension three.
Description
Citation
Dense numerical semigroups, J. C. Rosales, M. B. Branco and M. C. Faria, Semigroup Forum volume 103, pages 221–235 (2021)