Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : 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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00688929
Contributor : Abdallah Assi <>
Submitted on : Saturday, January 19, 2013 - 9:55:47 AM
Last modification on : Monday, March 9, 2020 - 6:16:02 PM
Document(s) archivé(s) le : Saturday, April 20, 2013 - 3:53:38 AM

Files

THE-SET-OF-complete-intersecti...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00688929, version 3
  • ARXIV : 1204.4258

Collections

Citation

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

Share

Metrics

Record views

182

Files downloads

306