Dense numerical semigroups

Dense numerical semigroups

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 with fixed genus, Frobenius number and multiplicity. Furthermore, we solve the Frobenius problem for dense numerical semigroups with emb...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Semigroup forum 2021, Vol.103 (1), p.221-235
Hauptverfasser: Rosales, J. C., Branco, M. B., Faria, M. C.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithms
Mathematics
Mathematics and Statistics
Research Article
Semigroups
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 with fixed genus, Frobenius number and multiplicity. Furthermore, we solve the Frobenius problem for dense numerical semigroups with embedding dimension three.
ISSN:0037-1912
1432-2137
DOI:10.1007/s00233-021-10190-1