Constructing the set of complete intersection numerical semigroups with a given Frobenius number - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2012

Constructing the set of complete intersection numerical semigroups with a given Frobenius number

Pedro A. García-Sánchez
  • Fonction : Auteur
  • PersonId : 924028

Résumé

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and telescopic numerical semigroups, and numerical semigroups associated to an irreducible plane curve singularity. The recursive nature of this procedure allows us to give bounds for the embedding dimension and for the minimal generators of a semigroup in any of these families.
Fichier principal
Vignette du fichier
THE-SET-OF-complete-intersections-with-fixed-frobenius-number.pdf (178.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00688929 , version 1 (18-04-2012)
hal-00688929 , version 2 (22-04-2012)
hal-00688929 , version 3 (19-01-2013)

Identifiants

Citer

Abdallah Assi, Pedro A. García-Sánchez. Constructing the set of complete intersection numerical semigroups with a given Frobenius number. 2012. ⟨hal-00688929v3⟩
131 Consultations
371 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More