A realization theorem for sets of lengths in numerical monoids
Résumé
We show that for every finite nonempty set L of integers greater than or equal to 2 there are a numerical monoid H and a squarefree element a ∈ H whose set of lengths L(a) is equal to L.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...