A Abbas
email: abbas@univ-angers.fr

A Assi
email: assi@univ-angers.fr

P A Garc

Ía-S Ánchez

CANONICAL BASES OF MODULES OVER ONE DIMENSIONAL K-ALGEBRAS

Let K be a field and denote by K[t], the polynomial ring with coefficients in K. Set A = K[f1, . . . , fs], with f1,

Introduction

Let K be a field of characteristic zero and let f (X, Y ) be a nonzero irreducible element of K[X, Y ]. Let C = {(x, y) ∈ K 2 | f (x, y) = 0} be the plane algebraic curve defined by f . There are some important invariants that can be associated with C: the Milnor number, µ(f ), which is the rank of K[X, Y ]/(f X , f Y ), and the Turina number, ν(f ), which is the rank of K[X, Y ]/(f, f X , f Y ) (where f X , f Y denote the partial derivatives of f ). The first one tells us how singular is the family of curves C λ = {(x, y) | f (x, y) -λ = 0}, and the second one tells us how singular is the curve C. Suppose that C is parametrized by two polynomials X(t), Y (t) ∈ K [t]. In this case, we can associate to f a semigroup, denoted Γ(f ) and defined by Γ(f ) = {d(g(X(t), Y (t)) | g(X, Y ) ∈ K[X, Y ] \ (f )}, where d(g(X(t), Y (t)) denotes the degree in t of g(X(t), Y (t)).

Let A = K[X(t), Y (t)] be the K-algebra generated by X(t), Y (t). Then A is the ring of coordinates of C. If λ(K[t]/A) < +∞, then Γ(f ) is a numerical semigroup, and µ(f ) coincides with the conductor of Γ(f ). Let M = X ′ (t)A + Y ′ (t)A be the A-module generated by the derivatives of X(t), Y (t). The set of degrees in t of elements of M, denoted d(M), defines an ideal of Γ(f ), and from the definition it follows that for all s ∈ Γ(f ), the element s -1 is in d(M). Such an element is called exact. In general, d(M) contains elements that are non exact, and the cardinality of the set of these elements is bounded by the genus of Γ(f ). Furthermore, this cardinality is nothing but the difference µ -ν. Hence the numerical semigroup Γ(f ) and the ideal d(M) offer a good computational approach to the study of these invariants.

This paper has two main goals. Given a K-algebra A = K[f 1 (t), . . . , f s (t)], we first describe an algorithm that computes a system of generators of the ideal consisting of degrees in t of elements of the module M = F 1 (t)A + • • • + F r (t)A (where f 1 (t), . . . , f s (t), F 1 (t), . . . , F r (t) ∈ K[t]). This algorithm uses the one given in [START_REF] Assi | Bases of subalgebras of K[END_REF] in order to compute the semigroup consisting of degrees in t of elements of A. Then we consider the case where A = K[X(t), Y (t)] is the ring of coordinates of the algebraic plane curve parametrized by X(t), Y (t), and K is an algebraically closed field of characteristic zero. It turns out that the curve has one place at infinity, and if f (X, Y ) is a generator of the curve in K[X, Y ], then the semigroup Γ(f ) introduced above, which is the same as the semigroup associated with A, can be calculated from the Abhyankar-Moh theory (see [START_REF] Assi | Numerical Semigroups and Applications[END_REF]). Using this fact and some techniques introduced in Section 6, we characterize the semigroup of polynomial curves when µ -ν ∈ {0, 1, 2}.

Date: March 9, 2017. 2000 Mathematics Subject Classification. 14H20, 14H50, 05E15. The third author is supported by the projects MTM2014-55367-P, FQM-343, and FEDER funds.

1 Proposition 2.2. Let S = r 0 , . . . , r h be a free numerical semigroup with respect to the arrangement (r 0 , . . . , r h ).

i) F(S) = h

i=1 (e i -1)r i -r 0 . ii) For all a, b ∈ Z, if a + b = F(S), then a ∈ S if and only if b / ∈ S. In other words, S is a symmetric numerical semigroup. iii) Ap(S, r 0 ) = h i=1 λ i r i | 0 ≤ λ i < e i for all i ∈ {1, . . . , h} .

2.2. Ideals of numerical semigroups. Let S be a numerical semigroup of N and let I be a nonempty set of N. We say that I is a relative ideal of S if for all (a, s) ∈ I × S, a + S ∈ I (I + S ⊆ I for short) and there exists d ∈ Z such that d + I ⊆ S. This second condition is equivalent to saying that I has a minimum.

Define the following order on Z :

n 1 ≤ S n 2 if n 2 -n 1 ∈ S. Let E ⊂ N.
We say that n ∈ E is a minimal element of E with respect to ≤ S if for all s ∈ E, the condition s ≤ S n implies n = s. We denote by Minimals ≤ S (E) the set of minimal elements of E with respect to ≤ S .

If I is an ideal of S, then there exist a set {a 1 , . . . , a l } ⊆ I such that I = l i=1 (a i + S). We say that {a 1 , . . . , a l } is a system of generators of I. If furthermore a k / ∈ i =k (a i + S), then we say that {a 1 , . . . , a l } is a minimal set of generators of I. Observe that all minimal generators are incongruent modulo m(S), and thus a minimal set of generators of I has at most m(S) elements. This set coincides with Minimals ≤ S (I).

Intersection of two relative ideals is again a relative ideal. In particular, given a, b ∈ N, (a + S) ∩ (b+S) is a relative ideal. Assume that {a 1 , . . . , a r } is the set of minimal generators of (a+S)∩(b+S). We

set R(a, b) = {(a k -a, a k -b), k ∈ {1, . . . , r}}.

Relators for monomial subalgebras

Let S = s 1 , . . . , s n be a numerical semigroup and let I be a relative ideal of S. Let {a 1 , . . . , a r } be a minimal system of generators of I. Let K be a field and consider the algebra

A = K[t s 1 , . . . , t sn ] = K[S]. Let M = t a 1 A + • • • + t ar A and let φ : A r → M, φ(f 1 , . . . , f r ) = t a 1 f 1 + • • • + t ar f r .
The kernel ker(φ) is a submodule of A r . The following result gives explicitely a generating system for ker(φ). Theorem 3.1. Let Sbe a numerical semigroup and let I be a relative ideal of S minimally generated by {a 1 , . . . , a r }. Let ϕ be the morphism

φ : A r → t a 1 A + • • • + t ar A, φ(f 1 , . . . , f r ) = t a 1 f 1 + • • • + t ar f r .
Then ker(φ) is generated by

t α e i -t β e j | i, j ∈ {1, . . . , r}, i = j, (α, β) ∈ R(a i , a j ) ,
where {e 1 , . . . , e r } denotes the canonical basis of A r .

Proof. Let B = t α e i -t β e j | i, j ∈ {1, . . . , r}, i = j, (α, β) ∈ R(a i , a j ) . Clearly, B ⊂ ker(ϕ).

Let f = (f 1 , . . . , f r ) ∈ ker(φ). We have r i=1 t a i f i = 0. Let d i be the degree of f i , and assume that c i t d i is the leading term of f i , i ∈ {1, . . . , r}. As r i=1 t a i f i = 0, there must be i ∈ {2, . . . , r} and a monomial kt s of f i such that a 1 + d 1 = a i + s (s ∈ S). Without loss of generality, we may

think that i = 2. Thus a 1 + d 1 = a 2 + s ∈ (a 1 + S) ∩ (a 2 + S), whence a 1 + d 1 = a 2 + s = γ + s 12 with γ a minimal generator of (a 1 + S) ∩ (a 2 + S) and s 12 ∈ S. Hence (d 1 , s) = (γ -a 1 + s 12 , γ -a 2 + s 12 ). Set (α, β) = (γ -a 1 , γ -a 2 ). Then (α, β) ∈ R(a 1 , a 2 ) and (d 1 , s) = (α + s 12 , β + s 12 )- We can write f = (f 1 , . . . , f r ) = c 1 t s 12 (t α e 1 -t β e 2 )+f ′ , with f ′ = (f ′ 1 , f ′ 2 , f 3 , . . . , f r ), f ′ 1 = f 1 -c 1 t d 1 and f ′ 2 = f 2 + c 1 t d 1 .
In this way, we have killed the leading term of f 1 , and f ′ is again in ker(ϕ). We continue with f ′ until the first component is zero. After that we focus on the second component and so on. We will end up with an expression of the form f (n) = (0, . . . , 0, f

(n) r ) ∈ ker(ϕ). But this leads to f (n) r = 0, since otherwise t ar f (n) r
would not be zero. This concludes the proof.

φ : A 2 → t 3 K[t 3 , t 4 ] + t 5 K[t 3 , t 4 ], φ(f 1 , f 2 ) = t 3 f 1 + t 5 f 2 .
Then ker(φ) is generated by {(t 6 , -t 4 ), (t 8 , -t 6 )}.

In light of Theorem 3.1, we can use the following code in GAP (by using the numericalsgps package) to calculate the kernel of ϕ.

GAP code 1. R and ker functions gap> s:=NumericalSemigroup(3,4); <Numerical semigroup with 2 generators> gap> I:= [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF][START_REF] Assi | Bases of subalgebras of K[END_REF]+s; <Ideal of numerical semigroup> gap> ker(I); [ [START_REF] Berger | Differentialmoduln eindimensionaler lokaler Ringe[END_REF][START_REF] Assi | Numerical Semigroups and Applications[END_REF], [START_REF]GAP -Groups, Algorithms, and Programming[END_REF][START_REF] Berger | Differentialmoduln eindimensionaler lokaler Ringe[END_REF] ]

Basis of a K-algebra

Let K be a field and let

f 1 (t), . . . , f s (t) ∈ K[t]. Let A = K[f 1 , . . . , f s ], which is a subalgebra of K[t].
Assume, without loss of generality, that f i is monic for all i ∈ {1, . . . , s}. Given f (t) = p i=0 c i t i ∈ A, with c p = 0, we set d(f ) = p and M(f ) = c p t p , the degree and leading monomial of f , respectively. We also define supp(f ) = {i | c i = 0}, the support of f . The set d(A) = {d(f ) | f ∈ A} is a submonoid of N. We shall assume that λ A (K[t]/A) < ∞. This implies that d(A) is a numerical semigroup. We say that {f 1 , . . . , f s } is a basis of A if {d(f 1 ), . . . , d(f s )} generates d(A). Clearly, {f 1 , . . . , f s } is a basis of A if and only if

K[M(f ) | f ∈ A] = K[M(f 1 ), . . . , M(f s )]. Proposition 4.1. Given f (t) ∈ K[t]
, there exist g(t) ∈ A and r(t) ∈ K[t] such that the following conditions hold:

(1)

f (t) = g(t) + r(t), (2) if g(t) = 0 (respectively r(t) = 0), then d(g) ≤ d(f ) (respectively d(r) ≤ d(f )), (3) If r(t) = 0, then supp(r(t)) ⊆ N \ d(f 1 ), . . . , d(f s ) . Proof. The assertion is clear if f ∈ K. Suppose that f / ∈ K and let f (t) = p i=0 c i t i with p = d(f ) > 0.
(1) If p / ∈ d(f 1 ), . . . , d(f s ) , then we set g 1 = 0, r 1 = c p t p and

f 1 = f -c p t p . (2) If p ∈ d(f 1 ), . . . , d(f s ) , then t p = M(f 1 ) θ 1 • • • M(f s ) θs ,
for some (θ 1 , . . . , θ s ) ∈ N s (this expression is not necessarily unique). We set

g 1 = c p f θ 1 1 • • • f θs s , r 1 = 0 and f 1 = f -g 1 . With this choice of g 1 and r 1 , we have f = f 1 + g 1 + r 1 , g 1 ∈ A r 1 ∈ K[t]
, and the following conditions hold:

(1) If

r 1 = 0, then supp(r 1 ) ⊆ N \ d(f 1 ), . . . , d(f s ) . (2) If f 1 / ∈ K, then d(f 1 ) < d(f ) = p.
Then we restart with f 1 . Clearly there is

k ≥ 1 such that f k ∈ K. We set g = g 1 + • • • + g k + f k and r = r 1 + • • • + r k .
We denote the polynomial r(t) of Proposition 4.1 by R(f, {f 1 , . . . , f s }). Note that this polynomial is not unique. Proposition 4.2. The set {f 1 , . . . , f s } is a basis of A if and only if R(f, {f 1 , . . . , f s }) = 0 for all f ∈ A.

Proof. Suppose that {f 1 , . . . , f s } is a basis of A and let f ∈ A. Let r(t) = R(f, {f 1 , . . . , f s }). Then r(t) ∈ A. If r = 0, then d(r) ∈ d(f 1 ), . . . , d(f s ) , because {f 1 , . . . , f r } is a basis, and this is a contradiction.

Conversely, given 0

= f ∈ A, if d(f ) / ∈ d(f 1 ), . . . , d(f s ) , then R(f, {f 1 , . . . , f s }) = 0, which is a contradiction. Remark 4.3. Suppose that {f 1 , . . . , f s } is a basis of A. For all f ∈ K[t], R(f, {f 1 , . . . , f s }) is unique. Write f = g 1 + r 1 = g 2 + r 2 ,
and suppose that g i , r i , i ∈ {1, 2} satisfy conditions (1), ( 2) and (3) of Proposition 4.1. We have

g 1 -g 2 = r 2 -r 1 ∈ A. Hence d(r 2 -r 1 ) ∈ d(A), because {f 1 , . . . , f s } is a basis of A. If r 1 = r 2 , then d(r 2 -r 1 ) ∈ supp(r 1 ) ∪ supp(r 2 ). Thus by Proposition 4.1, d(r 2 -r 1 ) ∈ N \ d(f 1 ), . . . , d(f s ) = N \ d(A), which is a contradiction.
Let the notations be as above and let

φ : K[X 1 , . . . , X s ] -→ K[t], φ(X i ) = M(f i ), for all i ∈ {1, . . . , s}.
Let {F 1 , . . . , F r } be a generating system of the kernel of φ. We can choose F i to be a binomial for all i ∈ {1, . . . , r}.

If F i = X α i 1 1 • • • X α i s s -X β i 1 1 • • • X β i s s , we set S i = f α i 1 1 • • • f α i s s -f β i 1 1 • • • f β i s s . Observe that if d = s k=1 α i k d(f k ) = s k=1 β i k d(f k ), then d(S i ) < d. Theorem 4.4. The set {f 1 , . . . , f s } is a basis of A if and only if R(S i , {f 1 , . . . , f s }) = 0 for all i ∈ {1, . . . , r}. s = r k=1 λ k F k with λ k ∈ K[X 1 , . . . , X s ] for all k ∈ {1, . . . , r}. This implies that l i=1 c θ i f θ i 1 1 • • • f θ i s s = r k=1 λ k (f 1 , . . . , f s )S k . By hypothesis, R(S k , {f 1 , . . . , f s }) = 0. So there exists an expression S k = β k c β k f β k 1 1 • • • f β k s s with d(f β k 1 1 • • • f β k s s ) ≤ d(S k ) for all β k such that c β k = 0. Finally we can write f = θ ′ c θ ′ f θ ′ 1 1 • • • f θ ′ s s with max d(f θ ′ 1 1 • • • f θ ′ s s ) | c θ ′ = 0 < p.
We now restart with the new expression of f . This process will stop, yielding a contradiction. Algorithm 4.5. Let the notations be as above.

(1) If R(S k (f 1 , . . . , f s ), {f 1 , . . . , f s }) = 0 for all k ∈ {1, . . . , r}, then {f 1 , . . . , f s } is a basis of A.

(2) If r(t) = R(S k (f 1 , . . . , f s ), {f 1 , . . . , f s }) = 0 for some k ∈ {1, . . . , r}, then we set f s+1 = r(t), and we restart with {f 1 , . . . , f s+1 }.

Note that in this case,

d(f 1 ), . . . , d(f s ) d(f 1 ), . . . , d(f s ), d(f s+1 ) .
This process will stop, giving a basis of A.

Suppose that {f 1 , . . . , f s } is a basis of A. We say that {f 1 , . . . , f s } is a minimal basis of A if {d(f 1 ), . . . , d(f s )} minimally generates the semigroup d(A). We say that {f

1 , . . . , f s } is a reduced basis of A if supp(f i -M(f i )) ∈ N \ d(A) and f i is monic for all i ∈ {1, . . . , s}. Let i ∈ {1, . . . , s}. If d(f i ) is in d(f 1 ), . . . , d(f i-1 ), d(f i+1 ), . . . , d(f s ) , then the set obtained by removing f i , {f 1 , . . . , f i-1 , f i+1 , . . . , f s },
is also a basis of A. Furthermore, by applying the division process of Proposition 4.1 to f i -M(f i ), we can always construct a reduced basis of A. Corollary 4.6. Up to constants, the algebra A has a unique minimal reduced basis.

Proof. Let {f 1 , . . . , f s } and {g 1 , . . . , g s ′ } be two minimal reduced bases of A. Clearly s = s ′ , and equals the embedding dimension of d(A). Let i = 1. There exists j 1 such that d(f 1 ) = d(g j 1 ), because minimal generating systems of a numerical semigroup are unique.

Observe that supp(f 1 -

g j 1 ) ⊆ supp(f 1 -M(g j 1 )) = supp(f 1 -M(f 1 )) ⊆ N \ d(A). Thus, if f 1 -g j 1 / ∈ K \ {0}, then d(f 1 -g j 1 ) / ∈ d(A), which is a contradiction because f 1 -g j 1 ∈ A.
The same argument shows that for all i ≥ 2, there exists j i such that f i -

g j i ∈ K. Corollary 4.7. Let {f 1 , . . . , f s } be a reduced basis of A. For all i ∈ {1, . . . , s}, supp(f i -M(f i )) ⊆ G(d(A). Example 4.8. We compute d(A) for A = K[t 6 + t, t 4 ]; f 1 = t 6 + t and f 2 = t 4 . We start by computing the kernel of φ : K[X 1 , X 2 ] → K[t], with φ(X 1 ) = t 6 and φ(X 2 ) = t 4 . This kernel is generated by F 1 = X 3 2 -X 2 1 . Hence S 1 = 2t 7 + t 2 . Since 7 / ∈ 4, 6
, then we add f 3 = 2t 7 + t 2 to our generating set.

In the next step φ : K

[X 1 , X 2 , X 3 ] → K[t], with φ(X 1 ) = t 6 , φ(X 2 ) = t 4 and φ(X 3 ) = 2t 7 ; ker φ = (X 3 2 -X 2 1 , X 2 3 -4X 1 X 2 2 ), whence S 1 = f 3 and S 2 = f 2 3 -4f 1 f 2 2 = t 4 = f 2 . It turns out that R(S 1 , {f 1 , f 2 , f 3 }) = 0 = R(S 2 , {f 1 , f 2 , f 3 }), and consequently {f 1 , f 2 , f 3 } is a (reduced minimal) basis of A. Also d(A) = 4,

Modules over K-algebras

Let the notations be as in Section 4. In particular {f 1 , . . . , f s } is a set of polynomials of K[t] and

A = K[f 1 , . . . , f s ]. Let {F 1 , . . . , F r } be a set of nonzero elements of K[t], and let M = r i=1 F i A be the A-module generated by F 1 , . . . , F r . We set d(M) = {d(F ), F ∈ M \ 0}. If F ∈ M and g ∈ A then gF ∈ M, hence d(M) is a relative ideal of d(A). Definition 5.1. We say that {F 1 , . . . , F r } is a basis of M if and only if d(M ) = r i=1 (d(F i )+d(A)). Equivalently, {F 1 , . . . , F r } is a basis of M if and only if {d(F 1 ), . . . , d(F r )} is a basis of the ideal d(M) of d(A). Theorem 5.2. Let {f 1 , . . . , f s , F 1 , . . . , F r } be a set of nonzero polynomials of K[t]. Let A = K[f 1 , . . . , f s ]
and M be the A-module generated by {F 1 , . . . , F r }. Given F ∈ K[t], F = 0, there exist g 1 , . . . , g r ∈ A and R ∈ K[t] such that the following conditions hold. [START_REF] Abhyankar | On the semigroup of a meromorphic plane curve, Part I[END_REF]

F = r i=1 g i F i + R. (2) For all i ∈ {1, . . . , r}, if g i = 0, then d(g i ) + d(F i ) ≤ d(F ). (3) If R = 0, then d(R) ≤ d(F ) and d(R) ∈ N \ r i=1 (d(F i ) + d(A)). Proof. The assertion is clear if F ∈ K. Suppose that F / ∈ K and let F (t) = p i=0 c i t i with p = d(f ) > 0.
In order to simplify notation, set S = d(A) and

I = r i=1 (d(F i ) + S). (i) If p / ∈ I, then we set g 1 = • • • = g r = 0, R 1 = c p t p and F 1 = F -R 1 . (ii) If p ∈ I, then c p t p = c θ i t s i M(F i ) for some s i ∈ S and some i ∈ {1, . . . , r}. Let g ∈ A such that M(g) = c θ i t s i . We set g 1 i = g, g 1 j = 0 for all j = i, R 1 = 0 and F 1 = F -gF i . In this way, F = F 1 + r i=1 g 1 i F i + R 1
, and the following conditions hold: (1)

g 1 i ∈ A for all i ∈ {1, . . . , r}. (2) If R 1 = 0, then supp(R 1 ) ⊆ N \ I. (3) If F 1 / ∈ K, then d(F 1 ) < d(F ) = p.
Then we restart with F 1 . Clearly there is k ≥ 1 such that F k ∈ K. We set

g i = g 1 i + • • • + g k i for all i ∈ {1, . . . , r}, and R = R 1 + • • • + R k + F k .
We denote the polynomial R of Theorem 5.2 by R A (F, {F 1 , . . . , F r }). The following GAP code can compute R A (f, {F 1 , . . . , F r }). Here A contains a basis of the algebra A, and M is {F 1 , . . . , F r }. (1) {F 1 , . . . , F r } is a basis of M.

GAP code 2. reduce function

(2) For all F ∈ M, R A (F, {F 1 , . . . , F r }) = 0.

Proof. Suppose that {F 1 , . . . , F r } is a basis of M and let

F ∈ M. If R = R A (F, {F 1 , . . . , F r }) = 0, then d(R) ∈ N \ r i=1 (d(F i ) + d(A)) = N \ d(M). But R ∈ M. This is a contradiction. Conversely suppose that R A (F, {F 1 , . . . , F r }) = 0 for all F ∈ M. Take F ∈ M. If d(F ) ∈ N\ r i=1 (d(F i )+d(A)
), then by construction, R A (F, {F 1 , . . . , F r }) = 0, which is a contradiction. Let F 1 , . . . , F r ∈ K[t] and assume, without loss of generality, that F 1 , . . . , F r are monic. Assume also that {f 1 , . . . , f s } is a reduced basis for A. Let a i be such that M(F i ) = t a i for all i ∈ {1, . . . , r}.

Let (s i , s j ) ∈ R(a i , a j ). Then s i , s j ∈ d(A). Then s i = s l=1 e i l d(f l ) and s j = s l=1 e j l d(f l ), for some e i l , e j l ∈ N. Let g i = s l=1 f e i l l , g j = s l=1 f c j l l ∈ A.
Note that these polynomials may not be unique, there are as many as factorizations of s i and s j , but this amount is finite. Then d(g i ) = s i and d(g j ) = s j , and also M(g i ) = t s i and M(g j ) = t s j (recall that f l is monic for all l). We have t s i M(F i ) -t s j M(F j ) = 0, whence t s i e i -t s j e j ∈ ker(φ) with φ :

A r → M, φ(p 1 , . . . , p r ) = r i=1 p i M(F i ). If F = g i F i -g j F j , then d(F ) < a i + s i = a j + s j .
We call F an S-polynomial of (F 1 , . . . , F r ). Every element of ker(φ) gives rise to an S-polynomial. Let SP(F 1 , . . . , F r ) be the set of S-polynomials of (F 1 , . . . , F r ) constructed this way. The set SP(F 1 , . . . , F r ) has finitely many elements, though for our purposes it will be enough to choose a finite subset of SP(F 1 , . . . , F r ).

Let n ∈ d(A). The set

Z(n) = {(n 1 , . . . , n s ) ∈ N s | n = s i=1 n i d(g i )}
has finitely many elements (usually known as the set of factorizations of n). Let lex denote the lexicographical ordering in N s .

We will consider MinSP(F 1 , . . . , F r ) the set of all elements g i F i -g j F j ∈ SP(F 1 , . . . , F r ) such that, with the above notation, g i = s l=1 f e i l l and g j = s l=1 f c j l l

with (e i 1 , . . . , e is ) = min lex (Z(d(g i )) and (e j 1 , . . . , e js ) = min lex (Z(d(g j )).

In Theorem 5.4 we give a characterization for a set {F 1 , . . . , F r } of M to be a basis of M in terms of MinSP(F 1 , . . . , F r ).

Theorem 5.4. Let {f 1 , . . . , f s , F 1 , . . . , F r } be a set of nonzero polynomials of K[t]. Let A = K[f 1 , . . . , f s ] and M be the A-module generated by {F 1 , . . . , F r }. The following conditions are equivalent:

(

1) {F 1 , . . . , F r } is a basis of M, (2) For all F ∈ MinSP(F 1 , . . . , F r ), R A (F, {F 1 , . . . , F r }) = 0.
Proof. In order to simplify notation, set a i = d(F i ) for all i ∈ {1, . . . , r}, and S = d(A).

(1) implies (2) follows from Proposition 5.3.

For the other implication, we are going to show that for each R ∈ M, d(R) ∈ r i=1 (a i + S). Take R ∈ M. If R = 0, we are done. Otherwise, we can find an expression of the form

R = g 1 F 1 + • • • + g r F r with g 1 , . . . , g r ∈ A. Assume that d(R) ∈ N \ r i=1 (a i + S). Set p = max i, g i =0 (a i + α i ).
Where α i = d(g i ), i ∈ {1, . . . , r}. Then p > d(R). We shall prove that there exists another expression of R, say

R = g ′ 1 F 1 + • • • + g ′ r F r with p > p ′ = max i, g ′ i =0 (a i + d(g ′ i )
). And this eventually leads to a contradiction, since the interval {d(R) + 1, . . . , p} has finitely many elements.

Suppose, without loss of generality, that p = α i +a i , i ∈ {1, . . . , l} and p > α i +a i , ∈ {l+1, . . . , r}. Clearly l ≥ 2. We prove by induction on l that we can rewrite R as

R = g ′ 1 F 1 + • • • + g ′ r F r with p > p ′ = max i,g ′ i =0 (d(g ′ i ) + a i ). (i)
We first suppose that l = 2 and let M(g 1 ) = c g 1 t α 1 , M(g 2 ) = c g 2 t α 2 . It follows from the hypothesis that c g 2 = -c g 1 , and also that α 1 = s + s 1 , α 2 = s + s 2 with (s 1 , s 2 ) ∈ R(a 1 , a 2 ). Hence we have c g 1 t α 1 t a 1 + c g 2 t α 2 t a 2 = c g 1 t s (t s 1 t a 1 -t s 2 t a 2 ).

Let g1 , g2 ∈ A such that M(g 1 ) = t s 1 , M(g 2 ) = t s 2 , and g1 F 1 -g2 F 2 is a minimal S-polynomial.

We have d(g

1 F 1 -g2 F 2 ) < s 1 + a 1 = α 1 -s + a 1 = p -s. By hypothesis, R A (g 1 F 1 - g2 F 2 , {F 1 , . . . , F r }) = 0, and thus g1 F 1 -g2 F 2 = ḡ1 F 1 + ḡ2 F 2 + • • • + ḡr F r , with d( ḡi F i ) ≤ d(g 1 F 1 -g2 F 2 ) < p -s for all i ∈ {1, . . . , r}. We can then rewrite R as R = (g 1 -c g 1 t s g1 )F 1 + (g 2 -c g 2 t s g2 )F 2 + c g 1 t s ḡ1 F 1 + c g 2 t s ḡ2 F 2 + i≥3 g i F i = r i=1 g ′ i F i , with d(g ′ i F i ) < p for all i ∈ {1, . . . , r}. (ii) Now let l > 2 and let M(g i ) = c g i t s i for all i ∈ {1, . . . , r}. We have R = r i=1 g i F i = g 1 F 1 - cg 1 cg 2 g 2 F 2 + ( cg 1 cg 2 + 1)g 2 F 2 + r i=3 g i F i . It follows from (i) that g 1 F 1 - cg 1 cg 2 g 2 F 2 = ḡ1 F 1 + • • • + ḡr F r with max i,ḡ i =0 d(ḡ i F i ) < p. Hence R = g1 F 1 + . . . + gr F r with • g1 = ḡ1 , • g2 = ḡ2 + ( cg 1 cg 2
+ 1)g 2 , • gi = ḡi + g i for i ∈ {3, . . . , r}. In particular, the set {i | d(g i F i ) = p} has at most l -1 elements, and it follows from the induction hypothesis that R = g

′ 1 F 1 + . . . + g ′ r F r with p > p ′ = max i,g ′ i =0 (d(g ′ i ) + d(F i )).
Algorithm 5.5. Let M = r i=1 F i A.

(1) If for all F ∈ MinSP(F 1 , . . . , F r ), R A (F, {F 1 , . . . , F r }) = 0 then, by Theorem 5.4, {F 1 , . . . , F r } is a basis of M. Return {F 1 , . . . , F r }. (2) If R A (F, {F 1 , . . . , F r }) = 0 for some F ∈ SP (F 1 , . . . , F r ), then we set F r+1 = R A (F, {F 1 , . . . , F r }) and we restart with {F 1 , . . . , F r+1 }. Since N \ r i=1 (d(F i ) + S) has finitely many elements, then the procedure stops after a finite number of steps, returning a basis of M.

= t 6 + t, f 2 = t 4 , f 3 = t 7 + 1 2 t 2 } is a basis of d(A). Let M = F 1 A + F 2 A with F 1 = t 3 and F 2 = t 4 . We have (3 + d(A)) ∩ (4 + d(A)) = {10, 11} + d(A). Thus R(3, 4) = {(7, 6), (8, 7)}.
For [START_REF] Delgado | NumericalSgps", A GAP package for numerical semigroups[END_REF][START_REF] Berger | Differentialmoduln eindimensionaler lokaler Ringe[END_REF], 7 = d(f 3 ) and 6 = d(f 1 ) (and these are the only factorizations of 7 and 6 in terms of the generators of d(A)). We have the S-polynomial

f 3 F 1 -f 1 F 2 = t 7 + 1 2 t 2 t 3 -(t 6 + t)t 4 = - 1 2 t 5 .
We take F 3 = t 5 , and as 5 ∈ {3, 4} + d(A), we add it to our system of generators, obtaining {F 1 , F 2 , F 3 }. Now for [START_REF]GAP -Groups, Algorithms, and Programming[END_REF][START_REF] Delgado | NumericalSgps", A GAP package for numerical semigroups[END_REF] we have the S-polynomial

f 2 2 F 1 -f 3 F 2 = t 8 t 3 -t 7 + 1 2 t 2 t 4 = - 1 2 t 6 .
Set F 4 = t

Module of Kähler differentials

Let {f 1 , . . . , f r } be a set of polynomials of K[t] and A = K[f 1 , . . . , f r ]. We shall assume that N \ d(A) is a finite set, in particular d(A) is a numerical semigroup. We shall denote it by S. Let F i = f ′ i (t) for all i ∈ {1, . . . , r}, and let

M = F 1 A + • • • + F r A.
We know that the set

I = d(M) = {d(F ) | F ∈ M} is a relative ideal of S.
Given g ∈ A, we have g ′ (t) ∈ M. In particular, if s ∈ S, then s -1 ∈ I. We say that s -1 is an exact degree. We call the other elements of I non exact degrees of M. We denote by NE(M) the set of non exact degrees, that is

NE(M) = {i ∈ I | i + 1 ∈ S}.
Let ne(M) be the cardinality of NE(M). It follows that ne(M) ≤ g(S), the genus of S. Example 6.1. Let x(t) and y(t) be polynomials of degree 3 and 4 respectively. As gcd(3, 4) = 1, {x(t), y(t)} is a basis for A = K[x(t), y(t)] and S = d(A) = 3, 4 . Set M = x ′ (t)A + y ′ (t)A. Then I = d(M) contains the ideal J = (2, 3) + S. The lattice of ideals of S containing J is the following. gap> s:=NumericalSemigroup [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF][START_REF] Assi | Numerical Semigroups and Applications[END_REF];; gap> oi:=overIdeals([2,3]+s); [ <Ideal of numerical semigroup>, <Ideal of numerical semigroup>, <Ideal of numerical semigroup>, <Ideal of numerical semigroup>, <Ideal of numerical semigroup> ] gap> List(oi,MinimalGenerators); [ [START_REF] Assi | On quasi-homogeneous curves, Affine Algebraic Geometry[END_REF][START_REF] Assi | Algorithms for curves with one place at infinity[END_REF]

, [ 0, 1, 2 ], [ 0, 2 ], [ 1, 2, 3 ], [ 2, 3, 4 ] ] J ∪ {4} J ∪ {0, 4} J ∪ {1, 4} N J
The set of non exact elements for each ideal is:

gap> List(oi,non exactElements);

[ [ ], [ 0, 1, 4 ], [ 0, 4 ], [START_REF] Abhyankar | On the semigroup of a meromorphic plane curve, Part I[END_REF][START_REF] Assi | Numerical Semigroups and Applications[END_REF], [START_REF] Assi | Numerical Semigroups and Applications[END_REF] ] And all these ideals can be realized as d(M ) for some x(t), y(t).

• J = (2, 3) + S = I for (x(t), y(t)) = (t 3 , t 4 ).

• J ∪ {4} = (2, 3, 4) + S = I for (x(t), y(t)) = (t 3 + t 2 , t 4 ).

• J ∪ {0, 4} = (0, 2) + S = I for (x(t), y(t)) = (t 3 , t 4 + t).

• J ∪ {1, 4} = (1, 2, 3) + S = I for (x(t), y(t)) = (t 3 , t 4 + t 2 ).

• N = J ∪ {0, 1, 4} = (0, 1, 2) + S = I for (x(t), y(t)) = (t Proof. In fact, the cardinality of {s | s + 1 / ∈ S} is, in this case, F(S) 2 (see for instance [START_REF] Rosales | Numerical semigroups[END_REF]Chapter 3]).

In the following we shall suppose that r = 2, and that K is an algebraically closed field of characteristic zero. We shall also use the notation X(t), Y (t) for f 1 (t), f 2 (t) and we recall that λ A (K[t]/K[X(t), Y (t)] < +∞. Let f (X, Y ) be the monic generator of the kernel of the map

ψ : K[X, Y ] → K[t], ψ(X) = X(t), ψ(Y ) = Y (t)
. Then f has one place at infinity (see [START_REF] Abhyankar | On the semigroup of a meromorphic plane curve, Part I[END_REF]).

We shall denote S = d(A) by Γ(f ). Given a nonzero polynomial g(X, Y ) ∈ K[X, Y ], the element deg t g(X(t), Y (t)) of Γ(f ) coincides with the rank over K of the K-vector space K[X,Y ] (f,g) (see for instance [START_REF] Assi | Numerical Semigroups and Applications[END_REF]Chapter 4]).

Let f X , f Y denote the partial derivatives of f and let (f -λ) λ∈K be the family of translates of f . Let λ ∈ K and let

V (f -λ) = {P ∈ K 2 | (f -λ)(P ) = 0} be the curve of K 2 defined by f -λ. Given P = (a, b) ∈ V (f -λ), we denote by µ λ P the local Milnor number of (f -λ) at P (if m P = (X-a, Y -b), then µ λ P is defined to be the rank of the K-vector space K[X, Y ] m P /(f, g)K[X, Y ] m P ).
We say that f -λ is singular at P if µ λ P > 0, otherwise, P is a smooth point of f -λ. We say that f -λ is singular if f -λ has at least one singular point. In our setting, if f -λ is singular, then it has a finite number of singular points. Furthermore, there is a finite number of translates of f which are singular. Let µ(f

) = dim K K[X,Y ] (f X ,f Y ) , then µ(f ) = λ∈K P ∈V (f -λ) µ λ P ,
that is, µ(f ) is the sum of local Milnor numbers at the singular points of the translates of f . Write

X(t) = t n + α 1 t n-1 + • • • + α n and Y (t) = t m + β 1 t m-1 + • • • + β m and
suppose, without loss of generality, that m < n and also (by taking the change of variables

t 1 = t + β 1 m ) that β 1 = 0. We can express f (X, Y ) as f (X, Y ) = Y n + a 1 (X)Y n-1 + • • • + a n (X). Clearly n, m ∈ Γ(f ). Let d be a divisor of n and let g(X, Y ) be a Y -monic polynomial of degree n d in Y . Let f = g d + c 1 (X, Y )g d-1 + • • • + c d (X, Y ) with deg Y c i (X, Y ) < n
d for all i ∈ {1, . . . , d}, the expansion of f with respect to g. We say that g is a dth approximate root of f if c 1 (X, Y ) = 0. It is well known that a dth approximate root of f exists and it is unique. We denote it by App(f, d). With these notations we have the following algorithm that computes a set of generators of Γ(f ) (see for instance [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF]). Algorithm 6.3. Let r 0 = m = d 1 and let r 1 = n. Let d 2 = gcd(r 0 , r 1 ) = gcd(r 1 , d 1 ) and let g 2 = App(f, d 2 ). We set r 2 = d(g 2 (X(t), Y (t))) and d 3 = gcd(r 2 , d 2 ) and so on.

It follows from [START_REF] Abhyankar | On the semigroup of a meromorphic plane curve, Part I[END_REF] that there exists h > 1 such that d h+1 = 1, and also that Γ(f ) = r 0 , r 1 , . . . , r h .

We set e k = d k d k+1 for all k ∈ {1, . . . , h}.

The following Proposition gives the main properties of Γ(f ).

Proposition 6.4. Let f , r i , d i , and e i be defined as above. We have the following:

(1) Γ(f ) is free with respect to the arrangement (r 0 , r 1 , . . . , r h ).

(2) r k d k > r k+1 d k+1 for all k ∈ {1, . . . , h}.

Let q 1 (T ) = T + k≥1 b k T -k and set l 1 (γ(t)) = γ(q 1 (T )) (in particular l 1 (t) = q 1 (T )). Since deg t (t -l(q 1 (T )) ≤ -k for all k ≥ 0, then t = l(q 1 (T )). This proves that l is surjective, hence an ismorphism. Note that l 1 = l -1 because l(l 1 (t)) = t.

Let us make the following change of variables

T = t(1 + β 2 t -2 + • • • + β m t -m ) 1 m = t 1 + 1 m β 2 t -2 + . . . = q(t).
This change of variables defines a map l : K((T )) → K((t)), l(T ) = q(t). It follows from Lemma 6.6 that l is an isomorphism. Let X 1 (T ) = X(l -1 (t)) and Y 1 (T ) = Y (l -1 (t)). We have

Y 1 (T ) = T m and X 1 (T ) = T n + p<n c p T p ,
for some c p ∈ K, and we can easily verify that for all g(X, Y

) ∈ K[X, Y ], d(g(X(t), Y (t))) is also the degree in T of g(X 1 (T ), Y 1 (T )). Furthermore, d dt (g(X(t), Y (t))) = d dT (g(X 1 (T ), Y 1 (T ))) dT dt .
Recall that the Newton-Puiseux exponents of f are defined as follows: let m 1 = -n and let D 2 = gcd(m, n) = d 2 . For all i ≥ 2 define -m i = max{p | D i ∤ p} and D i+1 = gcd(D i , m i ). We have D h+1 = d h+1 = 11 and D i = d i for all i ∈ {1, . . . , h} (the d i where defined in Algorithm 6.3).

The Newton-Puiseux exponents are related to the sequence r 0 , . . . , r h by the following relation:

r 0 = m,
= r 1 e 1 + m 2 -m 1 = r 1 e 1 -m 2 -r 1 = (e 1 -1)r 1 -m 2 . Hence -m 2 < r 2 .
Let λ = max{p | p < n, c p = 0} and suppose that λ > -∞. We have:

X 1 (T ) = T n + c λ T λ + . . . and Y 1 (T ) = T m .
The hypothesis on λ implies that c λ = 0. Let

W (T ) = mX ′ 1 (T )Y 1 (T ) -nY ′ 1 (T )X 1 (T ). We have W (T ) = (mλ -nm)c λ T m+λ-1 + . . . . If m + λ /
∈ Γ(f ), then m + λ -1 is a non exact degree. Suppose that m + λ ∈ Γ(f ). We have then the following two possibilities.

( (

) m + λ = n. Let in this case Y 2 = Y 1 + α, α ∈ K * . We have W (T ) = mX ′ 1 (T )Y 2 (T ) -nY ′ 2 (T )X 1 (T ) = [(mλ -nm)c λ -αmn]T n-1 + • • • Hence, if α = λ-n 1
n c λ = -m n c λ , then W (T ) has degree strictly less than n -1. As an example of this case, let X(t) = t 9 + t 5 , Y (t) = t 4 . We have W (t) = 16t 8 and 8 + 1 = 9 ∈ d(A). If Ȳ = t 4 + 4 9 , then W (t) = mX ′ (t) Ȳ (t) -n Ȳ ′ (t)X(t) = -80 9 t 4 and 4 + 1 / ∈ d(A). (2) m + λ = θm. In this case, λ = (θ -1)m. The change of variables

X 2 = X 1 -Y θ-1 1 , Y 2 = Y 1 is such that either (X 2 , Y 2 ) = (T n , T m ) or X 2 = T n + c λ 1 T λ 1 + . . . , Y 2 = T m with λ 1 < λ.
As an example of this case, let X(t) = t 7 , Y (t) = t 4 + t. We have W (t) = -21t 7 and 7 + 1 = 8 = 2.4 ∈ d(A). Let Y 1 = T 4 . Then T 4 = t 4 + t, T = t(t -3 + 1) 1 4 , and

X 1 (T ) = T 7 -1 4 T 4 + 7 16 T +. . .. If X 2 = X 1 + 1 4 Y 1 , Y 2 = Y 1 , then X 2 = T 7 + 7 16 T +• • • , Y 2 = T 4 and mX ′ 2 (T )Y 2 (T ) -nY ′ 2 (T )X 2 (T ) = 21
2 T 4 + . . ., with 4 + 1 = 5 / ∈ d(A). We shall prove that these two processes will eventually stop. This is clear for the first case since we are constructing a strictly increasing sequence of nonnegative integers. In the second case, if h ≥ 2 then this is clear since the set of integers in the interval [λ, -m 2 ] is finite. Suppose that h = 1, that is, gcd(m, n) = 1. If the process is infinite, then after a finite number of steps we will obtain a new parametrization of the curve of the form X = T n + αT -l + . . . , Ỹ = T m with l > nm, which is a contradiction.

It follows that either we get a parametrization (τ n , τ m ) of the curve V (f ) (which means that the equation of this curve is

W n -Z m with K[X, Y ] ≃ K[Z, W ] and gcd(n, m) = 1), or we get a new parametrization Z(t) = t n + a 1 t α 1 + • • • + a n , W (t) = t m + b 1 t β 1 + • • • + b m such that the degree of W (t) = mZ ′ (t)W (t) -nW ′ (t)Z(t) is a non exact element of I.
We then get the follwong result.

Theorem 6.7. (see also [START_REF] Assi | On quasi-homogeneous curves, Affine Algebraic Geometry[END_REF]) Let X(t

) = t n + a 1 t n-1 + • • • + a n , Y (t) = t m + b 1 t m-1 + • • • + b m be the equations of a polynomial curve in K 2 and let f (X, Y ) be the minimal polynomial of X(t), Y (t), that is, f (X, Y ) is the resultant in t of (X -X(t), Y -Y (t)). Let M = X ′ (t)A + Y ′ (t)A be the A-module generated by X ′ (t), Y ′ (t). The following conditions are equivalent. i) The equality µ(f ) = ν(f ) holds. ii) Every element of the ideal I = d(M) is exact.
iii) The integers n and m are coprime and there exist an isomorphism K

[X, Y ] → K[Z, W ] such that the image of f (X, Y ) is W n -Z m . Proof. i) ⇐⇒ ii) is clear and ii) =⇒ iii) results from the calculations above. Finally iii) =⇒ i) because W n -Z m ∈ (W n-1 , Z m-1 ).
Let the notations be as above and let

W (t) = mX ′ (t)Y (t) -nY ′ (t)X(t). If W (t) = 0, then mX ′ (t)Y (t) = nY ′ (t)X(t). Hence Y (t) n -X(t) m = 0. In particular, f (X, Y ) = Y n -X m .
If W (t) = 0 and W (t) is exact, then similar calculations as above show that there exists a change of variables in such a way that the new W is either 0 or its degree is a non exact element. Assume that f (X, Y ) is not equivalent to a quasi-homogeneous polynomial, in particular we may assume that W (t) is not exact. In the following we shall give a bound for the number of non exact elements of I. Proposition 6.8. Let the notations be as above. If ne(M) > 0 then ne(M) ≥ 2 h-1 .

Proof. Consider as above the parametrization X(T

) = T n + c λ T λ + . . . , Y (T ) = T m and let d(W ) = m + λ -1. We have m + λ / ∈ Γ(f ). Furthermore, λ ≥ -m 2 . Let g i (X, Y ) = App(f, d i )
for all i ∈ {1, . . . , h}. We have two cases.

(1) λ > -m 2 . We have m + λ = -am + bn with a, b ∈ N, a > 0, 0 ≤ b ≤ e 1 . Hence, for all (α 2 , . . . , α h ) ∈ N h-1 , if α i < e i , then for every i ∈ {2, . . . , h}, the degree of

g α 2 2 • • • g α h h W is not exact, hence ne(M) ≥ 2 h-1 . (2) λ = -m 2 . We have m + λ = m -m 2 = -am + bn + cr 2 with a, b, c ∈ N, a > 0, 0 ≤ b < e 1 , 0 ≤ c < e 2 . But -m 2 = r 2 -(e 1 - 1
. , α h ) ∈ N h-2 , if α i < e i for all i ∈ {3, . . . , h}, then the degree of Y g α 3 3 • • • g α h h W is not exact. It follows that ne(M) ≥ 2 h-1 .
Corollary 6.9. With the notations above. We have the following.

( The case of two non exact elements and h = 1. In this case, Γ(f ) = m, n with m < n and gcd(m, n) = 1. Furthermore, By Corollary 6.9, m + λ ∈ {F(Γ(f )) -n, F(Γ(f )) -m}.

1) If ne(M) = 1, then h = 1, that is, S = m, n with gcd(m, n) = 1. Furthermore, NE(M) = {F(Γ(f )) -1}. (2) If ne(M) = 2, then h ∈ {1, 2}, that is, either Γ(f ) = m, n with gcd(m, n) = 1 or Γ(f ) = m, n, r 2 with d 3 = 1. Furthermore, if h = 1 (respectively h = 2), then NE(M) is either {F(Γ(f )) -1, F(Γ(f )) -m -1} or {F(Γ(f )) -1, F(Γ(f )) -n -1} (respectively NE(M) is either {F(Γ(f ))-1, F(Γ(f ))-n-1} or {F(Γ(f ))-1, F(Γ(f ))-m-1} or {F(Γ(f ))-1, F(Γ(f ))-r 2 -1}).
(1) If m + λ = F(Γ(f )) -m = -2m + (m -1)n, then we get, using the fact that λ < n, 6 > (n -3)(m -2). Hence (m, n) is either (2, 2p + 1), p ≥ 1 or [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF][START_REF] Assi | Numerical Semigroups and Applications[END_REF] or [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF][START_REF] Assi | Bases of subalgebras of K[END_REF] or [START_REF] Assi | Numerical Semigroups and Applications[END_REF][START_REF] Assi | Bases of subalgebras of K[END_REF].

Example 2 . 3 .

 23 Let S = 3, 4 = {0, 3, 4, 6, 7, →} and let a = 3, b = 5. We have 3 + S = {3, 6, 7, 9, 10, →} and 5 + S = {5, 8, 9, 11, 12, →}. Hence (3 + S) ∩ (5 + S) = {9, 11, 12, →} = (9 + S) ∪ (11 + S). Note that {9, 11} is the set of minimal elements of (3 + S) ∩ (5 + S) with respect to ≤ S and that R(3, 5) = {(6, 4), (8, 6)}.

Example 3 . 2 .

 32 Let S = 3, 4 and let I = (3 + S) ∪ (5 + S). Let

1 R

 1 :=function(a,b,s)2 local i, mg;

3 i

 3 :=IntersectionIdealsOfNumericalSemigroup(a+s,b+s);

5 returnExample 3 . 2 ,

 532 List(mg, m->[m-a,m-b]); (mg); for i in [1..n] do for j in [i+1..n] do r:=Union(r,R(mg[i],mg[j],s)); can be calculated as follows.

1

  reduce:=function(A,M,f) 2 local gens,geni,cand,d, fact, c, r, s,a;

3

  gens:=List(A, DegreeOfLaurentPolynomial); 4 s:=NumericalSemigroup(gens);

9 dProposition 5 . 3 .

 953 :=DegreeOfLaurentPolynomial(f); c:=First([1..Length(geni)], i->d-geni[i] in s); r:=f; while c<>fail do fact:=FactorizationsIntegerWRTList(d-geni[c],gens); a:=M[c] * Product(List([1..Length(gens)],i->A[i]ˆfact[1][i])); r:=r-LeadingCoefficient(r) * a/LeadingCoefficient(a); if IsZero(r) then return r; fi; d:=DegreeOfLaurentPolynomial(r); c:=First([1..Length(geni)], i->d-geni[i] in s); Let the notations be as in Theorem 5.2. The following conditions are equivalent:

GAP code 3 . 6 .

 36 generatorsModule generatorsModule:=function(A,M,t) local S, gens, gM, a, b, da, db, i, j, rs, rd, rel, fcta, fctb, C, pair, reduction, n; gens:=List(A, DegreeOfLaurentPolynomial); n:=Length(A); S:=NumericalSemigroup(gens); gM:=ShallowCopy(M); C:=[]; for i in [1..Length(gM)] do for j in [i+1..Length(gM)] (a); db:=DegreeOfLaurentPolynomial(b); rs:=R(da,db,S); reduction:=true; for rel in rs do fcta:=FactorizationsIntegerWRTList(rel[1],gens)[1]; fctb:=FactorizationsIntegerWRTList(rel[2],gens)[1]; rd:=reduce(A,gM, a * Product(List([1..n], i->A[i]ˆfcta[i]))b * Product(List([1..n], i->A[i]ˆfctb[i]))); if not(IsZero(rd)) then C:=Union(C,List(gM, x->[x,rd])); ; while not reduction do reduction:=true; a:=First(gM, x->x<>reduce(A,Difference(gM,[x]),x)); if a<>fail then rd:=reduce(A,Difference(gM,[a]),a); if IsZero(rd) then gM:=Difference(gM,[a]); else gM:=Union(Difference(gM,[a]),[rd]); Let A = K[t 6 + t, t 4 ] be as in Example 4.8, and recall that {f 1

  r 1 = n, and for all k ≥ 1, -r k+1 = -r k e k + (m k+1 -m k ) where we recall that e k = d k d k+1 for all k ∈ {1, . . . , h}. In particular, r 2

  ) λ > -m 2 . In this case, d 2 | λ. Hence λ is in the group generated by n, m. Then m + λ = an + bm for some a, b ∈ N. (2) λ = -m 2 . In this case, m + λ = m -m 2 = an + bm + cr 2 for some a, b, c ∈ N, c = 0. But m -m 2 = m + r 2 -(e 1 -1)r 1 . Thus, m + r 2 -(e 1 -1)r 1 = an + bm + cr 2 . If c ≥ 1, then m -(e 1 -1)r 1 = an + bm + (c -1)r 2 , which is a contradiction because m-(e 1 -1)r 1 = m-(e 1 -1)n < 0. It follows that c = 0, whence m+r 2 -(e 1 -1)r 1 = an+bm, and r 2 = (a + e 1 -1)n + (b -1)m, but d 2 = gcd(n, m) does not divide r 2 . This is again a contradiction. It follows that λ < -m 2 and m + λ = an + bm for some a, b ∈ N. Since n > m > λ then a ≤ 1. Furthermore, if a = 1, then b = 0. Hence one of the following conditions holds.

)r 1 .

 1 Thus m + r 2 -(e 1 -1)r 1 = -am + bn + cr 2 , and since (c -1)r 2 is not divisible by d 2 , we get c = 1, whence (a + 1)m = (e 1 -1 + b)r 1 = (e 1 -1 + b)n. If b = 0, then (e 1 -1)n is divisible by m, which is a contradiction. Hence e -1 -1 + b ≥ 2, which implies that a ≥ 2. Finally m + λ = -am + bn + r 2 with a ≥ 2. Note that d(Y W ) = -(a -1)m + bn + r 2 , and thus d(Y W ) is not exact. Furthermore, for all (α 3 , . .

Proof. ( 1 )

 1 The first assertion results from Proposition 6.8, and obviously NE(M) = {m + λ -1}. If m + λ < F(Γ(f )) then m + λ = -am + bn with a ≥ 1 and b ≤ m -1. If a > 1 then XW is not exact and XW = W . This is a contradiction. If a = 1 then b < m -1 (otherwise m + λ = -a + (m -1)n = F(Γ(f )) which contradicts the hypothesis). But Y W is not exact and Y W = W . This is again a contradiction.(2) The first assertion results from Proposition 6.8. To prove the second assertion, let W 1 have a non exact degree with d(W1 ) < F(Γ(f )) -1 and d(W 1 ) is minimal in ne(M). Suppose first that h = 1. We have d(W 1 ) + 1 = -am + bn with a ≥ 1 and 0 ≤ b ≤ m -1. If a ≥ 2 and b < m -1, then XW 1 , Y W 1 havealso non exact degrees, and thus ne(M) ≥ 3, which is a contradiction. Consequently either a = 1 or b= m-1. If a = 1, then b < m-1, whence Y W 1 , . . . , Y m-1-b W 1 have also non exact degrees. This forces b to be equal to m -2. Consequently NE(M) = {F(Γ(f )) -1, F(Γ(f )) -1 -n}. If b = m -1, then we prove in a similar way that NE(M) = {F(Γ(f )) -1, F(Γ(f )) -1 -m}.Suppose now that h = 2. Then d(W 1 ) + 1 = -an+ bm + cr 2 with a ≥ 1, 0 ≤ b ≤ e 1 -1, 0 ≤ c ≤ e 2 -1,and (a, b, c) = (-1, e 1 -1, e 2 -1) (otherwise d(W 1 ) + 1 = d(F(Γ(f ))). This forces ne(M) to be equal to 1 by the minimality of d(W 1 )). On the other hand, ne(M) = 2 forces (a, b, c) to be either (-1, e 1 -2, e 2 -1) (and thus NE(M) = {F(Γ(f )) -1, F(Γ(f )) -m -1}) or (-2, e 1 -1, e 2 -1) (hence NE(M) = {F(Γ(f )) -1, F(Γ(f )) -n -1}) or (-1, e 1 -1, e 2 -2) (in this case NE(M) = {F(Γ(f )) -1, F(Γ(f )) -r 2 -1}).In the following we shall give more precise information when ne(M) ∈ {1, 2}. The case of one non exact element. In this case h = 1, Γ(f ) = m, n with m < n and gcd(m, n) = 1. Furthermore, m + λ = F(Γ(f )) = -m + (m -1)n < m + n because λ < n. This implies that (m -2)n < 2m < 2n. In particular, m < 4. If m = 2, then n = 2p + 1 for some p ≥ 1. If m = 3, then n < 2m = 6 and n > m = 3 implies that either n = 4 or n = 5.

( 2 )

 2 If m + λ = F(Γ(f )) -n = -m + (m -2)n, then we get that 4 > (n -2)(m -3). In particular, (m, n) is either (2, 2p + 1) with p ≥ 1, or (3, n) with n ≥ 4 and gcd(3, n) = 1, or[START_REF] Assi | Numerical Semigroups and Applications[END_REF][START_REF] Assi | Bases of subalgebras of K[END_REF].The case of two non exact elements and h = 2. Let Γ(f ) = m, n, r 2 and let the notations be as above. Since F(Γ(f )) -1 is a non exact element of I, we have m+ λ ∈ {F(Γ(f )), F(Γ(f ))m, F(Γ(f )) -n, F(Γ(f )) -r 2 }. (1) If m + λ = F(Γ(f )) = -m + (e 1 -1)n + (e 2 -1)r 2 , then λ = -m 2 = r 2 -(e 1 -1)n (because otherwise λ > -m 2 ,whence d 2 divides λ and consequently m + λ is in d 2 Z, which is a contradiction). This implies that m + r 2 -(e 1 -1)n = -m + (e 1 -1)n + (e 2 -1)r 2 . Since d 2 = gcd(m, n) does not divide ir 2 for all 1 ≤ i ≤ e 2 -1, we deduce that e 2 = 2. This implies that m -(e 1 -1)n = 0, which is a contradiction since m < n. (2) Suppose that m + λ = F(Γ(f )) -r 2 = -m + (e 1 -1)n + (e 2 -2)r 2 . If e 2 = 2, then by the same argument as in (1), λ = -m 2 = r 2 -(e 1 -1)n. Hence m + r 2 -(e 1 -1)n = -m + (e 1 -1)n + (e 2 -2)r 2 . Since d 2 does not divide ir 2 for all 1 ≤ i ≤ e 2 -1, we obtain e 2 = 3, but m -(e 1 -1)n = 0, which is a contradiction. It follows that e 2 = 2, whence d 2 = 2 and λ > -m 2 (because λ = -2m + (e 1 -1)n and m 2 is not divisible by d 2 ). But

  6, 7 . These computations can be performed with the numericalsgps GAP package.

	gap> SemigroupOfValuesOfCurve_Global([tˆ6+t,tˆ4],"basis");
	[ tˆ4, tˆ6+t, tˆ7+1/2 * tˆ2 ]
	Or if we just want to calculate d(A):
	gap> s:=SemigroupOfValuesOfCurve_Global([tˆ6+t,tˆ4]);;
	gap> MinimalGenerators(s);
	[ 4, 6, 7 ]

  Proposition 6.2. Let the notations be as above. If S is symmetric, then ne(M) ≤ F(S) 2 .

	[ 1, t, tˆ2 ]
	gap> A:=[tˆ3,tˆ4];;
	gap> generatorsKhalerDifferentials(A,t);
	[ tˆ2, tˆ3 ]
	gap> A:=[tˆ3+tˆ2,tˆ4];;
	gap> generatorsKhalerDifferentials(A,t);
	[ tˆ2+2/3 * t, tˆ3, tˆ4 ]
	gap> A:=[tˆ3,tˆ4+t];;
	gap> generatorsKhalerDifferentials(A,t);
	[ 1, tˆ2 ]
	gap> A:=[tˆ3,tˆ4+tˆ2];;
	gap> generatorsKhalerDifferentials(A,t);
	[ t, tˆ2, tˆ3 ]
	gap> A:=[tˆ3+t,tˆ4];;
	gap> generatorsKhalerDifferentials(A,t);

3

+ t, t 4 ).

(3) d(f y (x(t), y(t)) = h i=1 (e i -1)r i . ( 4) C(Γ(f )) = µ(f ) = d(f y (x(t), y(t))) -n + 1.

Proof. See [START_REF] Assi | Numerical Semigroups and Applications[END_REF].

and let x, y be the images of X, Y in B. Let N = Bdx + Bdy be the Bmodule generated by {dx, dy}, and let B be the integral closure of B. Let Ñ = Bdx + Bdy. Let

. If we denote by ℓ(•) the length of the module, then we have the following property. Proposition 6.5. [6, Corollary 2] Let f be defined as above.

In our setting,

2 -ne(M), and it follows that:

2 if and only if ne(M) = g(Γ(f )). In the following, we shall introduce the notion of characteristic exponents of f . Then we shall prove that, after possibly a change of variables, the curve V(f ) has a parametrization in one of the following forms:

(1)

We will need to this end this technical Lemma. Lemma 6.6. Let q(t) = t + i≥1 c i t -i ∈ K((t)) and define the map l : K((T )) → K((t)), α(T ) → α(q(t)). In particular, l(T ) = q(t). Then l is an isomorphism.

Proof. We clearly have l(α(T ) + β(T )) = l(α(T )) + l(β(T )) and l(α(T )β(T )) = l(α(T ))l(β(T )) for all α(T ), β(T ) ∈ K((T )). Furthermore, l(1) = 1 and ker(l) = {0}. We shall now construct the inverse of l by proving that t

We shall do this by induction on k ≥ 1. More precisely we shall prove that for all k ≥ 1, there exist

We shall use the fact that for all k ∈ Z, we can write

i t -i . Hence the assertion is clear. Suppose that the assertion is true for k and let us prove it for k + 1. By hypothesis we have

Thus e 2 = d 2 = 2 and 2m = (2e 1 -3)n = (m -3)n. This yields 6 = (m -3)(n -2). All possible cases lead to a contradiction. These results can be summerized into the following theorem.

and assume that m < n and gcd(m, n) < m. Let f (X, Y ) be the monic irreducible polynomial of K[X, Y ] such that f (X(t), Y (t)) = 0, and let Γ(f ) be the semigroup associated with f . Assume that Γ(f ) is a numerical semigroup and let Γ(f ) = m = r 0 , n = r 1 .r 2 , . . . , r h where r 2 , . . . , r h are constructed as in Algorithm 6. [START_REF] Assi | Algorithms for curves with one place at infinity[END_REF]

Moreover, the following also holds.

(1) If µ(f ) = ν(f ) + 2, then Γ(f ) = m, n and one of the following conditions holds: