Global stability of the steady states of an epidemic model incorporating intervention strategies

  • In this paper, we investigate the global stability of the steady states of a general reaction-diffusion epidemiological model with infection force under intervention strategies in a spatially heterogeneous environment. We prove that the reproduction number R0 can be played an essential role in determining whether the disease will extinct or persist: if R0<1 , there is a unique disease-free equilibrium which is globally asymptotically stable; and if R0>1 , there exists a unique endemic equilibrium which is globally asymptotically stable. Furthermore, we study the relation between R0 with the diffusion and spatial heterogeneity and find that, it seems very necessary to create a low-risk habitat for the population to effectively control the spread of the epidemic disease. This may provide some potential applications in disease control.

    Citation: Yongli Cai, Yun Kang, Weiming Wang. Global stability of the steady states of an epidemic model incorporating intervention strategies[J]. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1071-1089. doi: 10.3934/mbe.2017056

    Related Papers:

    [1] Weihua Li, Chengcheng Fang, Wei Cao . On the number of irreducible polynomials of special kinds in finite fields. AIMS Mathematics, 2020, 5(4): 2877-2887. doi: 10.3934/math.2020185
    [2] Shakir Ali, Amal S. Alali, Atif Ahmad Khan, Indah Emilia Wijayanti, Kok Bin Wong . XOR count and block circulant MDS matrices over finite commutative rings. AIMS Mathematics, 2024, 9(11): 30529-30547. doi: 10.3934/math.20241474
    [3] Phitthayathon Phetnun, Narakorn R. Kanasri . Further irreducibility criteria for polynomials associated with the complete residue systems in any imaginary quadratic field. AIMS Mathematics, 2022, 7(10): 18925-18947. doi: 10.3934/math.20221042
    [4] Qian Liu, Jianrui Xie, Ximeng Liu, Jian Zou . Further results on permutation polynomials and complete permutation polynomials over finite fields. AIMS Mathematics, 2021, 6(12): 13503-13514. doi: 10.3934/math.2021783
    [5] Kaimin Cheng . Permutational behavior of reversed Dickson polynomials over finite fields. AIMS Mathematics, 2017, 2(2): 244-259. doi: 10.3934/Math.2017.2.244
    [6] Jovanny Ibarguen, Daniel S. Moran, Carlos E. Valencia, Rafael H. Villarreal . The signature of a monomial ideal. AIMS Mathematics, 2024, 9(10): 27955-27978. doi: 10.3934/math.20241357
    [7] Xiaofan Xu, Yongchao Xu, Shaofang Hong . Some results on ordinary words of standard Reed-Solomon codes. AIMS Mathematics, 2019, 4(5): 1336-1347. doi: 10.3934/math.2019.5.1336
    [8] Varsha Jarali, Prasanna Poojary, G. R. Vadiraja Bhatta . A recent survey of permutation trinomials over finite fields. AIMS Mathematics, 2023, 8(12): 29182-29220. doi: 10.3934/math.20231495
    [9] Shitian Liu . Finite groups for which all proper subgroups have consecutive character degrees. AIMS Mathematics, 2023, 8(3): 5745-5762. doi: 10.3934/math.2023289
    [10] Xiaoer Qin, Li Yan . Some specific classes of permutation polynomials over Fq3. AIMS Mathematics, 2022, 7(10): 17815-17828. doi: 10.3934/math.2022981
  • In this paper, we investigate the global stability of the steady states of a general reaction-diffusion epidemiological model with infection force under intervention strategies in a spatially heterogeneous environment. We prove that the reproduction number R0 can be played an essential role in determining whether the disease will extinct or persist: if R0<1 , there is a unique disease-free equilibrium which is globally asymptotically stable; and if R0>1 , there exists a unique endemic equilibrium which is globally asymptotically stable. Furthermore, we study the relation between R0 with the diffusion and spatial heterogeneity and find that, it seems very necessary to create a low-risk habitat for the population to effectively control the spread of the epidemic disease. This may provide some potential applications in disease control.


    The study of Diophantine equations plays a very important role in number theory, and the integer solutions of Diophantine equations are widely used in cryptography and coding theory. Silverman [1] studied the parametric solution of equation

    X3+Y3=A,

    Li and Yuan [2] proved that the simultaneous Pell equations possess at most one positive integer solution under certain conditions.

    A Diophantine equation of the form

    a1x1+a2x2++atxt=s (1.1)

    is called a multivariate linear Diophantine equation, where s,a1,a2,,at are nonzero integers and t2. It is well known that for any given nonzero integers a and b, there are two integers u and v such that

    ua+vb=(a,b),

    where (a,b) represents the greatest common divisor of a and b. Now we introduce some symbols associated with Eq (1.1) as follows:

    (a1,a2)=d2,(d2,a3)=d3,,(dt1,at)=dt.

    That is, there exist integers u1,u2,,ut and v2,v3,,vt1 such that

    {a1u1+a2u2=d2,d2v2+a3u3=d3,dt1vt1+atut=dt. (1.2)

    Li [3] gave the structure of the general solution of the multivariate linear Diophantine equation.

    Theorem 1.1. ([3]) The multivariate linear Diophantine Eq (1.1) has solutions if and only if dt|s. Furthermore, if dt|s and t4, then the general solutions of Diophantine Eq (1.1) are

    {x1=u1(δ2it1vi+4jtˉaj2ij2visj1+ˉa3s2)+ˉa2s1,x2=u2(δ2it1vi+4jtˉaj2ij2visj1+ˉa3s2)a1d12s1,x3=u3(δ3it1vi+5jtˉaj3ij2visj1+ˉa4s3)d2d13s2,xt1=ut1(δvt1+ˉatst1)dt2d1t1st2,xt=utδdt1d1tst1, (1.3)

    where si(1it1) are arbitrary integers and δ=sd1t,ˉaj=ajd1j for 2jt.

    Let Fq be a finite field of q elements with characteristic p, and Fqn be its extension of degree n, where p is a prime number and n 2 is an integer. Zhu et al. [4] obtained an explicit formula for the number of solutions to the equation

    f(x1)++f(xn)=a

    over Fq. Zhao et al. [5] found an explicit formula for the number of solutions of the two-variable diagonal quartic equation

    x41+x42=c

    over Fq.

    A basis of Fqn over Fq of the form {α,αq,,αqn1} is called a normal basis of Fqn over Fq, and α is called a normal element of Fqn over Fq. An irreducible polynomial f(x) Fq[x] is called a normal polynomial if all the roots of f(x) are normal elements of Fqn over Fq. The trace of α is defined as

    Tr(α)=α+αq++αqn1

    and the trace of f(x) is defined to be the coefficient of xn1. Theorems 1.1 and 1.2 below give a simple criterion to check when an irreducible polynomial is a normal polynomial.

    Theorem 1.2. ([6]) Let n=pe with e1. Then an irreducible polynomial

    f(x)=xn+a1xn1++anFq[x]

    is a normal polynomial if and only if a10.

    Theorem 1.3. ([7]) Let n be a prime different from p, and let q be a primitive root modulo n. Then an irreducible polynomial

    f(x)=xn+a1xn1++anFq[x]

    is a normal polynomial if and only if a10.

    In 2001, Chang([8]) et al. furthermore proved that the conditions in Theorems 1.1 and 1.2 are also necessary.

    Theorem 1.4. ([8]) If every irreducible polynomial

    f(x)=xn+a1xn1++anFq[x]

    with a10 is a normal polynomial, then n is either a power of p or a prime different from p, and q is a primitive root modulo n.

    In 2018, Huang et al. [9] presented a unified proof of Theorems 1.1–1.3 by comparing the number of normal polynomials and that of irreducible polynomials over Fq.

    The factorization of xn1 and its irreducible factors are closely related to the normal elements in Fqn over Fq (see [10, Section 2]). Denote by F(xn1) the set of all distinct monic irreducible factors of xn1 in a given finite field, Φr(x) a r-th cyclotomic polynomial, and φ() the Euler function. Write

    n=mpe,

    where e0 is an integer, p is the characteristic of Fq, and pm. Below are the known results for

    |F(xn1)|=1,2.

    Theorem 1.5. ([11]) The following statements are equivalent:

    (a) |F(xn1)|=1.

    (b) F(xn1) = {x1}.

    (c) n=pe.

    Theorem 1.6. ([11]) The following statements are equivalent:

    (a) |F(xn1)|=2.

    (b) F(xn1) = {x1,1+x++xm1}.

    (c) m is a prime different from p, and q is a primitive root modulo m.

    We summarize the five theorems above into the theorem below:

    Theorem 1.7. The following statements are equivalent:

    (a) Every irreducible polynomial of degree n over Fq with a nonzero trace is a normal polynomial.

    (b) F(xn1){x1,1+x++xn1}.

    (c) (c1) n=pe, or

    (c2) n is a prime different from p, with q being a primitive root modulo n.

    Cao [11] presented a new and unified proof of Theorem 1.6 and also extended Theorem 1.6. In this paper, we give the necessary and sufficient condition for the polynomial xn1 to have s different irreducible factors for a given positive integer s.

    Lemma 2.1 indicates that factorization of xn1 in finite fields is closely related to the cyclotomic polynomials.

    Lemma 2.1. ([12]) Let Fq be a finite field of characteristic p, and let n be a positive integer not divisible by p. Then

    xn1=d|nΦd(x).

    Lemma 2.2. ([13]) Let l be the order of a modulo m, an1 (mod m), then ln.

    Lemma 2.3. ([12]) Let Fq be a finite field and n a positive integer with (q,n)=1. Then the cyclotomic polynomial Φn(x) factors into φ(n)d distinct monic irreducible polynomials in Fq[x] of the same degree d, where d is the order of q modulo n.

    Lemma 2.4 is the well-known theorem about the existence of primitive roots.

    Lemma 2.4. ([14]) Let n be a positive integer. Then n possesses primitive roots if and only if n is of the form 2, 4, pα, or 2pα, where p is an odd prime and α is a positive integer.

    By Lemmas 2.3 and 2.4, we have the following lemma:

    Lemma 2.5. The cyclotomic polynomial Φn(x) is irreducible over Fq if and only if n=2,4,pα,2pα, and q is a primitive root modulo n.

    We define vp(x) to be the greatest power in which a prime p divides x, that is, if vp(x)=α, then pα|x but pα+1x. The following lemma is called the lifting the exponent lemma (LTE):

    Lemma 2.6. ([15]) Let x and y be (not necessarily positive) integers, n be a positive integer, and p be an odd prime such that p|xy and none of x and y is divisible by p. We have

    vp(xnyn)=vp(xy)+vp(n).

    Lemma 2.7. Let p be an odd prime and g be a primitive root modulo p2, with (g,p)=1. Then g is a primitive root modulo pl(l1).

    Proof. We first prove that g is a primitive root modulo pl(l2) by induction on l. Let g be a primitive root modulo pl. The order of g modulo pl+1 is d. We have

    φ(pl)|d,d|φ(pl+1),

    which shows that

    d=pl1(p1)

    or

    d=pl(p1).

    We next prove that

    dpl1(p1).

    According to Euler's theorem, we have

    gpl2(p1)1(mod pl1),

    there exists an integer k such that

    gpl2(p1)=1+kpl1,

    since g is a primitive root modulo pl, we have

    gpl2(p1)1(mod pl),plkpl1,(k,p)=1.

    Obviously, for l2, we have

    2l1l+1

    and

    3(l1)l+1,

    which shows that

    gpl1(p1)=(1+kpl1)p=1+kpl+k2p(p1)2p2(l1)+tp3(l1)+1+kpl(modpl+1),

    where t is an integer and (k,p)=1. It follows that

    gpl1(p1)1+kpl1(mod pl+1).

    Therefore

    dpl1(p1),d=pl(p1),

    and g is a primitive root modulo pl+1.

    We next use the LTE to prove that g is a primitive root modulo p. The Euler's theorem shows that

    gφ(p)1(modp),

    since g is a primitive root modulo p2, we have

    vp(gφ(p)1)=1.

    Let h be the order of g modulo p, then h|φ(p). Similarly, we can obtain

    vp(gh1)=1.

    Let x=gh, y=1, then (p,gh)=1, p|gh1. By the LTE, we have

    vp(gph1)=vp(gh1)+vp(p)=1+1=2,

    which shows that

    p2|gph1,gph1(mod p2),

    if h<φ(p), then ph<φ(p2), a contradiction. Thus h=φ(p), g is a primitive root modulo p.

    Lemma 2.8. Let g be a primitive root modulo pl. Then g is a primitive root modulo 2pl, where g is odd and p and l are the same as mentioned above.

    Proof. Let s be the order of g modulo 2pl. Then

    gs1(mod 2pl),s|φ(2pl).

    So we have

    gs1(mod pl).

    Since g is a primitive root modulo pl, we have φ(pl)|s and hence φ(2pl)|s. So

    s=φ(2pl)

    and g is a primitive root modulo 2pl.

    Combining Lemmas 2.1 and 2.3, we can calculate the number of different irreducible factors for xn1 over Fq. Let m be a positive integer,

    m=pα11pα22pαll

    be its prime decomposition. If

    n=mpe,

    where e0 is an integer, and p is the characteristic of Fq with pm. Then we can calculate that

    |F(xn1)|=mmφ(m)dm,

    where dm denotes the order of q modulo m. Note that there are lk=1(αk+1) items in the summation, where lk=1(αk+1) is the number of factors of m.

    Now assume that s and m are given positive integers, m1,,mt are the t factors of m. Thus, we have

    xn1=ti=1Φmi(x)pe.

    If xn1 factors into s distinct irreducible polynomials in Fq[x], then

    |F(xn1)|=ti=1φ(mi)dmi=s, (3.1)

    there are t items in the summation, the necessary and sufficient condition for

    |F(xn1)|=s

    is determined as follows:

    Observe φ(mi)dmi (i=1,2,,t), and φ(mi) are known; with the difference of q, the values of dmi will also change, that is, the values of φ(mi)dmi will change in the different Fq. Therefore, the t items in (3.1) can be regarded as t variables, and (3.1) can be regarded as the Diophantine equation with t variables

    x1+x2++xt=s. (3.2)

    Remark 3.1. Combining Lemma 2.2 and Euler's theorem, we know that φ(mi)dmi (i=1,2,,t) are positive integers. So we only need to consider the positive integer solutions of (3.2).

    Remark 3.2. The positive integers s and t satisfy ts. Otherwise, if t>s, then it follows from Lemmas 2.1 and 2.3 that

    |F(xn1)|>s.

    Remark 3.3. As we all know

    Φ1(x)=x1

    is a factor of xn1, and x1 is irreducible over Fq; the order of q modulo 1 is d1=1. Thus, at least one positive integer solution of (3.2) whose value is 1.

    We can find the positive integer solutions of (3.2). Without loss of generality, we suppose that

    xi=φ(mi)dmi=ki (i=1,2,,t) (3.3)

    is the positive integer solution of (3.2), thus we have

    dmi=φ(mi)ki (i=1,2,,t). (3.4)

    If there exists q such that the order of q modulo mi is

    dmi=φ(mi)ki  (i=1,2,,t),

    then it follows from Lemma 2.3 that Φmi(x) factors into

    φ(mi)φ(mi)ki=ki

    distinct monic irreducible polynomials over Fq of the same degree

    dmi=φ(mi)ki.

    Therefore, we have

    |F(xn1)|=k1+k2++kt=s,

    that is, xn1 factors into s distinct irreducible polynomials over Fq.

    In conclusion, we have the following result:

    Theorem 3.4. (Main result) Let Fq denote the finite field of q elements with characteristic p. Let p be a prime. Let

    n=mpe

    with e0, pm. Let s be a positive integer. The t factors of m are m1,m2,,mt and dmi denotes the order of q modulo mi. Then

    |F(xn1)|=s,

    if and only if

    xi=φ(mi)dmi  (i=1,2,,t)

    is a solution to the Diophantine equation

    x1+x2++xt=s.

    Proof. We first assume that

    xi=φ(mi)dmi=ki  (i=1,2,,t)

    is the solution of the Diophantine equation

    x1+x2++xt=s.

    By Lemmas 2.1 and 2.3, we have

    xn1=ti=1Φmi(x)pe

    and Φmi(x) factors into

    φ(mi)φ(mi)ki=ki

    distinct monic irreducible polynomials in Fq[x] of the same degree

    dmi=φ(mi)ki  (i=1,2,,t).

    Hence, we obtain

    |F(xn1)|=ti=1ki=s.

    Suppose

    |F(xn1)|=s.

    According to Lemma 2.3, we have

    |F(xn1)|=ti=1φ(mi)dmi=s.

    So

    xi=φ(mi)dmi  (i=1,2,,t)

    is the solution of the Diophantine equation

    x1+x2++xt=s.

    We apply Theorem 3.4 to deduce Theorem 1.6. Note that Theorem 1.5 is trivial. Recall that

    n=mpe,

    where e0 is an integer and p is the characteristic of Fq with pm.

    For Theorem 1.6

    |F(xn1)|=2,

    we know that m has two factors; thus, m is a prime different from p,

    xn1=(Φ1(x)Φm(x))pe.

    The unique positive integer solution of the Diophantine equation

    x1+x2=2

    is

    x1=x2=1.

    Since

    φ(1)d1=1,

    and by Theorem 3.4, we have

    φ(m)dm=1,

    that is, dm=φ(m), q is a primitive root modulo m. It follows from Lemma 2.5 that the cyclotomic polynomial Φm(x) is irreducible over Fq. Thus

    |F(xn1)|=2.

    The necessary and sufficient conditions for

    |F(xn1)|=3,4,5

    are given, respectively, below: for

    |F(xn1)|=3,

    we know that t3, where t is the number of factors of m.

    Case 1. If m has three factors, then m=r2, where r is a prime different from p.

    xn1=(Φ1(x)Φr(x)Φr2(x))pe.

    The unique positive integer solution of the Diophantine equation

    x1+x2+x3=3

    is

    x1=x2=x3=1.

    By Theorem 3.4, we have

    φ(r)dr=1,  φ(r2)dr2=1,

    that is,

    dr=φ(r),  dr2=φ(r2),

    q is a primitive root modulo r and r2. Recall Lemma 2.7: If q is a primitive root modulo r2, then q is a primitive root modulo r. Cyclotomic polynomials Φr(x) and Φr2(x) are irreducible over Fq. Thus

    |F(xn1)|=3.

    Case 2. If m has two factors, then m=r,

    xn1=(Φ1(x)Φr(x))pe.

    The positive integer solution of the Diophantine equation

    x1+x2=3

    is x1=1, x2=2. Hence, we obtain

    φ(r)dr=2,

    that is,

    dr=φ(r)2,

    the order of q modulo r is φ(r)2. According to Lemma 2.3, the cyclotomic polynomial Φr(x) factors into

    φ(r)φ(r)2=2

    distinct monic irreducible polynomials in Fq[x] of the same degree

    dr=φ(r)2.

    Thus

    |F(xn1)|=3.

    In conclusion, we have the following result:

    Theorem 4.1. The following statements are equivalent:

    (a) |F(xn1)|=3.

    (b) (b1) F(xn1) = {x1,f1(x),f2(x)}, where m=r,

    f1(x)f2(x)=Φr(x),degf1=degf2=φ(r)2.

    (b2) F(xn1) = {x1,Φr(x),Φr2(x)}, where m=r2.

    (c) (c1) m=r, and the order of q modulo r is φ(r)2.

    (c2) m=r2, and q is a primitive root modulo r2.

    For

    |F(xn1)|=4,

    we know that t4, where t is the number of factors of m. In the remaining part of this paper, we always assume that r is an odd prime different from p.

    If m has four factors, then the possible values of m are r3, 2r, p1p2 or 8, where p1 and p2 are odd primes different from p. The unique positive integer solution of the Diophantine equation

    x1+x2+x3+x4=4

    is

    x1=x2=x3=x4=1.

    Case 1. If m=r3, then

    xn1=(Φ1(x)Φr(x)Φr2(x)Φr3(x))pe,

    and we have

    φ(r)dr=φ(r2)dr2=φ(r3)dr3=1,

    that is, q is a primitive root modulo rl,l=1,2,3, which requires that q is a primitive root modulo r2. The cyclotomic polynomials Φr(x), Φr2(x), and Φr3(x) are irreducible over Fq. Thus

    |F(xn1)|=4.

    Case 2. If m=2r, then

    xn1=(Φ1(x)Φ2(x)Φr(x)Φ2r(x))pe,

    and we have

    φ(2)d2=φ(r)dr=φ(2r)d2r=1,

    that is, q is a primitive root modulo r and 2r. Recall Lemma 2.8: If q is a primitive root modulo r, then q is a primitive root modulo 2r. The cyclotomic polynomials Φr(x) and Φ2r(x) are irreducible over Fq. Obviously, the order of q modulo 2 is d2=1, and

    Φ2(x)=x+1

    is irreducible over Fq. Thus

    |F(xn1)|=4.

    Case 3. If m=p1p2, then

    xn1=(Φ1(x)Φp1(x)Φp2(x)Φp1p2(x))pe,

    and we have

    φ(p1)dp1=φ(p2)dp2=φ(p1p2)dp1p2=1.

    It follows from Lemma 2.4 that p1p2 has no primitive root, which contradicts

    dp1p2=φ(p1p2).

    The cyclotomic polynomial Φp1p2(x) is reducible over Fq. Thus

    |F(xn1)|>4.

    Case 4. If m=8, then

    xn1=(Φ1(x)Φ2(x)Φ4(x)Φ8(x))pe.

    Since 8 has no primitive root, Φ8(x) is reducible over Fq. Thus

    |F(xn1)|>4.

    If m has three factors, then the possible values of m are r2 or 4. The positive integer solution of the equation

    x1+x2+x3=4

    is

    x1=x2=1,x3=2.

    Case 1. If m=r2, then

    xn1=(Φ1(x)Φr(x)Φr2(x))pe,

    and we have

    φ(r)dr=2,  φ(r2)dr2=1

    or

    φ(r)dr=1,  φ(r2)dr2=2.

    For the former, the order of q modulo r is

    dr=φ(r)2,

    and q is a primitive root modulo r2, which is impossible by Lemma 2.7. For the latter, q is a primitive root modulo r, and the order of q modulo r2 is φ(r2)2. It follows that

    qφ(r)1(mod r),  qφ(r2)2=qrφ(r)21(mod r2),  qrφ(r)21(mod r).

    Thus φ(r)|rφ(r)2. Since r is an odd prime, r2 is not an integer, and the divisibility is not valid.

    Case 2. If m=4, then

    xn1=(Φ1(x)Φ2(x)Φ4(x))pe,

    and we have

    φ(4)d4=2,

    that is, the order of q modulo 4 is

    d4=φ(4)2=1.

    The cyclotomic polynomial

    Φ4(x)=1+x2

    factors into

    φ(4)φ(4)2=2

    distinct monic irreducible polynomials in Fq[x] of the same degree, d4=1. Thus

    |F(xn1)|=4.

    If m has two factors, then m=r,

    xn1=(Φ1(x)Φr(x))pe.

    The positive integer solution of the Diophantine equation

    x1+x2=4

    is x1=1, x2=3. Hence, we have

    φ(r)dr=3,

    that is, the order of q modulo r is φ(r)3. The cyclotomic polynomial Φr(x) factors into three distinct monic irreducible polynomials in Fq[x] of the same degree φ(r)3. Thus

    |F(xn1)|=4.

    In conclusion, we have the following result:

    Theorem 4.2. The following statements are equivalent:

    (a) |F(xn1)|=4.

    (b) (b1) F(xn1) = {x1,f1(x),f2(x),f3(x)}, where m=r,

    f1(x)f2(x)f3(x)=Φr(x),degf1=degf2=degf3=φ(r)3.

    (b2) F(xn1) = {x1,Φr(x),Φr2(x),Φr3(x)}, where m=r3.

    (b3) F(xn1) = {x1,x+1,Φr(x),Φ2r(x)}, where m=2r.

    (b4) F(xn1) = {x1,x+1,x+e1,x+e2}, where m=4, e1 and e2 are integers.

    (c) (c1) m=r, and the order of q modulo r is φ(r)3.

    (c2) m=r3, and q is a primitive root modulo r2.

    (c3) m=2r, and q is a primitive root modulo r.

    (c4) m=4, and the order of q modulo 4 is 1.

    For

    |F(xn1)|=5,

    we know that t5, where t is the number of factors of m.

    If m has five factors, then the possible values of m are r4 or 16. The unique positive integer solution of the equation

    x1+x2+x3+x4+x5=5

    is

    x1=x2=x3=x4=x5=1.

    Case 1. If m=r4, then

    xn1=(Φ1(x)Φr(x)Φr2(x)Φr3(x)Φr4(x))pe,

    and we have

    φ(r)dr=φ(r2)dr2=φ(r3)dr3=φ(r4)dr4=1,

    that is, q is a primitive root modulo rl,l=1,2,3,4, which requires that q is a primitive root modulo r2. The cyclotomic polynomials Φr(x),Φr2(x),Φr3(x), and Φr4(x) are irreducible over Fq. Thus

    |F(xn1)|=5.

    Case 2. If m=16, then

    xn1=(Φ1(x)Φ2(x)Φ4(x)Φ8(x)Φ16(x))pe.

    Since 8 and 16 have no primitive root, we know that Φ8(x) and Φ16(x) are reducible over Fq. Thus

    |F(xn1)|>5.

    If m has four factors, then the possible values of m are r3,8,2r or p1p2. The positive integer solution of the equation

    x1+x2+x3+x4=5

    is

    x1=x2=x3=1,x4=2.

    Case 1. If m=r3, then

    xn1=(Φ1(x)Φr(x)Φr2(x)Φr3(x))pe.

    It follows from Lemma 2.7 that

    φ(r2)dr2=2

    and

    φ(r)dr=φ(r3)dr3=1,

    that is, q is a primitive root modulo r3, the order of q modulo r2 is φ(r2)2. It follows that

    qφ(r3)1(mod r3),  qφ(r2)21(mod r2),  qφ(r2)21(mod r).

    Since q is a primitive root modulo r3, we have

    vr(qφ(r2)21)=2.

    By Lemma 2.6, we have

    vr(qrφ(r2)21)=vr(qφ(r2)21)+vr(r)=2+1=3,
    qφ(r3)21(modr3),

    which is a contradiction. Thus, if m=r3, then

    |F(xn1)|5.

    Case 2. If m=8, then

    xn1=(Φ1(x)Φ2(x)Φ4(x)Φ8(x))pe,

    and we have

    φ(4)d4=1,  φ(8)d8=2,

    that is, q is a primitive root modulo 4, which means q is congruent to 3 modulo 4, therefore the order of q modulo 8 is

    φ(8)2=2.

    Φ4(x) is irreducible over Fq, and Φ8(x) factors into

    φ(8)φ(8)2=2

    distinct monic irreducible polynomials in Fq[x] of the same degree 2. Thus

    |F(xn1)|=5.

    Case 3. If m=2r, then

    xn1=(Φ1(x)Φ2(x)Φr(x)Φ2r(x))pe.

    It follows from Lemma 2.8 that

    φ(r)dr=2,  φ(2r)d2r=1,

    that is, q is a primitive root modulo 2r, and the order of q modulo r is φ(r)2, Φ2r(x) is irreducible over Fq and Φr(x) factors into

    φ(r)φ(r)2=2

    distinct monic irreducible polynomials in Fq[x] of the same degree φ(r)2. Thus

    |F(xn1)|=5.

    Case 4. If m=p1p2, then

    xn1=(Φ1(x)Φp1(x)Φp2(x)Φp1p2(x))pe.

    Since p1p2 has no primitive root, we have

    φ(p1)dp1=φ(p2)dp2=1,  φ(p1p2)dp1p2=2,

    that is, q is a primitive root modulo p1 and p2, and the order of q modulo p1p2 is φ(p1p2)2, Φp1(x) and Φp2(x) are irreducible over Fq, and Φp1p2(x) factors into

    φ(p1p2)φ(p1p2)2=2

    distinct monic irreducible polynomials in Fq[x] of the same degree φ(p1p2)2. Thus

    |F(xn1)|=5.

    If m has three factors, then the possible values of m are 4 or r2. If m=4, there are at most four distinct irreducible factors for xn1. Thus

    |F(xn1)|<5.

    If m=r2, then

    xn1=(Φ1(x)Φr(x)Φr2(x))pe.

    The positive integer solutions of the equation

    x1+x2+x3=5

    are

    x1=1,  x2=x3=2,orx1=x2=1,  x3=3.

    For the former, we have

    φ(r)dr=φ(r2)dr2=2,

    that is, the order of q modulo r is φ(r)2 and the order of q modulo r2 is φ(r2)2, Φr(x), and Φr2(x) factor into 2 distinct monic irreducible polynomials in Fq[x]. Thus

    |F(xn1)|=5.

    For the latter, it follows from Lemma 2.7 that

    φ(r)dr=1andφ(r2)dr2=3,

    that is, q is a primitive root modulo r, and the order of q modulo r2 is φ(r2)3, Φr(x) is irreducible over Fq and Φr2(x) factors into 3 distinct monic irreducible polynomials in Fq[x]. Thus

    |F(xn1)|=5.

    If m has two factors, then

    m=r,  xn1=(Φ1(x)Φr(x))pe.

    The positive integer solution of the equation x1+x2=5 is x1=1,x2=4. Hence, we have

    φ(r)dr=4,

    that is, the order of q modulo r is φ(r)4. The cyclotomic polynomial Φr(x) factors into four distinct monic irreducible polynomials in Fq[x]. Thus

    |F(xn1)|=5.

    In conclusion, we obtain the following result:

    Theorem 4.3. The following statements are equivalent:

    (a) |F(xn1)|=5.

    (b) (b1) F(xn1) = {x1,Φr(x),Φr2(x),Φr3(x),Φr4(x)}, where m=r4.

    (b2) F(xn1) = {x1,x+1,Φ4(x),f1(x),f2(x)}, where m=8,

    f1(x)f2(x)=Φ8(x),degf1=degf2=2.

    (b3) F(xn1) = {x1,x+1,g1(x),g2(x),Φ2r(x)}, where m=2r,

    g1(x)g2(x)=Φr(x),degg1=degg2=φ(r)2.

    (b4) F(xn1) = {x1,Φp1(x),Φp2(x),h1(x),h2(x)}, where m=p1p2,

    h1(x)h2(x)=Φp1p2(x),degh1=degh2=φ(p1p2)2.

    (b5) F(xn1) = {x1,k1(x),k2(x),r1(x),r2(x)}, where m=r2,

    k1(x)k2(x)=Φr(x),degk1=degk2=φ(r)2andr1(x)r2(x)=Φr2(x),degr1=degr2=φ(r2)2.

    Or F(xn1) = {x1,Φr(x),u1(x),u2(x),u3(x)}, where m=r2,

    u1(x)u2(x)u3(x)=Φr2(x),degu1=degu2=degu3=φ(r2)3.

    (b6) F(xn1) = {x1,v1(x),v2(x),v3(x),v4(x)}, where m=r,

    v1(x)v2(x)v3(x)v4(x)=Φr(x),degv1=degv2=degv3=degv4=φ(r)4.

    (c) (c1) m=r4, and q is a primitive root modulo r2.

    (c2) m=8, q is a primitive root modulo 4, and the order of q modulo 8 is 2.

    (c3) m=2r, the order of q modulo r is φ(r)2 and q is a primitive root modulo 2r.

    (c4) m=p1p2, the order of q modulo p1p2 is φ(p1p2)2, and q is a primitive root modulo p1 and p2.

    (c5) m=r2, the order of q modulo r is φ(r)2 and the order of q modulo r2 is φ(r2)2; or q is a primitive root modulo r and the order of q modulo r2 is φ(r2)3.

    (c6) m=r, and the order of q modulo r is φ(r)4.

    In this final section, we provide two examples.

    Example 5.1. Let Fq denote the finite field of q elements with characteristic p. Let p be a prime, let r be a prime different from p, and let n=rlpe, with l1, e0. Denote by F(xn1) the set of all distinct monic irreducible factors of xn1 in a given finite field. Given a positive integer s, we consider the special case for

    |F(xn1)|=s=l+1.

    Since n=rlpe,

    xn1=(Φ1(x)Φr(x)Φr2(x)Φrl(x))pe.

    The unique positive integer solution of the equation

    x0+x1+x2++xl=l+1

    is

    xi=φ(ri)dri=1  (i=0,1,,l),

    where dri denotes the order of q modulo ri (i=0,1,,l). That is, q is a primitive root modulo rj (j=1,2,,l). Recall Lemma 2.7 that if q is a primitive root modulo r2, then q is a primitive root modulo rj (j=1,2,,l). Cyclotomic polynomials Φrj(x) (j=1,2,,l) are irreducible over Fq.

    In conclusion, if q is a primitive root modulo r2, then

    |F(xrlpe1)|=l+1.

    Example 5.2. We factor polynomial x251 into distinct monic irreducible polynomials over F7. Since 25=52,

    x251=x521=Φ1(x)Φ5(x)Φ25(x).

    We first calculate

    72(mod5),  7241(mod5),  741(mod5),

    where 7 is a primitive root modulo 5, thus

    Φ5(x)=1+x+x2+x3+x4

    is irreducible over F7.

    We next calculate

    77(mod25),  72241(mod25),  741(mod25),

    the order of  7 modulo 25 is 4, thus

    Φ25(x)=1+x5+x10+x15+x20

    factors into

    φ(25)4=5

    distinct monic irreducible polynomials over F7 of the same degree 4,

    f1(x)=1+2x+4x2+2x3+x4,f2(x)=1+4x+4x3+x4,f3(x)=1+4x+3x2+4x3+x4,f4(x)=1+5x+5x2+5x3+x4,f5(x)=1+6x+5x2+6x3+x4,

    respectively.

    Thus

    x251=((x1)(1+x+x2+x3+x4)(1+2x+4x2+2x3+x4)(1+4x+4x3+x4)(1+4x+3x2+4x3+x4)(1+5x+5x2+5x3+x4)(1+6x+5x2+6x3+x4))

    and

    |F(x251)|=7.

    {Let Fq be the finite field of q elements, and Fqn be its extension of degree n. Denote by F(xn1) the set of all distinct monic irreducible factors of the polynomial xn1 in the finite field Fq. Given a positive integer s, we use the properties of cyclotomic polynomials in finite fields and results from the Diophantine equations to provide the sufficient and necessary condition for

    |F(xn1)|=s.

    As an application, we also obtain the sufficient and necessary conditions for

    |F(xn1)|=3,4,5.

    Weitao Xie: the first draft of the manuscript; Jiayu Zhang: preliminaries collection and analysis; Wei Cao: originally raised the problem and commented on previous versions of the manuscript. All authors contributed to the study conception and design. All authors read and approved the final manuscript.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors thank the anonymous referees for their helpful comments that improved the quality of the manuscript. This work was jointly supported by the Fujian Provincial Natural Science Foundation of China (Grant No. 2022J02046), and Fujian Key Laboratory of Granular Computing and Applications (Minnan Normal University).

    All authors declare no conflicts of interest in this paper.

    [1] [ L. J. S. Allen,B. M. Bolker,Y. Lou,A. L. Nevai, Asymptotic profiles of the steady states for an SIS epidemic patch model, SIAM Journal on Applied Mathematics, 67 (2007): 1283-1309.
    [2] [ L. J. S. Allen,B. M. Bolker,Y. Lou,A. L. Nevai, Asymptotic profiles of the steady states for an SIS epidemic reaction-diffusion model, Discrete and Continuous Dynamical Systems-A, 21 (2008): 1-20.
    [3] [ P. M. Arguin,A. W. Navin,S. F. Steele,L. H. Weld,P. E. Kozarsky, Health communication during SARS, Emerging Infectious Diseases, 10 (2004): 377-380.
    [4] [ M. P. Brinn,K. V. Carson,A. J. Esterman,A. B. Chang,B. J. Smith, Cochrane review: Mass media interventions for preventing smoking in young people, Evidence-Based Child Health: A Cochrane Review Journal, 7 (2012): 86-144.
    [5] [ Y. Cai,Y. Kang,M. Banerjee,W. Wang, A stochastic SIRS epidemic model with infectious force under intervention strategies, Journal of Differential Equations, 259 (2015): 7463-7502.
    [6] [ Y. Cai,W. M. Wang, Dynamics of a parasite-host epidemiological model in spatial heterogeneous environment, Discrete and Continuous Dynamical Systems-Series B, 20 (2015): 989-1013.
    [7] [ Y. Cai,W. M. Wang, Fish-hook bifurcation branch in a spatial heterogeneous epidemic model with cross-diffusion, Nonlinear Analysis: Real World Applications, 30 (2016): 99-125.
    [8] [ Y. Cai,Z. Wang,W. M. Wang, Endemic dynamics in a host-parasite epidemiological model within spatially heterogeneous environment, Applied Mathematics Letters, 61 (2016): 129-136.
    [9] [ R. S. Cantrell and C. Cosner, Spatial Ecology Via Reaction-Diffusion Equations, John Wiley & Sons, Ltd., 2003.
    [10] [ J. Cui,X. Tao,H. Zhu, An SIS infection model incorporating media coverage, Journal of Mathematics, 38 (2008): 1323-1334.
    [11] [ J. Cui,Y. Sun,H. Zhu, The impact of media on the control of infectious diseases, Journal of Dynamics and Differential Equations, 20 (2008): 31-53.
    [12] [ O. Diekmann,J. A. P. Heesterbeek,J. A. J. Metz, On the definition and the computation of the basic reproduction ratio R0 in models for infectious diseases in heterogeneous populations, Journal of Mathematical Biology, 28 (1990): 365-382.
    [13] [ W. E. Fitzgibbon,M. Langlais,J. J. Morgan, A mathematical model of the spread of feline leukemia virus (FeLV) through a highly heterogeneous spatial domain, SIAM Journal on Mathematical Analysis, 33 (2001): 570-588.
    [14] [ W. E. Fitzgibbon,M. Langlais,J. J. Morgan, A reaction-diffusion system modeling direct and indirect transmission of diseases, Discrete and Continuous Dynamical Systems-B, 4 (2004): 893-910.
    [15] [ J. Ge,K. I. Kim,Z. Lin,H. Zhu, A SIS reaction-diffusion-advection model in a low-risk and high-risk domain, Journal of Differential Equations, 259 (2015): 5486-5509.
    [16] [ A. B. Gumel,S. Ruan,T. Day,J. Watmough,F. Brauer, Modelling strategies for controlling SARS outbreaks, Proceedings of the Royal Society of London B: Biological Sciences, 271 (2004): 2223-2232.
    [17] [ D. Henry and D. B. Henry, Geometric Theory of Semilinear Parabolic Equations, volume 840. Springer-Verlag, Berlin, 1981.
    [18] [ W. Huang,M. Han,K. Liu, Dynamics of an SIS reaction-diffusion epidemic model for disease transmission, Mathematical Biosciences and Engineering, 7 (2010): 51-66.
    [19] [ P. A. Khanam,B. Khuda,T. T. Khane,A. Ashraf, Awareness of sexually transmitted disease among women and service providers in rural bangladesh, International Journal of STD & AIDS, 8 (1997): 688-696.
    [20] [ T. Kuniya,J. Wang, Lyapunov functions and global stability for a spatially diffusive SIR epidemic model, Applicable Analysis, null (2016): 1-26.
    [21] [ A. K. Misra,A. Sharma,J. B. Shukla, Modeling and analysis of effects of awareness programs by media on the spread of infectious diseases, Mathematical and Computer Modelling, 53 (2011): 1221-1228.
    [22] [ C. Neuhauser, Mathematical challenges in spatial ecology, Notices of the AMS, 48 (2001): 1304-1314.
    [23] [ A. Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations, volume 198. Springer New York, 1983.
    [24] [ R. Peng, Asymptotic profiles of the positive steady state for an SIS epidemic reaction-diffusion model. Part I, Journal of Differential Equations, 247 (2009): 1096-1119.
    [25] [ R. Peng,S. Liu, Global stability of the steady states of an SIS epidemic reaction-diffusion model, Nonlinear Analysis: Theory, Methods & Applications, 71 (2009): 239-247.
    [26] [ R. Peng,X. Zhao, A reaction-diffusion SIS epidemic model in a time-periodic environment, Nonlinearity, 25 (2012): 1451-1471.
    [27] [ R. Peng,F. Yi, Asymptotic profile of the positive steady state for an SIS epidemic reaction-diffusion model: Effects of epidemic risk and population movement, Physica D: Nonlinear Phenomena, 259 (2013): 8-25.
    [28] [ M. H. Protter and H. F. Weinberger, Maximum Principles in Differential Equations, Prentice-Hall, New Jersey, 1967.
    [29] [ M. Robinson,N. I. Stilianakis,Y. Drossinos, Spatial dynamics of airborne infectious diseases, Journal of Theoretical Biology, 297 (2012): 116-126.
    [30] [ J. Shi,Z. Xie,K. Little, Cross-diffusion induced instability and stability in reaction-diffusion systems, Journal of Applied Analysis and Computation, 1 (2011): 95-119.
    [31] [ H. L. Smith, Monotone Dynamical Systems: An Introduction to the Theory of Competitive and Cooperative Systems, Mathematical Surveys and Monographs, 41. American Mathematical Society, Providence, RI, 1995.
    [32] [ C. Sun,W. Yang,J. Arino,K. Khan, Effect of media-induced social distancing on disease transmission in a two patch setting, Mathematical Biosciences, 230 (2011): 87-95.
    [33] [ S. Tang,Y. Xiao,L. Yuan,R. A. Cheke,J. Wu, Campus quarantine (FengXiao) for curbing emergent infectious diseases: lessons from mitigating a/H1N1 in Xi'an, China, Journal of Theoretical Biology, 295 (2012): 47-58.
    [34] [ J. M. Tchuenche and C. T. Bauch, Dynamics of an infectious disease where media coverage influences transmission ISRN Biomathematics, 2012 (2012), Article ID 581274, 10 pages.
    [35] [ J. M. Tchuenche, N. Dube, C. P. Bhunu and C. Bauch, The impact of media coverage on the transmission dynamics of human influenza, BMC Public Health, 11 (2011), S5.
    [36] [ N. Tuncer,M. Martcheva, Analytical and numerical approaches to coexistence of strains in a two-strain SIS model with diffusion, Journal of Biological Dynamics, 6 (2012): 406-439.
    [37] [ P. Vanden Driessche,J. Watmough, Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission, Mathematical Biosciences, 180 (2002): 29-48.
    [38] [ J. Wang,R. Zhang,T. Kuniya, The dynamics of an SVIR epidemiological model with infection age, IMA Journal of Applied Mathematics, 81 (2016): 321-343.
    [39] [ W. D. Wang, Epidemic models with nonlinear infection forces, Mathematical Biosciences and Engineering, 3 (2006): 267-279.
    [40] [ W. D. Wang,X. Zhao, Basic reproduction numbers for reaction-diffusion epidemic models, SIAM Journal on Applied Dynamical Systems, 11 (2012): 1652-1673.
    [41] [ D. Xiao,S. Ruan, Global analysis of an epidemic model with nonmonotone incidence rate, Mathematical Biosciences, 208 (2007): 419-429.
    [42] [ Y. Xiao, S. Tang and J. Wu, Media impact switching surface during an infectious disease outbreak Scientific Reports, 5 (2015), 7838.
    [43] [ Y. Xiao,T. Zhao,S. Tang, Dynamics of an infectious diseases with media/psychology induced non-smooth incidence, Mathematical Biosciences and Engineering, 10 (2013): 445-461.
    [44] [ M. E. Young, G. R. Norman and K. R. Humphreys, Medicine in the popular press: The influence of the media on perceptions of disease PLoS One, 3 (2008), e3552.
  • This article has been cited by:

    1. Jinle Liu, Hongfeng Wu, A Note on Factorization and the Number of Irreducible Factors of xn − λ over Finite Fields, 2025, 13, 2227-7390, 473, 10.3390/math13030473
  • Reader Comments
  • © 2017 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(3616) PDF downloads(554) Cited by(5)

Figures and Tables

Figures(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog