Loading [MathJax]/jax/element/mml/optable/GeneralPunctuation.js
Research article

Conductors of Abhyankar-Moh semigroups of even degrees


  • Received: 08 October 2022 Revised: 14 January 2023 Accepted: 07 February 2023 Published: 22 February 2023
  • In their paper on the embeddings of the line in the plane, Abhyankar and Moh proved an important inequality, now known as the Abhyankar-Moh inequality, which can be stated in terms of the semigroup associated with the branch at infinity of a plane algebraic curve. Barrolleta, García Barroso and Płoski studied the semigroups of integers satisfying the Abhyankar-Moh inequality and call them Abhyankar-Moh semigroups. They described such semigroups with the maximum conductor. In this paper we prove that all possible conductor values are achieved for the Abhyankar-Moh semigroups of even degree. Our proof is constructive, explicitly describing families that achieve a given value as its conductor.

    Citation: Evelia R. GARCÍA BARROSO, Juan Ignacio GARCÍA-GARCÍA, Luis José SANTANA SÁNCHEZ, Alberto VIGNERON-TENORIO. Conductors of Abhyankar-Moh semigroups of even degrees[J]. Electronic Research Archive, 2023, 31(4): 2213-2229. doi: 10.3934/era.2023113

    Related Papers:

    [1] Xu Liu, Jun Zhou . Initial-boundary value problem for a fourth-order plate equation with Hardy-Hénon potential and polynomial nonlinearity. Electronic Research Archive, 2020, 28(2): 599-625. doi: 10.3934/era.2020032
    [2] Jon Johnsen . Well-posed final value problems and Duhamel's formula for coercive Lax–Milgram operators. Electronic Research Archive, 2019, 27(0): 20-36. doi: 10.3934/era.2019008
    [3] N. Bazarra, J. R. Fernández, R. Quintanilla . A dual-phase-lag porous-thermoelastic problem with microtemperatures. Electronic Research Archive, 2022, 30(4): 1236-1262. doi: 10.3934/era.2022065
    [4] Gongwei Liu, Mengru Wang, Pengyan Ding . Long-time dynamical behavior for a piezoelectric system with magnetic effect and nonlinear dampings. Electronic Research Archive, 2022, 30(9): 3397-3421. doi: 10.3934/era.2022173
    [5] Peng Gao, Pengyu Chen . Blowup and MLUH stability of time-space fractional reaction-diffusion equations. Electronic Research Archive, 2022, 30(9): 3351-3361. doi: 10.3934/era.2022170
    [6] Noelia Bazarra, José R. Fernández, Ramón Quintanilla . On the mixtures of MGT viscoelastic solids. Electronic Research Archive, 2022, 30(12): 4318-4340. doi: 10.3934/era.2022219
    [7] Kingshook Biswas, Rudra P. Sarkar . Dynamics of $ L^p $ multipliers on harmonic manifolds. Electronic Research Archive, 2022, 30(8): 3042-3057. doi: 10.3934/era.2022154
    [8] Xuemin Fan, Wenjie Zhang, Lu Xu . Global dynamics of a predator-prey model with prey-taxis and hunting cooperation. Electronic Research Archive, 2025, 33(3): 1610-1632. doi: 10.3934/era.2025076
    [9] Rong Chen, Shihang Pan, Baoshuai Zhang . Global conservative solutions for a modified periodic coupled Camassa-Holm system. Electronic Research Archive, 2021, 29(1): 1691-1708. doi: 10.3934/era.2020087
    [10] María Guadalupe Morales, Zuzana Došlá, Francisco J. Mendoza . Riemann-Liouville derivative over the space of integrable distributions. Electronic Research Archive, 2020, 28(2): 567-587. doi: 10.3934/era.2020030
  • In their paper on the embeddings of the line in the plane, Abhyankar and Moh proved an important inequality, now known as the Abhyankar-Moh inequality, which can be stated in terms of the semigroup associated with the branch at infinity of a plane algebraic curve. Barrolleta, García Barroso and Płoski studied the semigroups of integers satisfying the Abhyankar-Moh inequality and call them Abhyankar-Moh semigroups. They described such semigroups with the maximum conductor. In this paper we prove that all possible conductor values are achieved for the Abhyankar-Moh semigroups of even degree. Our proof is constructive, explicitly describing families that achieve a given value as its conductor.



    Suzuki [1] and Abhyankar and Moh [2] proved independently that the affine line can be embedded in a unique way, up to ambient automorphisms, in the affine plane. Let us indicate some details of this fact. Let K be an algebraically closed field of arbitrary characteristic. A polynomial mapping σp,q:KK2 defined as σp,q(x,y)=(p(x,y),q(x,y)) is a polynomial embedding of the line K if there is a polynomial map g:K2K such that g(p(t),q(t))=t in K[t]. This is equivalent to the equality K[p(t),q(t)]=K[t].

    An affine curve CK2 is an embedded line if there exists a polynomial embedding σp,q such that σp,q(K)=C. It is easy to check that any embedded line is an irreducible affine curve.

    Let C be an embedded line with a minimal equation f(x,y)=0. After [2], the curve C has only one place at infinity, that is, the closure ¯C of C in the projective plane has only one point O on the line at infinity, and it is unibranch at O (the polynomial f(x,y) is irreducible as an element of the formal power series ring K[[x,y]]). In this case, associated with ¯C we have a numerical semigroup S(¯C) consisting of zero and all intersection numbers of ¯C with all algebroid curves not having ¯C as an irreducible component. By the Bresinsky-Angermüller Theorem ([3] for zero characteristic and [4] for arbitrary characteristic) there exists a (unique) sequence (v0,,vh), called the characteristic at infinity of C, generating S(¯C) where v0 is the degree of C.

    Assume that C is an affine irreducible curve of degree greater than 1 with one branch at infinity and let (v0,,vh) be its characteristic at infinity. Suppose that gcd(degC,ordO¯C)0 (mod char K). Then, after [2]

    gcd(v0,,vh1)vh<v20. (1.1)

    The condition gcd(degC,ordOˉC)0 (mod char K) is automatically satisfied when the characteristic of K is zero, but otherwise it is essential.

    The inequality (1.1) is called the Abhyankar-Moh inequality. Originally, this inequality appears linked to the Puiseux expansion of the given branch at the infinite place (see [2, equality (35)]). The semigroups of integers associated with branches and satisfying the Abhyankar-Moh inequality are called Abhyankar-Moh semigroups of degree v0 (the order of the branch). The Abhyankar-Moh semigroups were studied in [5], where these semigroups with maximum possible conductor, which is equal to (v02)(v01), were described. Later, in [6], a geometric interpretation of the branches with Abhyankar-Moh semigroup and maximum possible conductor was given. It is well known that the conductor of an Abhyankar-Moh semigroup of degree v0 is an even integer belonging to the interval [v01,(v01)(v02)]. Our main result is the following:

    Theorem A. Let n>2 be an even natural number. For any even number c with n1c(n1)(n2), there is an Abhyankar-Moh semigroup of degree n and conductor equal to c.

    In order to prove Theorem A, we start by computing in Section 3, in an algorithmic way, the set of all Abhyankar-Moh semigroups of a fixed degree (see Algorithm 2). Section 4 is devoted to the proof of Theorem A. This proof is constructive, and the algorithms of Section 3 play a fundamental role in it.

    From the computational point of view, it remains, as an open question, to determine the values of conductors reached by the Abhyankar-Moh semigroups of odd degree, but it seems that this poses new computational challenges. From the geometric point of view, the next step would be to geometrically characterize the branches with Abhyankar-Moh semigroups of even degree, studied in this paper, following the line given in [6] for those with the maximum possible conductor.

    A numerical semigroup S is an additive submonoid of N with finite complement in N. It is well known that numerical semigroups are finitely generated, and their minimal generating sets are unique. The largest integer in NS is called the Frobenius number of S. The conductor of S is the Frobenius number of S plus 1.

    Given a finite set A={a1,,at}N, A is the generating set of S when S=Na1++Nat. In this work, when A is the minimal generating set of S, we assume that a1<<at. When we write S=A, we imply that A is the minimal set of generators of S. The cardinality of the minimal generating set of S is called the embedding dimension of S.

    A sequence of positive integers (v0,,vh) is called a characteristic sequence if it satisfies the following two properties:

    (CS1) Put ek=gcd(v0,,vk) for 0kh. Then, ek<ek1 for 1kh and eh=1.

    (CS2) ek1vk<ekvk+1 for 1kh1.

    We put nk=ek1ek for 1kh. Therefore, nk>1 for 1kh and nh=eh1. If h=0, the only characteristic sequence is (v0)=(1). If h=1, the sequence (v0,v1) is a characteristic sequence if and only if gcd(v0,v1)=1 and v0>1. Property (CS2) plays a role if and only if h2.

    Lemma 1. ([5, Lemma 1.1]) Let (v0,,vh) be a characteristic sequence with h2. Then,

    (i) v1<<vh, and v0<v2.

    (ii) Let v1<v0. If v00, (mod v1), then (v1,v0,v2,,vh) is a characteristic sequence. If v00, (mod v1) then (v1,v2,,vh) is a characteristic sequence.

    A semigroup SN is strongly increasing (SI-semigroup) if S{0} and it is generated by a characteristic sequence, that is, S=Nv0++Nvh. We will denote by S=S(v0,v1,,vh) the numerical semigroup generated by the characteristic sequence (v0,v1,,vh).

    A SI-semigroup S(v0,v1,,vh)N is an Abhyankar-Moh semigroup (A-M semigroup) of degree n=v0>1 if it satisfies the Abhyankar-Moh inequality

    eh1vh<n2.

    Observe that the semigroup N=S(n,1) for any nN, so N is an Abhyankar-Moh semigroup of any degree.

    The conductor of the A-M semigroup S=S(v0,v1,,vh) is

    c(S)=hi=1(ni1)viv0+1, (2.1)

    where ni=ei1ei for i{1,,h}. Moreover c(S) is an even integer (see [5, Proposition 1.2]).

    Remark 2. If S=S(v0,v1,,vh) is an A-M semigroup of degree n=v0>1, then v0>v1, since e0v1<e1v2<<eh1vh<n2=v20.

    Let S=S(v0,v1,,vh) be an A-M semigroup of degree n=v0>1. If c(S) is the conductor of S, then, by [5, Theorem 2.2],

    c(S)(n1)(n2). (2.2)

    Moreover,

    c(S)=(n1)(n2) if and only if vk=n2ek1ek for 1kh. (2.3)

    Hence, if SN is an A-M semigroup of degree n>1, its conductor c(S) is an even integer satisfying the inequalities

    n1c(S)(n1)(n2). (2.4)

    By Remark 2 we get that the only A-M semigroup of degree 2 is generated by the characteristic sequence (2, 1). Such a semigroup achieves the upper bound for the conductor, given in (2.2).

    After [5, Proposition 1.2], if (v0,v1,,vh) is a characteristic sequence and S=S(v0,v1,,vh), then {min(v0,v1),v2,,vh1,vh} is a subset of the minimal generating set of S, and v2Nv0+Nv1. Furthermore, for every wS, (v0,v1,,vi,w,vi+1,,vh) is not a characteristic sequence, for every i=0,,h1.

    Let S=S(v0,v1,,vh) be a SI-semigroup. By Lemma 1, the characteristic sequences generating S are the following:

    (v0,v1,v2,,vh).

    ● If v0<v1, (v1,v0,v2,,vh).

    ● If v1<v0 and v00 (mod v1), (v1,v0,v2,,vh).

    ● If v1<v0 and v00 (mod v1), (v1,v2,,vh) and (v2,v1,,vh).

    (kv0,v0,v1,v2,,vh) for every integer k[2,v1/v0] where v0=min(v0,v1), v1=max(v0,v1), and v10 (mod v0).

    As a consequence, we determine the characteristic sequences generating a SI-semigroup given by its minimal generating set.

    Let S=a1,,at be a SI-semigroup. Then, from [5, Corollary 1.4], the characteristic sequences generating S are the following:

    (a1,,at),(a2,a1,a3,,at) and (ka1,a1,a2,,at) for every integer k[2,a2/a1). (2.5)

    Similarly, the possible characteristic sequences generating an A-M semigroup given by its minimal generating set can be described: Let S=a1,,at be a SI-semigroup. If S is an A-M semigroup, then

    S=S(a2,a1,a3,,at), or S=S(ka1,a1,a2,,at) (2.6)

    for every integer k(gcd(a1,,at1)ata1,a2a1). For the first case, S should be an A-M semigroup of degree a2, and it should be of degree ka1 for the second (see [5, Proposition 2.1]).

    Notice that if you want to check whether the semigroup a1,,at is an A-M semigroup, you only need to check whether it is an A-M semigroup of degree a2.

    The A-M semigroups minimally generated by two elements are easy to describe. Whenever b>a>1 are two coprime integers, a,b=S(b,a) is an A-M semigroup of degree b. Furthermore, a,b=S(ka,a,b) is also an A-M semigroup of degree ka for every k(b/a,b/a)N.

    A-M semigroups of higher embedding dimensions are completely characterized by gluings: The gluing of S=a1,,at and N with respect to the positive integers d and f with gcd(d,f)=1 (see [7, Chapter 8]) is the numerical semigroup Nda1++Ndat+Nf. We denote it by Sd,fN.

    Proposition 3. The set ˉS is an A-M semigroup with embedding dimension t3 if and only if ˉS=Sd,fN where S=b1,,bt1 is an A-M semigroup of degree m, and f,d are two coprime integers such that dm2>f>dgcd(b1,,bt2)bt1. Moreover, the degree of ˉS is dm.

    Proof. Consider ˉS=a1,,at. Put d=gcd(a1,,at1), f=at, bi=ai/d for all i=1,,t1, and the SI-semigroup S=b1,,bt1. Trivially, ˉS=Sd,fN. Since ˉS is a SI-semigroup,

    f=at>gcd(a1,,at2)at1/d=dgcd(a1/d,,at2/d)at1/d=dgcd(b1,,bt2)bt1.

    By (2.6), the degree of ˉS equals a2, or ka1 for some integer k>1. If we assume that the degree is a2, then (a2,a1,a3,,at) is a characteristic sequence generating ˉS, and a22>gcd(a1,,at1)at. Thus, (b2,b1,b3,,bt1) is a characteristic sequence generating S, and

    b22=(a2/d)2>gcd(a1,,at1)at/d2>gcd(a1,,at2)at1/d2=gcd(b1,,bt2)bt1.

    Hence, S is an A-M semigroup of degree m=b2.

    Similarly, for the degree ka1, (kb1,b1,b2,,bt1) is a characteristic sequence generating S, and (kb1)2=(ka1/d)2>gcd(b1,,bt2)bt1, so S is an A-M semigroup of degree m=kb1. For both of the previous possibilities, the inequality dm2>f is satisfied.

    Conversely, let S=b1,,bt1 be an A-M semigroup of degree mN and f,d be two coprime integers such that dm2>f>dgcd(b1,,bt2)bt1. Since f>dgcd(b1,,bt2)bt1, ˉS=Sd,fN=db1,,dbt1,f is a SI-semigroup ([8, Theorem 3]). Again, by (2.6), the possible characteristic sequences generating S are (b2,b1,b3,,bt1) and (kb1,b1,b3,,bt1), with degrees b2 and kb1, respectively. Hence, the characteristic sequences generating ˉS are (db2,db1,db3,,dbt,f) and (kdb1,db1,db2,,dbt,f); and by hypothesis, we have the Abhyankar-Moh inequality (dm)2>df. Thus, ˉS is an A-M semigroup of degree dm.

    Let S be an A-M semigroup of degree m, and f>d>1 are two coprime integers such that Sd,fN is also an A-M semigroup of degree dm. Then, by [9, Proposition 10],

    c(Sd,fN)=dc(S)+(d1)(f1), (3.1)

    where c(S) denotes the conductor of S.

    Denote by M(A) the largest element of the minimal system of generators of the numerical semigroup A, and s(A)=min(A{min(A)}), that is, the second element in A. Algorithm 1 computes all the A-M semigroups with conductor less than or equal to a fixed non-negative integer.

    Algorithm 1: Computation of the set of A-M semigroups with conductor less than or equal to c.
    Input: cN{0,1}.
    Output: The set {AA is an A-M semigroup with c(A)c}.
    A{{a,b}1<a<b,gcd(a,b)=1,abab+1c};
    forall k{2,,c1} do

    return A;

    Table 1 illustrates Algorithm 1: We collect all the A-M semigroups with conductor less than or equal to 18. We also give the characteristic sequences associated with the given semigroups.

    Table 1.  A-M semigroups up to conductor 18.
    A-M semigroups Characteristic sequences
    2,3 {(3,2)}
    2,5 {(4,2,5),(5,2)}
    2,7 {(4,2,7),(6,2,7),(7,2)}
    2,9 {(6,2,9),(8,2,9),(9,2)}
    2,11 {(6,2,11),(8,2,11),(10,2,11),(11,2)}
    2,13 {(6,2,13),(8,2,13),(10,2,13),(12,2,13),(13,2)}
    2,15 {(6,2,15),(8,2,15),(10,2,15),(12,2,15),(14,2,15),(15,2)}
    2,17 {(6,2,17),(8,2,17),(10,2,17),(12,2,17),(14,2,17),(16,2,17),(17,2)}
    2,19 {(8,2,19),(10,2,19),(12,2,19),(14,2,19),(16,2,19),(18,2,19),(19,2)}
    3,4 {(4,3)}
    3,5 {(5,3)}
    3,7 {(6,3,7),(7,3)}
    3,8 {(6,3,8),(8,3)}
    3,10 {(6,3,10),(9,3,10),(10,3)}
    4,5 {(5,4)}
    4,7 {(7,4)}
    4,6,13 {(6,4,13)}
    4,6,15 {(6,4,15)}
    4,6,17 {(6,4,17)}

     | Show Table
    DownLoad: CSV

    Let n>1 be an integer. A sequence of integers (d0,,dh) will be called a sequence of divisors of n if di divides di1 for 1ih and n=d0>d1>>dh1>dh=1. In particular, if (v0,v1,,vh) is a characteristic sequence, then (e0,,eh) is a sequence of divisors of n=v0, where ei=gcd(v0,,vi). In this case we will say that (e0,,eh) is the sequence of divisors associated with (v0,,vh).

    Using sequences of divisors, in [5, Proposition 2.3] it was proved that

    (n,nd1,n2d1d2,,n2di1di,,n2dk11) (3.2)

    is a characteristic sequence, and the semigroup generated by it is an A-M semigroup of degree n and conductor (n1)(n2) (which is the maximal possible conductor after (2.2)). Inspired by this idea, using sequences of divisors, we introduce an algorithm for computing all the A-M semigroups for a given degree (Algorithm 2). The following proposition is the key for providing this algorithm.

    Algorithm 2: Computation of the set of A-M semigroups with degree n.
    Input: nN{0,1}.
    Output: The set of the characteristic sequences of A-M semigroups with degree n.
    Fn;
    D{D=(d0,,dh)hN,D is a sequence of divisors of n};
    while D do

    return Fn;

     | Show Table
    DownLoad: CSV

    Proposition 4. Let n2 be an integer and D=(d0,,dh) be a sequence of divisors of n=d0. Then, the characteristic sequence of any A-M semigroup with degree n and sequence of divisors equal to D is of the form (n,d1k1,,dhkh), with 1k1d0d11, di2ki1+1dikid20di1di for any i=2,,h, and gcd(di1di,ki)=1 for i=1,,h.

    Proof. Notice that the condition gcd(di1di,ki)=1 for i=1,,h guarantees that the characteristic sequence (n,d1k1,,dhkh) has associated sequence of divisors equal to D. It remains to check the bounds on the ki. The case h=1 is trivially verified. Suppose h2. Let v0=d0 and vi=diki for any i=1,,h, and assume that (v0,,vh) is the characteristic sequence of an A-M semigroup S of degree n=v0 and associated sequence of divisors (d0,,dh). Since A-M semigroups are SI-semigroups, by the definition of vi, di1ki<di+1ki+1 for all i{1,,h1}. Hence, di1ki+1di+1ki+1. Moreover, since 1<v1<v0, 1k1d0d11; and since dh1kh<d20 and khd20dh11, this is enough to finish the proof when h=2. Consider now that h3. By Proposition 3, S=Sh1dh1,khN where Sh1 is the A-M semigroup of degree d0dh1 generated by the characteristic sequence (d0dh1,d1dh1k1,,dh2dh1kh2,kh1). So, dh2dh1kh1<(d0dh1)2. Then kh1d20dh1dh21, and hence dh1kh1d20dh2dh1. In general, using this process, for any i{3,,h1}, Si=Si1di1,kiN, where Si1 is the A-M semigroup of degree d0di1 generated by the characteristic sequence (d0di1,d1di1k1,,di2di1ki2,ki1). For any i, the condition that Si1 is an A-M semigroup implies that di2di1ki1<(d0di1)2, and di1ki1d20di2di1.

    Algorithm 2 provides a computational method to compute all A-M semigroups with fixed degree. Note that this algorithm supports parallel deployment.

    Table 2 shows all the A-M semigroups with degree eight. Note that, in this example, all the even integers in [n1,(n1)(n2)] are the conductor of some A-M semigroup of degree n=8. In this work, we prove that this is true for all even degrees.

    Table 2.  All the A-M semigroups of degree 8.
    Characteristic sequences Sequences of divisors Conductors
    (8,2,9) (8,2,1) 8
    (8,2,11) (8,2,1) 10
    (8,2,13) (8,2,1) 12
    (8,3) (8,1) 14
    (8,2,15) (8,2,1) 14
    (8,2,17) (8,2,1) 16
    (8,2,19) (8,2,1) 18
    (8,2,21) (8,2,1) 20
    (8,2,23) (8,2,1) 22
    (8,4,9) (8,4,1) 24
    (8,2,25) (8,2,1) 24
    (8,2,27) (8,2,1) 26
    (8,4,10,21) (8,4,2,1) 28
    (8,5) (8,1) 28
    (8,2,29) (8,2,1) 28
    (8,4,10,23) (8,4,2,1) 30
    (8,4,11) (8,4,1) 30
    (8,2,31) (8,2,1) 30
    (8,4,10,25) (8,4,2,1) 32
    (8,4,10,27) (8,4,2,1) 34
    (8,6,25) (8,2,1) 36
    (8,4,10,29) (8,4,2,1) 36
    (8,4,13) (8,4,1) 36
    (8,6,27) (8,2,1) 38
    (8,4,10,31) (8,4,2,1) 38
    (8,6,29) (8,2,1) 40
    (8,4,14,29) (8,4,2,1) 40
    (8,6,31) (8,2,1) 42
    (8,4,14,31) (8,4,2,1) 42
    (8,7) (8,1) 42
    (8,4,15) (8,4,1) 42

     | Show Table
    DownLoad: CSV

    If n>2, (d0,,dh=1) is a sequence of divisors of degree n=d0, and we consider values ki as in Proposition 4, then, by (2.1), the conductor of the A-M semigroup S(n,d1k1,,dhkh) is

    c(S(n,d1k1,,dhkh))=hi=1(di1di)kin+1. (3.3)

    Note that the characteristic sequence given in (3.2) is (n,d1k1,,dhkh) for the maximum values of ki obtained in Proposition 4. Moreover, as a consequence of that, we have the following corollary.

    Corollary 5. Let n>2 be a natural number. Fix a sequence of divisors (d0=n,d1,,dh) of n. The A-M semigroup of the form S(n,d1k1,,dhkh) having the minimum conductor is given by k1=1 and ki=di2diki1+1, for i{2,,h}, and its conductor is h2i=0di(di+11).

    Proof. By (3.3) and according to Proposition 4, the minimum value of conductors of A-M semigroups of the form S(n,d1k1,,dhkh) holds for the minimum values of ki for i=1,,h.

    For h=1, the sequence of divisors (d0,d1,,dh) is (n,1). So, S(n,1)=N, and its conductor is zero, which is equal to the empty sum 1i=0di(di+11).

    Assume that h2. Put k1=1, and for any i{2,,h}, we put ki=di2ki1+1di=di2ki1di+1. Notice that, since di1di is a divisor of di2di, we have gcd(di1di,di2ki1di+1)=1. Thus, the integers k1=1 and ki=di2diki1+1, for i{2,,h}, satisfy Proposition 4; and then, S(n,d1k1,,dhkh) is the A-M semigroup having the minimum conductor for the sequence of divisors (d0=n,d1,,dh).

    Note that, for k1=1 and kq=dq2kq1dq+1, we have k2=d0d2+1, and, in general, kq=1dq1dqq3i=0didi+1+dq2dq+1 for q{2,,h}.

    After (3.3), we get c(S(n,d1k1,,dhkh))=hi=1(di1di)kin+1. Thus,

    c(S(n,d1k1,,dhkh))=hi=1di1kihi=1dikin+1=hi=1di1kihi=2dikid1n+1=hi=1di1kihi=2di(di2diki1+1)d1n+1=dh1khhi=0di+1=dh1(1dh1h3i=0didi+1+dh2+1)hi=0di+1=h2i=0didi+1h2i=0di=h2i=0di(di+11).

    Remark 6. Given an integer n=pα11pαtt2 with p1>p2>>pt prime integers, the maximum length of any sequence of divisors of n is Λ(n)=ti=1αi. Moreover, if we fix h, a length of the sequences of divisors of n, then it allows us to provide a lower bound for the integers which could be realizable as the conductor of an A-M semigroup of degree n with an associated sequence of divisors with length greater than or equal to h: Let us consider that with ch:=min{h2i=0di(di+11)(d0,d1,,dh)isasequenceofdivisorsofn}, if c<ch, then c is not realizable as the conductor of an A-M semigroup of degree n with an associated sequence of divisors with length greater than or equal to h.

    Fix nN, and let Th be the set of sequences of divisors of n with length h. Consider two sequences D,DΛ(n)h=1Th. If D and D have different lengths, we add zeros to the end of the one with the smallest length so that D and D have the same length , and we can compare D and D with the lexicographical order <lex as elements of N. We have

    Proposition 7. Let nN and D=(d0=n,d1,,dh),D=(d0=n,d1,,dh)Λ(n)h=1Th with D<lexD. Then, the value h2i=0di(di+11) is at most h2i=0di(di+11).

    Proof. Let D=(d0=n,d1,,dh) and D=(d0=n,d1,,dh) be two sequences of divisors of n such that D<lexD. We may further assume that d1<d1 (otherwise, d1=d1 and we can truncate both sequences, removing n, and see them as sequences of divisors of d1 instead). Since d1 and d1 are both divisors of n, then they are of the form d1=n/a1 and d1=n/a1 with a1<a1. Now, notice that, since D is a sequence of strictly decreasing divisors of n, we have

    didi12di222d12i1=na12i1,

    for every i{1,,h}. Thus,

    h2i=0di(di+11)=n(d11)+h2i=1di(di+11)n(d11)+h2i=1na12i1(d12i1)n(d11)+h2i=1na12i1(d112i)n(d11)+na1(d11)h2i=1122i1.

    However, iN1/22i1 is a convergent series bounded above by 1. Therefore,

    h2i=0di(di+11)n(d11)+na1(d11)=n(d11)(1+1a1). (3.4)

    We now prove the inequality

    n(d11)(1+1a1)n(d11), (3.5)

    which is equivalent to proving that

    d1+d1a11a1d1.

    We prove a slightly stronger inequality, that is, we have the following inequality:

    d1+d1a1d1na1+na21na1a1+1a211a1a1(a1+1)a21.

    However remember that a1<a1. Hence, a1(a1+1)(a11)(a1+1)=a211a21, so the inequality (3.5) follows. If we plug this in to the inequality (3.4), we obtain

    h2i=0di(di+11)n(d11)n(d11)+h2i=1di(di+11)=h2i=0di(di+11),

    as we wanted to show.

    Table 3 illustrates Proposition 7 for n=105.

    Table 3.  List of sequences of divisors for degree 105 and minimum conductor of the A-M semigroup associated.
    Sequence of divisors Minimum conductor
    (105,1,0,0) 0
    (105,3,1,0) 210
    (105,5,1,0) 420
    (105,7,1,0) 630
    (105,15,1,0) 1470
    (105,15,3,1) 1500
    (105,15,5,1) 1530
    (105,21,1,0) 2100
    (105,21,3,1) 2142
    (105,21,7,1) 2226
    (105,35,1,0) 3570
    (105,35,5,1) 3710
    (105,35,7,1) 3780

     | Show Table
    DownLoad: CSV

    Let Fn be the set of Abhyankar-Moh semigroups of degree n>2. Let En=[n1,(n1)(n2)]2Z. The cardinality of En is

    En={(n1)(n3)+22whennis odd(n1)(n3)+12whennis even. (4.1)

    For any cEn, is there an SFn such that c(S)=c? We will prove that the answer is positive when n is even. However, if n is odd, then this is not true. Indeed, suppose that S is an A-M semigroup of a prime degree n>2. In this case, S=S(v0,v1), where n=v0 is greater than v1, v1>1, and gcd(v0,v1)=1. Hence,

    Fn={(n,v1):2v1n1},

    and the cardinality of Fn is n2. By (4.1), the cardinality of En is (n1)(n3)2+1. Observe that (n1)(n3)2+1>n2 for any n>3. So, for n>3, we conclude that there are values in En which are not realizable as conductors of an A-M semigroup of degree n. Remember that the only A-M semigroup of degree 2 is N. Suppose that n is an even integer greater than 2. First, we will prove that for any c[n1,n222)2N there is an A-M semigroup of degree n and conductor c.

    Lemma 8. Let n4 be an even integer. The only A-M semigroup S of degree n with c(S)=n is the semigroup generated by the characteristic sequence (n,2,n+1).

    Proof. The characteristic sequence (n,2,n+1) determines an A-M semigroup with conductor n. Let us prove the uniqueness. Let S be an A-M semigroup of degree n=c(S) determined by the characteristic sequence (v0=n,v1,v2,,vh). By [5, Proposition 1.2], c(S)=hi=1(ni1)viv0+1 with ni>1 for 1ih. Suppose that h3. Since v1<n<v2<v3<<vh, we get c(S)3i=1(ni1)vin+1>n. On the other hand, if h=1, then c(S)=nv1nv1+1. Since n>v13, c(S)3nnv1+1>n+1.

    Let us suppose that h=2, so e2=1. Since v2n+1, c(S)>(n11)v1+(n22)n. Observe that for n2>2 we get c(S)>n. So, n2=e1=2, n1=n/2, and v1 is an even integer. If v14 then c(S)2n2>n. Hence, v1=2, and consequently, c(S)=n if and only if v2=n+1.

    Lemma 9. Let n4 be an even integer. For any q[0,(n1)(n2)+n41), the semigroup generated by (n,2,n+1+2q) is an A-M semigroup of conductor n+2q.

    Proof. The characteristic sequence (n,2,n+1+2q) determines an A-M semigroup for any even integer q<(n1)(n2)+n41 with sequence of divisors (n,2,1) and c(S(n,2,n+1+2q))=n+2q.

    Corollary 10. For any even integer n4 and c[n1,n222)2N, there is at least one A-M semigroup of degree n and conductor c.

    Now, the target will be to prove that, if n4 is an even integer and c[n222,(n1)(n2)]2N, there is an A-M semigroup of degree n and conductor c. We will do it in several steps.

    Lemma 11. Let n be a natural number such that n=2r4, where r is odd. Let kN be co-prime with r and 1kr1. The sequence (n,2k,v2) determines an A-M semigroup of degree n if and only if it satisfies the following conditions:

    1. v2 is an odd number,

    2. kn+1v22r21.

    Proof. It follows directly from the definition of an A-M semigroup.

    Suppose that (n=2r,2k,v2) defines an A-M semigroup of degree n, where 1kr1 with gcd(r,k)=1, so e0=n=2r>e1=2>e2=1. Denote this semigroup by S(k,v2). The conductor of S(k,v2) equals (r1)2k+v22r+1. Hence, if S(k,v2) and S(k,v2) are two A-M semigroups of degree n with v2<v2, then c(S(k,v2))<c(S(k,v2)). If we fix k, varying v2 we get A-M semigroups attaining the following values for their conductor:

    c(S(k,v2))[2kn2(k+r)+2,kn2(k+r)+2r2]2N.

    Define Il:=[2ln2(l+r)+2,ln2(l+r)+2r2]2N for any 1lr1. Note that for any l1,l2N with l1<l2, Il1Il2 is the empty set if and only if l2r2+l1rl12r1. Since r2+l1rl12r1>r+l12, we obtain that Il1Il2 for every l1N and l2(l1,r+l12]N. We want to show that by also varying the values of k, we construct A-M semigroups covering all possible conductors. For that, we prove the following lemma.

    Lemma 12. Let r,lN where r is odd, lr2 and gcd(l,r)=1. There is a k(l,l+r2]N coprime with r.

    Proof. Let m:=min{nN:r2nl+r2}. Notice that such an integer exists since lr2 by hypothesis. We claim that k:=r2m(l,l+r2] and is coprime with r. Indeed, gcd(r2m,r)=gcd(2m,r)=1, due to r being odd. Moreover, by definition of m, kl+r2. Assume by contradiction that k=r2ml and then 2r2ml+r, that is, r2m1l+r2, which contradicts the minimality of m. Hence, k(l,l+r2]N is as desired.

    Therefore, we conclude the following:

    Proposition 13. Let n be a natural number such that n=2r, where r>1 is odd. For any even number c with n1c(n1)(n2) there is an A-M semigroup of degree n whose conductor is equal to c.

    Proof. It is enough to consider the characteristic sequences (n=2r,2k,v2) defining A-M semigroups. Indeed, take L:={l[1,r1]Ngcd(l,r)=1}={l1,l2,,ls}, with lt<lt+1 for any t{1,,s}. Lemma 4 and its following discussion tell us that, by considering these characteristic sequences, we construct A-M semigroups whose conductors cover all the values in Il1Ils. Moreover, by Lemma 5, we know that IliIli+1 for every i{1,,s1}. Hence, we cover all even integers from the minimum value in Il1 to the maximum value in Ils. Since l1=1 and ls=r1, these values are n and (n1)(n2), respectively. This concludes the proof.

    Remark 14. After Algorithm 1, we get that the A-M semigroups of degree 4 are S1=S(4,2,5), S2=S(4,3) and S3=S(4,2,7), where c(S1)=4 and c(S2)=c(S3)=6. Hence, any cE4 is the conductor of an A-M semigroup of degree 4. Observe that the sequence of divisors of S1 and S3 is (4,2,1), and the sequence of divisors of S2 is (4,1).

    Proposition 15. Let n be a natural number such that n=2kr, where k1, and r>1 is odd. For any even number c with n1c(n1)(n2) there is an A-M semigroup of degree n whose conductor is equal to c.

    Proof. We use induction over k. Notice that for k=1, the statement holds by Proposition 13.

    Let us assume that k2 and that the proposition holds for k1. In addition, Remark 14 already covers the case n=4, and thus we can further assume that n8.

    We first observe that, by Corollary 10, for every even cI1:=[n1,n222), there exists an A-M semigroup of degree n and conductor c. Thus, it remains to prove that the same is true for any c[n222,(n1)(n2)].

    On the one hand, as explained in Lemma 3, S=n2,2,n2+1 is an A-M semigroup with conductor c(S)=n2. One can check that the gluing S=S2,dN=n,4,n+2,f is an A-M semigroup for every odd number f[2n+5,n221]. Furthermore, (3.1) tells us that

    c(S)=2n2+f1=n+f1.

    Hence, through this gluing we have shown that for any even number c belonging to I2:=[3n+4,n22+n2], the semigroup S=n,4,n+2,c+1n is an A-M semigroup with conductor c.

    On the other hand, by the induction hypothesis, for m=n2=2k1r, we can guarantee that, for every even number c[m1,(m1)(m2)], there exists an A-M semigroup Sc of degree m and conductor c. It is not hard to check that the gluing

    S(c,fi)=Sc2,fiN

    is an A-M semigroup of degree 2m=n, for both values: f1=n221 and f2=n223. In addition, again by (3.1), the conductor c(c,fi) of S(c,fi) is

    c(c,fi)=2c+fi1.

    Now, notice the relations

    c(c,f2)=c(c,f1)2

    and

    c(c2,f1)=c(c,f2)2.

    These imply that, by making this gluing and recursively decreasing the value of c, alternating it with both f1 and f2, we can assure the existence of an A-M semigroup of degree n and conductor c, for every even number from the maximum possible value, that is,

    c((m1)(m2),f1)=2(n21)(n22)+n222=(n1)(n2),

    and all the way down to

    c(m,f2)=2n2+n2231=n22+n4.

    Overall, we have shown that, for any even number cI1I2I3 there exists an A-M semigroup of degree n and conductor c, where I3=[n22+n4,(n1)(n2)]. Clearly, I2 and I3 overlap, and we have that I1I2I3=[n1,(n1)(n2)] as long as n8. Thus, the statement follows.

    Let p>1 be a prime number and k be an integer greater than or equal to two. Note that, for every A-M semigroup S of degree n=pk, c(S) is a multiple of p1 (see equation (2.1)). So, c(S)[n1,(n1)(n2)](p1)N.

    Now, we will study the A-M semigroups of degree n=pk, where p is a prime number and kN, k>1. For any natural number k1 with 1k1pk11, we define Ik1:=[1,p2k1pkk11], and

    Ak1:={(pk1)(pk11)+i(p1):iIk1 and gcd(p,i)=1}.

    In the following proposition, we prove that for a fixed n=2k, every value in [n1,(n1)(n2)]2N is the conductor of some A-M semigroup of degree n. Furthermore, the conductors of the A-M semigroups of degree n=pk are provided explicitly for any odd prime integer p, and the sequences of divisors of n that determine these conductors are made explicit.

    Proposition 16. Let p2 be a prime number, and k2 is an integer. Any conductor of an A-M semigroup with degree n=pk is obtained from, at most, two types of sequences of divisors:

    1. For p, a prime odd number, the sequences are (pk,1) and (pk,p,1);

    2. For p=2 and k=2, the sequence is (4,2,1);

    3. For p=2 and k=3, the sequences are (8,2,1) and (8,4,2,1);

    4. For p=2 and k4, the sequence is (2k,2,1).

    Moreover, for any odd prime number p, the set of the conductors of A-M semigroups of degree n is

    (pk2i=1,gcd(p,i)=1{i(pk1)})(pk11k1=1,gcd(p,k1)=1Ak1).

    Proof. Let (pk,pk1,v2) be a characteristic sequence where gcd(p,k1)=gcd(p,v2)=1. Note that the semigroup S(pk,pk1,v2) is an A-M semigroup if and only if pkk1<v2<p2k1. So, we assume that k1[1,pk11] and v2[pkk1+1,p2k11], with k1 and v2 coprime with p. Consider v2=pkk1+i with iIk1=[1,p2k1pkk11] and such that i0modp.

    Thus, c(S)=(pk1)(pk11)+i(p1). Define c(pk,pk1,pkk1+i)=(pk1)(pk11)+(p1)i. This even value belongs to C(k1)(p1)N, where C(k1)=[(pk1)(pk11)+(p1),(pk1)(pk11)+(p1)(p2k1pkk11)], for any iIk1. Note that, for p=2, c(2k,2k1,2kk1+i) takes all the even numbers in C(k1). In addition, for any integer k1 such that k1<k1, we have that

    (C(k1)C(k1))2N(p1)N=[minC(k1),maxC(k1)]2N(p1)N (4.2)

    if and only if minC(k1)maxC(k1)+max{2,p1}.

    Assume that p3 and suppose gcd(p,k1+1)=1. In that case, the condition (4.2) holds for k1+1pk11 iff minC(k1+1)maxC(k1)+p1, that is, iff (p1)(p2k1pkk11)p(pk1)0. Since k1pk12,

    (p1)(p2k1pkk11)p(pk1)(p1)(2pk1)p(pk1)=pk(p2)+1>0.

    Thus, the condition (4.2) holds when gcd(p,k1+1)=1. In the case where p and k1+1 are not coprime, we have that gcd(p,k1+2)=1, and the inequality minC(k1+2)maxC(k1)+p1 is equivalent to (p1)(p2k1pkk11)2p(pk1)0. Again, since k1+2pk11, (p1)(p2k1pkk11)2p(pk1)pk(p3)+p+1>0. We conclude that, for p3, the condition (4.2) always holds. That means that, for every k1[1,pk11] and iIk1 with imodp0, c(pk,pk1,pkk1+i)=(pk1)(pk11)+i(p1)A=[minC(1),maxC(pk11)](p1)N=[n(p1),(n1)(n2)](p1)N. Note that A is the union of the disjoint sets

    Ak1=pk11k1=1,gcd(p,k1)=1{c(pk,pk1,pkk1+i)iIk1, and gcd(p,i)=1},

    and

    Ak1=pk11k1=1,gcd(p,k1)=1{c(pk,pk1,pkk1+i)iIk1, and gcd(p,i)1}.

    The elements of Ak1 are not the conductors of any A-M semigroup of degree n. Suppose there exists an A-M semigroup S of degree n such that its conductor belongs to Ak1. If the characteristic sequence of S is (pk,v1) with gcd(p,v1)=1, then c(S)=(pk1)(v11)=(pk1)(pk11)+i(p1), and (pk1)v1=(pk1)pk1+i(p1). However this is not possible since gcd(pk1,p)=gcd(p,v1)=1. If the length of the characteristic sequence of S is greater than or equal to three, by Proposition 3, there exists an A-M semigroup S, and with and , such that . Thus, by equality (3.1), , and . Since , it does not hold.

    Note that, by Proposition 3 and the equality (3.1), is the smallest conductor of an A-M semigroup of degree that can be obtained from characteristic sequences of length greater than or equal to three. Moreover, the set of the conductors of the A-M semigroups of degree with a characteristic sequence of length two is .

    Summarizing, we have just proved that, for every prime odd number and , the conductor of any A-M semigroup with degree is equal to with satisfying , or it is equal to where and such that . For the first type, their sequences of divisors are , and we have for the second one.

    For , , but . Hence, the condition (4.2) holds if and only if . Using the upper bound of , . It is easy to prove that for any . Therefore, for , every even number in is realizable as the conductor of an A-M semigroup with the sequence of divisors . The particular cases , and are showed in Remark 14 and Table 2, respectively.

    By Proposition 15 and Proposition 16, for , we have the following,

    Theorem A. Let be an even natural number. For any even number with , there is an A-M semigroup of degree and conductor equal to .

    Open question: Characterize the values of conductors of A-M semigroups of odd degree. Note that Proposition 16 solves this question for degree with any prime integer.

    The second and fourth-named authors were supported partially by Junta de Andalucía research groups FQM-343. The first-named author was supported by the grant PID2019-105896GB-I00 funded by MCIN/AEI/10.13039/501100011033. The first and third-named authors were supported partially by MACACO (ULL research project).

    The authors declare there are no conflicts of interest.



    [1] M. Suzuki, Propriétées topologiques des polynômes de deux variables complexes et automorphisms algébriques de l'espace , J. Math. Soc. Japan, 26 (1974), 241–257.
    [2] S. S. Abhyankar, T. T. Moh, Embeddings of the line in the plane, J. reine angew. Math., 276 (1975), 148–166. https://doi.org/10.1515/crll.1975.276.148 doi: 10.1515/crll.1975.276.148
    [3] H. Bresinsky, Semigroups corresponding to algebroid branches in the plane, Proc. Am. Math. Soc., 32 (1972), 381–384. https://doi.org/10.2307/2037822 doi: 10.2307/2037822
    [4] G. Angermüller, Die Wertehalbgruppe einer ebener irreduziblen algebroiden Kurve, Math. Z., 153 (1977), 267–282. https://doi.org/10.1007/BF01214480 doi: 10.1007/BF01214480
    [5] R. D. Barrolleta, E. R. García Barroso, A. Płoski, On the Abhyankar-Moh inequality, Univ. Iagel. Acta Math., 52 (2015), 7–14.
    [6] E. R. García Barroso, J. Gwoździewicz, A. Płoski, Semigroups corresponding to branches at infinity of coordinate lines in the affine plane, Semigroup Forum, 92 (2016), 534–540. https://doi.org/10.1007/s00233-015-9693-5 doi: 10.1007/s00233-015-9693-5
    [7] J. C. Rosales, P. A. García-Sánchez, Finitely Generated Commutative Monoids, Nova Science Pub Inc, 1999.
    [8] E. R. García Barroso, J. I. García-Garcí, A. Vigneron-Tenorio, Generalized strongly increasing semigroups, Mathematics, 9 (2021), 1370. https://doi.org/10.3390/math9121370 doi: 10.3390/math9121370
    [9] C. Delorme, Sous-monoïdes d'intersection complète de , Ann. Sci. É. Norm. Super., 4 (1976), 145–154.
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1658) PDF downloads(60) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog