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

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

2012-04-19

arxiv.org/abs/1204.4258v2

Mathematics

Combinatorics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Constructing the set of complete intersection numerical semigroups with a given Frobenius number does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constructing the set of complete intersection numerical semigroups with a given Frobenius number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing the set of complete intersection numerical semigroups with a given Frobenius number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34492