2014
DOI: 10.1016/j.endm.2014.08.025
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup

Abstract: We give an algorithm to compute the set of primitive elements for an embedding dimension three numerical semigroups. We show how we use this procedure in the study of the construction of L-shapes and the tame degree of the semigroup.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2015
2015
2017
2017

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 13 publications
0
6
0
1
Order By: Relevance
“…A natural way to study ∆(S) passes through a better understanding of M . This is because δ ∈ ∆(S) if and only if (1) there exists x, y ∈ Z(s) for some s ∈ S, such that |x| > |y| and δ = |x| − |y| (= |x − y|), and (2) there is no z ∈ Z(s) such that |x| > |z| > |y|. The first condition relies on M and for the second we introduce the concept of Bézout couples.…”
Section: Bézout Couplesmentioning
confidence: 99%
See 2 more Smart Citations
“…A natural way to study ∆(S) passes through a better understanding of M . This is because δ ∈ ∆(S) if and only if (1) there exists x, y ∈ Z(s) for some s ∈ S, such that |x| > |y| and δ = |x| − |y| (= |x − y|), and (2) there is no z ∈ Z(s) such that |x| > |z| > |y|. The first condition relies on M and for the second we introduce the concept of Bézout couples.…”
Section: Bézout Couplesmentioning
confidence: 99%
“…In practice, when we are only interested in the Delta set, we do not need to keep track of the Bézout couples, just the integers appearing in the greatest common divisor computation. gap> deltasetnsembdim3(1407, 26962, 35413);time; [ 1,2,3,4,7,10,13,23,33,43,76,109,142,251, 393 ] 1 The time is in milliseconds, that is, it takes 1 millisecond to compute ∆(S). The current procedure DeltaSetOfNumericalSemigroup in numericalsgps executed with this example was stopped after one day without an output.…”
Section: Euclid's Algorithm and Delta Setsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to look for primitive elements, we developed an algorithm in [2] that gave us some light to find the family of semigroups that we present in this paper.…”
Section: A Distinguished Infinite Family Of 4-semigroupsmentioning
confidence: 99%
“…. , j k ) ∈ N k fulfilling j 1 s 1 + · · · + j k s k ≡ i 1 s 1 + · · · + i k s k (mod N ), (2) if v = [[j 1 , . .…”
Section: Introductionunclassified