In this paper, we proposed a generalized mosquito-borne epidemic model with a general nonlinear incidence rate, which was studied from both deterministic and stochastic insights. In the deterministic model, we proved that the endemic equilibrium was globally asymptotically stable when the basic reproduction number R0 was greater than unity and the disease free equilibrium was globally asymptotically stable when R0 was lower than unity. In addition, considering the effect of environmental noise on the spread of infectious diseases, we developed a stochastic model in which the infection rates were assumed to satisfy the mean-reverting log-normal Ornstein-Uhlenbeck process. For this stochastic model, two critical values, known as Rs0 and RE0, were introduced to determine whether the disease will persist or die out. Additionally, the exact probability density function of the stationary distribution near the quasi-equilibrium point was obtained. Numerical simulations were conducted to validate the results obtained and to examine the impact of stochastic perturbations on the model.
Citation: Wenhui Niu, Xinhong Zhang, Daqing Jiang. Dynamics and numerical simulations of a generalized mosquito-borne epidemic model using the Ornstein-Uhlenbeck process: Stability, stationary distribution, and probability density function[J]. Electronic Research Archive, 2024, 32(6): 3777-3818. doi: 10.3934/era.2024172
[1] | Paola F. Antonietti, Chiara Facciolà, Marco Verani . Unified analysis of discontinuous Galerkin approximations of flows in fractured porous media on polygonal and polyhedral grids. Mathematics in Engineering, 2020, 2(2): 340-385. doi: 10.3934/mine.2020017 |
[2] | Federica Botta, Matteo Calafà, Pasquale C. Africa, Christian Vergara, Paola F. Antonietti . High-order discontinuous Galerkin methods for the monodomain and bidomain models. Mathematics in Engineering, 2024, 6(6): 726-741. doi: 10.3934/mine.2024028 |
[3] | Thomas J. Radley, Paul Houston, Matthew E. Hubbard . Quadrature-free polytopic discontinuous Galerkin methods for transport problems. Mathematics in Engineering, 2024, 6(1): 192-220. doi: 10.3934/mine.2024009 |
[4] | Andrea Manzoni, Alfio Quarteroni, Sandro Salsa . A saddle point approach to an optimal boundary control problem for steady Navier-Stokes equations. Mathematics in Engineering, 2019, 1(2): 252-280. doi: 10.3934/mine.2019.2.252 |
[5] | Ivan Fumagalli . Discontinuous Galerkin method for a three-dimensional coupled fluid-poroelastic model with applications to brain fluid mechanics. Mathematics in Engineering, 2025, 7(2): 130-161. doi: 10.3934/mine.2025006 |
[6] | Stefano Berrone, Stefano Scialò, Gioana Teora . The mixed virtual element discretization for highly-anisotropic problems: the role of the boundary degrees of freedom. Mathematics in Engineering, 2023, 5(6): 1-32. doi: 10.3934/mine.2023099 |
[7] | Federico Cluni, Vittorio Gusella, Dimitri Mugnai, Edoardo Proietti Lippi, Patrizia Pucci . A mixed operator approach to peridynamics. Mathematics in Engineering, 2023, 5(5): 1-22. doi: 10.3934/mine.2023082 |
[8] | Paola F. Antonietti, Ilario Mazzieri, Laura Melas, Roberto Paolucci, Alfio Quarteroni, Chiara Smerzini, Marco Stupazzini . Three-dimensional physics-based earthquake ground motion simulations for seismic risk assessment in densely populated urban areas. Mathematics in Engineering, 2021, 3(2): 1-31. doi: 10.3934/mine.2021012 |
[9] | Andrea Borio, Martina Busetto, Francesca Marcon . SUPG-stabilized stabilization-free VEM: a numerical investigation. Mathematics in Engineering, 2024, 6(1): 173-191. doi: 10.3934/mine.2024008 |
[10] | Gianluca Crippa, Christian Schulze . Sub-exponential mixing of generalized cellular flows with bounded palenstrophy. Mathematics in Engineering, 2023, 5(1): 1-12. doi: 10.3934/mine.2023006 |
In this paper, we proposed a generalized mosquito-borne epidemic model with a general nonlinear incidence rate, which was studied from both deterministic and stochastic insights. In the deterministic model, we proved that the endemic equilibrium was globally asymptotically stable when the basic reproduction number R0 was greater than unity and the disease free equilibrium was globally asymptotically stable when R0 was lower than unity. In addition, considering the effect of environmental noise on the spread of infectious diseases, we developed a stochastic model in which the infection rates were assumed to satisfy the mean-reverting log-normal Ornstein-Uhlenbeck process. For this stochastic model, two critical values, known as Rs0 and RE0, were introduced to determine whether the disease will persist or die out. Additionally, the exact probability density function of the stationary distribution near the quasi-equilibrium point was obtained. Numerical simulations were conducted to validate the results obtained and to examine the impact of stochastic perturbations on the model.
The Gröbner basis theory for commutative algebras was introduced by Buchberger [2] which provided a solution to the reduction problem for commutative algebras. In [3], Bergman generalized this theory to the associative algebras by proving the diamond lemma. On the other hand, the parallel theory of the Gröbner basis was developed for Lie algebras by Shirshov in [4]. In [5], Bokut noticed that Shirshov's method works for also associative algebras. Hence Shirshov's theory for Lie and their universal enveloping algebras is called the Gröbner-Shirshov basis theory. We may refer the papers [6,7,8,9,10,11,12,13] for some recent studies over Gröbner-Shirshov bases in terms of algebraic ways, the papers [14,15] related to Hilbert series and the paper [16] in terms of graph theoretic way. Furthermore citation [17] can be used to understand normal forms for the monoid of positive braids by using Gröbner-Shirshov basis.
The word, conjugacy and isomorphism problems (shortly decision problems) have played an important role in group theory since the work of M. Dehn in early 1900's. Among them, especially the word problem has been studied widely in groups (see [18]). It is well known that the word problem for finitely presented groups is not solvable in general; that is, given any two words obtained by generators of the group, there may not be an algorithm to decide whether these words represent the same element in this group.
The method Gröbner-Shirshov basis theory gives a new algorithm to obtain normal forms of elements of groups, monoids and semigroups, and hence a new algorithm to solve the word problem in these algebraic structures (see also [19], for relationship with word problem for semigroups and ideal membership problem for non-commutative polynomail rings). By considering this fact, our aim in this paper is to find a Gröbner-Shirshov basis of the symmetric inverse monoid in terms of the dex-leg ordering on the related words of symmetric inverse monoids.
Symmetric inverse monoids are partial bijections and they are very well known in combinatorics. Easdown et al. [20] studied a presentation for the symmetric inverse monoid In. By adding relations σ21 =σ22 =⋯ =σ2n−1=1 into the presentation of the braid group described in terms of Artin's Theorem, it is obtained the well-known Moore presentation for the symmetric group as defined in [21]. Using this in the Popova's description [22] for the presentation of the symmetric inverse monoid In yields the following presentation:
In=⟨ε,σ1,σ2,⋯,σn−1;σiσj=σjσi(|i−j|>1),σiσi+1σi=σi+1σiσi+1(1≤i≤n−2),σ21=σ22=⋯=σ2n−1=1,ε2=ε,εσi=σiε(1≤i≤n−2),εσn−1ε=σn−1εσn−1ε=εσn−1εσn−1⟩. | (1.1) |
In [23], the author has also studied presentations of symmetric inverse and singular part of the symmetric inverse monoids.
Let k be a field and k⟨X⟩ be the free associative algebra over k generated by X. Denote by X∗ the free monoid generated by X, where the empty word is the identity which is denoted by 1. For a word w∈X∗, let us denote the length of w by |w|. Also assume that X∗ is a well ordered monoid. A well-ordering ≤ on X∗ is called a monomial ordering if for u,v∈X∗, we have u≤v⇒w1uw2≤w1vw2, for all w1,w2∈X∗. A standard example of monomial ordering on X∗ is the deg-lex ordering, in which two words are compared first by the degree and then lexicographically, where X is a well-ordered set.
Every nonzero polynomial f∈k⟨X⟩ has the leading word ¯f. If the coefficient of ¯f in f is equal to 1, then f is called monic. The following fundamental materials can be found in [3,5,6,7,8,10,11,12,24].
Let f and g be two monic polynomials in k⟨X⟩. Therefore we have two compositions between f and g as follows:
1. If w is a word such that w=¯fb=a¯g for some a,b∈X∗ with |¯f|+|¯g|>|w|, then the polynomial (f,g)w=fb−ag is called the intersection composition of f and g with respect to w (and denoted by f∧g). In here, the word w is called an ambiguity of the intersection.
2. If w=¯f=a¯gb for some a,b∈X∗, then the polynomial (f,g)w=f−agb is called the inclusion composition of f and g with respect to w (and denoted by f∨g). In this case, the word w is called an ambiguity of the inclusion.
If g is a monic polynomial, ¯f=a¯gb and α is the coefficient of the leading term ¯f, then the transformation f↦f−αagb is called an elimination of the leading word (ELW) of g in f.
Let S⊆k⟨X⟩ with each s∈S monic. Then the composition (f,g)w is called trivial modulo (S,w) if (f,g)w=∑αiaisibi, where each αi∈k,ai,bi∈X∗,si∈S and ai¯sibi<w. If this is the case, then we write (f,g)w≡0 mod(S,w). In general, for p,q∈k⟨X⟩, we write p≡q mod(S,w) which means that p−q=∑αiaisibi, where each αi∈k,ai,bi∈X∗,si∈S and ai¯sibi<w.
A set S with the well ordering ≤ is called a Gröbner-Shirshov basis for k⟨X∣S⟩ if every composition (f,g)w of polynomials in S is trivial modulo S and the corresponding w.
The following lemma was proved by Shirshov [4] for free Lie algebras (with deg-lex ordering) in 1962 ([24]). In 1976, Bokut [5] specialized the Shirshov's approach to associative algebras (see also [3]). On the other hand, for commutative polynomials, this lemma is known as the Buchberger's Theorem (cf. [2,25]).
Lemma 1 (Composition-Diamond Lemma). Let k be a field,
A=k⟨X∣S⟩= k⟨X⟩/Id(S) |
and ≤ a monomial order on X∗, where Id(S) is the ideal of k⟨X⟩ generated by S. Then the following statements are equivalent:
1. S is a Gröbner-Shirshov basis.
2. f∈Id(S)⇒¯f=a¯sb for some s∈S and a,b∈X∗.
3. Irr(S)={u∈X∗∣u≠a¯sb,s∈S,a,b∈X∗} is a basis of the algebra A=k⟨X∣S⟩.
If a subset S of k⟨X⟩ is not a Gröbner-Shirshov basis, then we can add to S all nontrivial compositions of polynomials of S, and by continuing this process (maybe infinitely) many times, we eventually obtain a Gröbner-Shirshov basis Scomp. Such a process is called the Shirshov algorithm.
If S is a set of "semigroup relations" (that is, the polynomials in S are of the form u−v, where u,v∈X∗), then a nontrivial composition will have the same form. As a result, the set Scomp also consists of semigroup relations.
Let M=sgp⟨X∣S⟩ be a semigroup presentation. Then S is a subset of k⟨X⟩ and hence one can find a Gröbner-Shirshov basis Scomp. The last set does not depend on k, and as mentioned before, it consists of semigroup relations. We will call Scomp a Gröbner-Shirshov basis of M. This is the same as a Gröbner-Shirshov basis of the semigroup algebra kM=k⟨X∣S⟩. If S is a Gröbner-Shirshov basis of the semigroup M=sgp⟨X∣S⟩, then Irr(S) is a normal form for M [9,26].
The target of this section is to obtain a Gröbner-Shirshov basis for the symmetric inverse monoid In by taking into account the presentation given in (1.1). After that we will indicate the solvability of the word problem over In.
By ordering the generators as ε>σn−1>σn−2>σn−3>⋯>σ2>σ1 in (1.1), we have the following main result of this paper.
Theorem 2. A Gröbner-Shirshov basis for the symmetric inverse monoid consists of the following relations:
(1)σ2i=1(1≤i≤n−1),(2)σiσj=σjσi(|i−j|>1),(3)ε2=ε,(4)εσi=σiε(1≤i≤n−2),(5)σi+1σiσMi−1i−1⋯σM11σi+1=σiσi+1σiσMi−1i−1⋯σM11(1≤i≤n−2,Mk={0,1}(1≤k≤i−1)),(6)σn−1εσn−1σPn−2n−2⋯σP11ε=εσn−1σPn−2n−2⋯σP11ε(Pk={0,1}(1≤k≤n−2)),(7)σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2⋯σφjjε=εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i,1≤i≤n−3,2≤j≤n−2,Qk1,φk2={0,1}(i≤k1≤n−3,j≤k2≤n−2)),(7′)σn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε=εrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε(2<p<n,r={0,1},s≥⋯≥j≥i,1≤i≤n−3,2≤j,s≤n−2,Qk1,φk2,λk3={0,1}(i≤k1≤n−4,j≤k2≤n−3,s≤k3≤n−2)),(8)εσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−t=εσn−1σLn−2n−2⋯σLn−tn−tεσLn−1n−1σLn−2n−2⋯σLn−t+1n−t+1(2≤t≤n−1,Lk={0,1}(1≤k≤n−1)),(9)σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1⋯σU11)(σV(n−k)+2(n−k)+2σV(n−k)+1(n−k)+1⋯σV11)⋯(σSn−1n−1σSn−2n−2⋯σS11)(εσn−1σTn−2n−2⋯σT11)ε=(σ(n−k)+1σn−kσU(n−k)+1(n−k)+1⋯σU11)(σV(n−k)+2(n−k)+2σV(n−k)+1(n−k)+1⋯σV11)⋯(σSn−1n−1σSn−2n−2⋯σS11)(εσn−1σTn−2n−2⋯σT11)ε(2≤k≤n−1,Uk1,Vk2,Sk3,Tk4={0,1}(1≤k1≤(n−k)−1,1≤k2≤(n−k)+2,1≤k3≤n−1,1≤k4≤n−2)),(10)σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1⋯σX11)(σY(n−k)+2(n−k)+2σY(n−k)+1(n−k)+1⋯σY11)⋯(σZn−2n−2σZn−3n−3⋯σZ11)(εσn−1σn−2σWn−3n−3⋯σWii)(εσn−1σRn−2n−2⋯σRjj)ε=(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1⋯σX11)(σY(n−k)+2(n−k)+2σY(n−k)+1(n−k)+1⋯σY11)⋯(σZn−2n−2σZn−3n−3⋯σZ11)(εσn−1σn−2σWn−3n−3⋯σWii)(εσn−1σRn−2n−2⋯σRjj)ε(j>i,1≤i≤n−2,2≤j≤n−2,3≤k≤n−1,Xk1,Yk2,Zk3,Wk4,Rk5={0,1}(1≤k1≤(n−k)−1,1≤k2≤(n−k)+2,1≤k3≤n−2,1≤k4≤n−3,1≤k5≤n−2). |
We also have the following additional conditions.
● For the relation (5): For 1≤k<i−1, to take Mk=1 it is necessary Mk+1=1.
● For the relation (6): For 1≤k<n−2, to take Pk=1 it is necessary Pk+1=1.
● For the relation (7): For i≤k<n−3, to take Qk=1 it is necessary Qk+1=1.
For j≤k<n−2, to take φk=1 it is necessary φk+1=1.
● For the relation (7′): For i≤k<n−4, to take Qk=1 it is necessary Qk+1=1.
For j≤k<n−3, to take φk=1 it is necessary φk+1=1.
For s≤k<n−2, to take λk=1 it is necessary λk+1=1.
● For the relation (8): For n−t≤k<n−2, to take Lk=1 it is necessary Lk+1=1.
● For the relation (9): For 1≤t<(n−k)−1, to take Ut=1 it is necessary Ut+1=1.
For 1≤t<(n−k)+2, to take Vt=1 it is necessary Vt+1=1.
For 1≤t<n−1, to take St=1 it is necessary St+1=1.
For 1≤t<n−2, to take Tt=1 it is necessary Tt+1=1.
● For the relation (10): For 1≤t<(n−k)−1, to take Xt=1 it is necessary Xt+1=1.
For 1≤t<(n−k)+2, to take Yt=1 it is necessary Yt+1=1.
For 1≤t<n−2, to take Zt=1 it is necessary Zt+1=1.
For i≤t<n−3, to take Wt=1 it is necessary Wt+1=1.
For j≤t<n−2, to take Rt=1 it is necessary Rt+1=1.
Proof. Relations given for In in (1.1) provide relations among (1)–(10). Now we need to prove that all compositions among relations (1)–(10) are trivial. To do that, firstly, we consider intersection compositions of these relations. Hence we have the following ambiguties w:
(1)∧(1):w=σ3i(1≤i≤n−1),(1)∧(2):w=σ2iσj(|i−j|>1),(1)∧(5):w=σ2i+1σiσMi−1i−1⋯σM11σi+1(1≤i≤n−2),(1)∧(6):w=σ2n−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε,(1)∧(7):w=σ2n−2εσn−1σQn−2n−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2σφn−3n−3⋯σφjjε,(1)∧(7′):w=σ2n−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε,(1)∧(9):w=σ2n−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε,(1)∧(10):w=σ2n−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σWn−3n−3⋯σWiiεσn−1σRn−2n−2σRn−3n−3⋯σRjjε(j>i), |
(2)∧(1):w=σiσ2j(|i−j|>1),(2)∧(2):w=σiσjσk(|i−j|>1,|j−k|>1),(2)∧(5):w=σiσj+1σjσMj−1j−1⋯σM11σj+1(|i−(j+1)>1|),(2)∧(7′):w=σiσn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε(|i−(n−p)>1|),(2)∧(9):w=σiσn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2..σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε(|i−(n−k)>1|),(2)∧(10):w=σiσn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2σRn−3n−3⋯σRjjε(j>i,|i−(n−k)>1|), |
(3)∧(3):w=ε3,(3)∧(4):w=ε2σi(1≤i≤n−2),(3)∧(8):w=ε2σn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−t, |
(4)∧(1):w=εσ2i(1≤i≤n−2),(4)∧(2):w=εσiσj(|i−j|>1),(4)∧(5):w=εσi+1σiσMi−1i−1σMi−2i−2⋯σM11σi+1(1≤i≤n−3),(4)∧(7):w=εσn−2εσn−1σQn−2n−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2σφn−3n−3⋯σφjjε,(4)∧(7′):w=εσn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε,(4)∧(9):w=εσn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε,(4)∧(10):w=εσn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2σRn−3n−3⋯σRjjε, |
(5)∧(1):w=σi+1σiσMi−1i−1⋯σM11σ2i+1(1≤i≤n−2),(5)∧(2):w=σi+1σiσMi−1i−1⋯σM11σi+1σj(|i+1−j|>1),(5)∧(5):w=σi+1σiσMi−1i−1⋯σM11σi+1σiσMi−1i−1⋯σM11σi+1(1≤i≤n−2),(5)∧(6):w=σn−1σn−2σMn−3n−3σMn−4n−4⋯σM11σn−1εσn−1σPn−2n−2⋯σP11ε,(5)∧(7):w=σn−2σn−3σMn−4n−4σMn−5n−5⋯σM11σn−2εσn−1σQn−2n−2⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i),(5)∧(7′):w=σn−pσn−p−1σMn−p−2n−p−2⋯σM11σn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε,(5)∧(9):w=σn−kσ(n−k)−1σM(n−k)−2(n−k)−2σM(n−k)−3(n−k)−3⋯σM11(σn−kσ(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε,(5)∧(9):w=σn−kσ(n−k)−1σM(n−k)−2(n−k)−2σM(n−k)−3(n−k)−3⋯σM11σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε,(5)∧(10):w=σn−kσ(n−k)−1σM(n−k)−2(n−k)−2⋯σM11σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2σRn−3n−3⋯σRjjε(j>i),(5)∧(10):w=σn−kσ(n−k)−1σM(n−k)−2(n−k)−2⋯σM11σn−kσ(n−k)−1σX(n−k)−2(n−k)−2⋯σX11⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2σRn−3n−3⋯σRjjε(j>i), |
(6)∧(3):w=σn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε2,(6)∧(4):w=σn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11εσi(1≤i≤n−2),(6)∧(6):w=σn−1εσn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε,(6)∧(7):w=σn−1εσn−1σn−2εσn−1σn−2σQn−3n−3σQn−4n−4⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i),(6)∧(8):w=σn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11εσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−t,(6)∧(8):w=σn−1εσn−1σPn−2n−2⋯σPn−tn−tεσn−1σPn−2n−2⋯σPn−tn−t, |
(7)∧(3):w=σn−2εσn−1σQn−2n−2⋯σQiiεσn−1σφn−2n−2⋯σφjjε2(j>i),(7)∧(4):w=σn−2εσn−1σQn−2n−2⋯σQiiεσn−1σφn−2n−2⋯σφjjεσt,(j>i,1≤i≤n−2,2≤j≤n−2,1≤t≤n−2),(7)∧(6):w=σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1εσn−1σPn−2n−2⋯σP11ε(1≤i≤n−2),(7)∧(7):w=σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i,1≤i≤n−3,2≤j≤n−2),(7)∧(8):w=σn−2εσn−1σQn−2n−2⋯σQiiεσn−1σφn−2n−2⋯σφjjεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−t(j>i,1≤i≤n−2,2≤j≤n−2),(7)∧(8):w=σn−2εσn−1σQn−2n−2⋯σQiiεσn−1σφn−2n−2⋯σφjjεσn−1σφn−2n−2⋯σφjj,(7′)∧(7′):w=σn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssεσn−1σϕn−2n−2⋯σϕppε,(7′)∧(8):w=σn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssεσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−t,(7′)∧(8):w=σn−pεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssεσn−1σλn−2n−2⋯σλss, |
(8)∧(1):w=εσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯(σLn−tn−t)2,(8)∧(2):w=εσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tσj(|n−t−j|>1),(8)∧(5):w=εσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tσ(n−t)−1σM(n−t)−2(n−t)−2⋯σM11σn−t(1≤t≤n−2),(8)∧(6):w=εσn−1εσn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε,(8)∧(6):w=εσn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε,(8)∧(7):w=εσn−1σn−2εσn−1σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i),(8)∧(7):w=εσn−1σn−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2⋯σφjjε(j>i),(8)∧(7′):w=εσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−tεrσn−1σn−2σn−3σQn−4n−4⋯σQiiεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε,(8)∧(7′):w=εσn−1σLn−2n−2⋯σLn−tn−tεσn−1σn−2σn−3σLn−4n−4⋯σLn−tn−tεσn−1σn−2σφn−3n−3⋯σφjjε⋯σn−1σλn−2n−2⋯σλssε,(8)∧(8):w=εσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−t,(8)∧(9):w=εσn−1σn−2⋯σn−kεσn−1σn−2⋯σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2⋯σT11ε,(8)∧(10):w=εσn−1σn−2⋯σn−kεσn−1σn−2⋯σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2⋯σRjjε(j>i), |
(9)∧(3):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11ε2,(9)∧(4):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11εσi(1≤i≤n−2),(9)∧(6):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯(σSn−1n−1σSn−2n−2σSn−3n−3⋯σS11)εσn−1εσn−1σPn−2n−2σPn−3n−3⋯σP11ε,(9)∧(7):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯(σSn−1n−1σSn−2n−2σSn−3n−3⋯σS11)εσn−1σn−2εσn−1σn−2σQn−3n−3σQn−4n−4⋯σQiiεσn−1σφn−2n−2σφn−3n−3⋯σφjjε(j>i),(9)∧(7):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯σSn−1n−1σSn−2n−2εσn−1σn−2σQn−3n−3⋯σQiiεσn−1σφn−2n−2σφn−3n−3⋯σφjjε(j>i),(9)∧(8):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11εσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−tεσn−1σLn−2n−2σLn−3n−3⋯σLn−tn−t,(9)∧(8):w=σn−k(σ(n−k)+1σn−kσU(n−k)−1(n−k)−1σU(n−k)−2(n−k)−2⋯σU11)⋯εσn−1σTn−2n−2σTn−3n−3⋯σT11εσn−1σTn−2n−2σTn−3n−3⋯σT11, |
(10)∧(3):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2⋯σRjjε2(j>i),(10)∧(4):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2⋯σRjjεσt(1≤t≤n−2),(10)∧(6):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1εσn−1σPn−2n−2⋯σP11ε,(10)∧(7):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σn−2εσn−1σn−2σQn−3n−3⋯σQttεσn−1σφn−2n−2⋯σφjjε(j>t),(10)∧(7′):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σn−2Rn−2⋯σRjjεσn−1σSn−2n−2⋯σSllε(l>j>i),(10)∧(8):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2⋯σRjjεσn−1εσn−1σLn−2n−2⋯σLn−tn−tεσn−1σLn−2n−2⋯σLn−tn−t(j>i),(10)∧(8):w=σn−k(σ(n−k)+1σn−kσX(n−k)−1(n−k)−1σX(n−k)−2(n−k)−2⋯σX11)⋯εσn−1σn−2σWn−3n−3⋯σWiiεσn−1σRn−2n−2⋯σRjjεσn−1σRn−2n−2⋯σRjj(j>i), |
All these ambiguities are trivial. Let us show some of them as in the following.
(1)∧(5):w=σ2i+1σiσMi−1i−1⋯σM11σi+1,(1≤i≤n−2),(f,g)w=(σ2i+1−1)σiσMi−1i−1⋯σM11σi+1−σi+1(σi+1σiσMi−1i−1⋯σM11σi+1−σiσi+1σiσMi−1i−1⋯σM11)=σ2i+1σiσMi−1i−1⋯σM11σi+1−σiσMi−1i−1⋯σM11σi+1−σ2i+1σiσMi−1i−1⋯σM11σi+1+σi+1σiσi+1σiσMi−1i−1⋯σM11 |
=σi+1σiσi+1σiσMi−1i−1⋯σM11−σiσMi−1i−1⋯σM11σi+1≡σiσi+1σi2σMi−1i−1⋯σM11−σiσMi−1i−1⋯σM11σi+1≡σiσi+1σMi−1i−1⋯σM11−σiσMi−1i−1⋯σM11σi+1≡σiσMi−1i−1⋯σM11σi+1−σiσMi−1i−1⋯σM11σi+1≡0mod(S,w). |
(2)∧(2):w=σiσjσk(|i−j|>1,|j−k|>1),(f,g)w=(σiσj−σjσi)σk−σi(σjσk−σkσj)=σiσjσk−σjσiσk−σiσjσk+σiσkσj=σiσkσj−σjσiσk≡σkσiσj−σjσkσi≡σkσjσi−σkσjσi≡0mod(S,w). |
(6)∧(4):w=σn−1εσn−1σPn−2n−2⋯σPii⋯σP11εσi(1≤i≤n−2),(f,g)w=(σn−1εσn−1σPn−2n−2⋯σPii⋯σP11ε−εσn−1σPn−2n−2⋯σPii⋯σP11ε)σi−σn−1εσn−1σPn−2n−2⋯σPii⋯σP11(εσi−σiε)=σn−1εσn−1σPn−2n−2⋯σPii⋯σP11εσi−εσn−1σPn−2n−2⋯σPii⋯σP11εσi−σn−1εσn−1σPn−2n−2⋯σPii⋯σP11εσi+σn−1εσn−1σPn−2n−2⋯σPii⋯σP11σiε=σn−1εσn−1σPn−2n−2⋯σPii⋯σP11σiε−εσn−1σPn−2n−2⋯σPii⋯σP11εσi≡σn−1εσn−1σPn−2n−2⋯σPi−1i−1σPiiσPi−1i−1⋯σP11ε−εσn−1σPn−2n−2⋯σPii⋯σP11σiε≡σPi−1i−1σn−1εσn−1σPn−2n−2⋯σP11ε−εσn−1σPn−2n−2⋯σPi−1i−1σPiiσPi−1i−1⋯σP11ε≡σPi−1i−1εσn−1σPn−2n−2⋯σP11ε−σPi−1i−1εσn−1σPn−2n−2⋯σP11ε≡0mod(S,w). |
It is seen that there are no any inclusion compositions among relations (1)–(10). This ends up the proof.
As a consequence of Lemma 1 and Theorem 2, we have the following result.
Corollary 3. Let C(u) be a normal form of a word u∈In. Then C(u) is of the form
W1εk1W2εk2⋯Wnεkn, |
where kp={0,1} (1≤p≤n). In this above expression,
● if kp=1(1≤p≤n−1) then the word Wp+1 which begins with σn−1 and generated by σi (1≤i≤n−1) is actually a reduced word. Moreover the word W1 generated by σi (1≤i≤n−1) is an arbitrary reduced word.
● if kp=0(1≤p≤n−1) then the word WpWp+1 is also reduced.
In addition, subwords of the forms WiεkiWi+1εki+1 (1≤i≤n−1), WjεkjWj+1εkj+1Wj+2εkj+2 (1≤j≤n−2), WrεkrWr+1εkr+1Wr+2εkr+2Wr+3εkr+3 (1≤r≤n−3) and εksWs+1εks+1Ws+2 (1≤s≤n−2) must be reduced.
By Corollary 3, we can say that the word problem is solvable for symmetric inverse monoid In.
Remark 4. We note that if we change the orderings on words we find another Gröbner-Shirshov bases related to chosen orederings. Thus we get normal form for given algebraic structure depending on ordering. To get this normal form it is used third item of Composition-Diamond Lemma. It is known that to get normal form structure implies solvability of the word problem. If one can not obtain a Gröbner-Shirshov basis according to chosen ordering on words, this does not mean that the word problem is not solvable.
As an application of Theorem 2, we will give the following Example 5 which describes a Gröbner-Shirshov basis for the symmetric inverse monoid I4. The accuracy and efficiency of this example can be seen by "GBNP package in GAP [1] which computes Gröbner bases of non-commutative polynomials as follows.
gap> LoadPackage("GBNP", "0", false);truegap> SetInfoLevel(InfoGBNP, 1);gap> SetInfoLevel(InfoGBNPTime, 1);gap> A:= FreeAssociativeAlgebraWithOne(Rationals, "s1", "s2", "s3", "e");<algebra−with−one over Rationals, with 4 generators>gap> g:= GeneratorsOfAlgebra(A);[ (1)∗<identity ...>, (1)∗s1, (1)∗s2, (1)∗s3, (1)∗e ]gap> s1:= g[2];;s2:= g[3];;s3:= g[4];;e:= g[5];;o:= g[1];(1)∗<identity ...>gap> GBNP.ConfigPrint(A);gap> twosidrels:= [s1∧2−o, s2∧2−o, s3∧2−o, (s1∗s2)∧3−o, (s2∗s3)∧3−o, (s1∗s3)∧2−o,e∧2−e, s1∗e−e∗s1, s2∗e−e∗s2, e∗s3∗e−(e∗s3)∧2, e∗s3∗e−(s3∗e)∧2];[ (−1)∗<identity ...>+(1)∗s1∧2, (−1)∗<identity ...>+(1)∗s2∧2,(−1)∗<identity ...>+(1)∗s3∧2, (−1)∗<identity ...>+(1)∗(s1∗s2)∧3,(−1)∗<identity ...>+(1)∗(s2∗s3)∧3, (−1)∗<identity ...>+(1)∗(s1∗s3)∧2,(−1)∗e+(1)∗e∧2, (1)∗s1∗e+(−1)∗e∗s1, (1)∗s2∗e+(−1)∗e∗s2,(1)∗e∗s3∗e+(−1)∗(e∗s3)∧2, (1)∗e∗s3∗e+(−1)∗(s3∗e)∧2 ]gap> prefixrels:= [e, s1−o, s2−o, s3∗e−s3];[ (1)∗e, (−1)∗<identity ...>+(1)∗s1, (−1)∗<identity ...>+(1)∗s2, (−1)∗s3+(1)∗s3∗e ]gap> PrintNPList(GBR.ts);s1∧2 − 1s2∧ 2 − 1s3s1 − s1s3s3∧ 2 − 1es1 − s1ees2 − s2ee∧2 − es2s1s2 − s1s2s1s3s2s3 − s2s3s2s3s2s1s3 − s2s3s2s1s3es3e − es3ees3es3 − es3es3es3s2e − es3s2es2s3s2es3e − s3s2es3es3es3s2s1e − es3s2s1ees3s2es3s2 − es3s2es3s2s3s2s1es3e − s3s2s1es3es2s3s2es3s2e − s3s2es3s2es2es3s2es3e − es3s2es3es1s2s1s3s2es3e − s2s1s3s2es3es2s3s2s1es3s2e − s3s2s1es3s2es2s3s2es3s2s1e − s3s2es3s2s1es2es3s2s1es3e − es3s2s1es3ees3s2s1es3s2s1 − es3s2s1es3s2s1s2s1s3s2s1es3e − s2s1s3s2s1es3es1s2s1s3s2es3s2e − s2s1s3s2es3s2es1s2s1es3s2es3e − s2s1es3s2es3es2s3s2s1es3s2s1e − s3s2s1es3s2s1es2es3s2s1es3s2e − es3s2s1es3s2es1s2s1s3s2s1es3s2e − s2s1s3s2s1es3s2es1s2s1s3s2es3s2s1e − s2s1s3s2es3s2s1es1s2s1es3s2s1es3e − s2s1es3s2s1es3es1s3s2s1es3s2es3e − s3s2s1es3s2es3es1s2s1s3s2s1es3s2s1e − s2s1s3s2s1es3s2s1es1s2s1es3s2s1es3s2e − s2s1es3s2s1es3s2es1s3s2s1es3s2s1es3e − s3s2s1es3s2s1es3es1es3s2s1es3s2es3e − es3s2s1es3s2es3es1s3s2s1es3s2s1es3s2e − s3s2s1es3s2s1es3s2e |
We note that by GBNP package program one can compute Gröbner-Shirshov basis of symmetric inverse monoids for small sizes, for example I4 and I5. But there are no any other computer programs that compute a Gröbner-Shirshov basis for general size of symmetric inverse monoids. For this reason, it is worth to study and obtain a Gröbner-Shirshov basis for this important structure.
Example 5. The presentation of I4 is as follows.
⟨ε,σ1,σ2,σ3;σ21=σ22=σ23=1,σ3σ1=σ1σ3,ε2=ε,εσ1=σ1ε,εσ2=σ2ε,σ3σ2σ3=σ2σ3σ2,σ2σ1σ2=σ1σ2σ1,σ3εσ3ε=εσ3ε,εσ3εσ3=εσ3ε⟩. |
We use deg-lex order induced by σ1<σ2<σ3<ε. By this ordering, a Gröbner-Shirshov basis for symmetric inverse monoid I4 consists of the following 38 relations.
(1)σ21=1,σ22=1,σ23=1,(2)σ3σ1=σ1σ3,(3)ε2=ε,(4)εσ1=σ1ε,εσ2=σ2ε,(5)σ3σ2σ3=σ2σ3σ2,σ2σ1σ2=σ1σ2σ1,σ3σ2σ1σ3=σ2σ3σ2σ1,(6)σ3εσ3ε=εσ3ε,σ3εσ3σ2ε=εσ3σ2ε,σ3εσ3σ2σ1ε=εσ3σ2σ1ε,(7)σ2εσ3σ2εσ3ε=εσ3σ2εσ3ε,σ2εσ3σ2σ1εσ3ε=εσ3σ2σ1εσ3ε,σ2εσ3σ2σ1εσ3σ2ε=εσ3σ2σ1εσ3σ2ε,(7′)σ1σ3σ2σ1εσ3σ2εσ3ε=σ3σ2σ1εσ3σ2εσ3ε,σ1σ3σ2σ1εσ3σ2σ1εσ3ε=σ3σ2σ1εσ3σ2σ1εσ3ε,σ1σ3σ2σ1εσ3σ2σ1εσ3σ2ε=σ3σ2σ1εσ3σ2σ1εσ3σ2ε,σ1εσ3σ2σ1εσ3σ2εσ3ε=εσ3σ2σ1εσ3σ2εσ3ε,(8)εσ3εσ3=εσ3ε,εσ3σ2εσ3σ2=εσ3σ2εσ3,εσ3σ2σ1εσ3σ2σ1=εσ3σ2σ1εσ3σ2,(9)σ2σ3σ2εσ3ε=σ3σ2εσ3ε,σ2σ3σ2σ1εσ3ε=σ3σ2σ1εσ3ε,σ2σ3σ2εσ3σ2ε=σ3σ2εσ3σ2ε,σ1σ2σ1σ3σ2εσ3ε=σ2σ1σ3σ2εσ3ε,σ2σ3σ2σ1εσ3σ2ε=σ3σ2σ1εσ3σ2ε,σ2σ3σ2εσ3σ2σ1ε=σ3σ2εσ3σ2σ1ε,σ1σ2σ1σ3σ2σ1εσ3ε=σ2σ1σ3σ2σ1εσ3ε,σ1σ2σ1σ3σ2εσ3σ2ε=σ2σ1σ3σ2εσ3σ2ε,σ2σ3σ2σ1εσ3σ2σ1ε=σ3σ2σ1εσ3σ2σ1ε,σ1σ2σ1σ3σ2σ1εσ3σ2ε=σ2σ1σ3σ2σ1εσ3σ2ε,σ1σ2σ1σ3σ2εσ3σ2σ1ε=σ2σ1σ3σ2εσ3σ2σ1ε,σ1σ2σ1σ3σ2σ1εσ3σ2σ1ε=σ2σ1σ3σ2σ1εσ3σ2σ1ε,(10)σ1σ2σ1εσ3σ2εσ3ε=σ2σ1εσ3σ2εσ3ε,σ1σ2σ1εσ3σ2σ1εσ3ε=σ2σ1εσ3σ2σ1εσ3ε,σ1σ2σ1εσ3σ2σ1εσ3σ2ε=σ2σ1εσ3σ2σ1εσ3σ2ε. |
The idea of Gröbner-Shirshov basis theory plays a significant role in several fields of mathematics (algebra, graph theory, knot theory), computer sciences (computational algebra) and information sciences. From algebraic way the method Gröbner-Shirshov basis theory gives a new algorithm to obtain normal forms of elements of groups, monoids, semigroups and various type of algebras, and hence a new algorithm to solve the word problem in these algebraic structures.
In this study, we obtained a Gröbner-Shirshov basis for a special type of braid monoids, namely the symmetric inverse monoid In, in terms of the dex-leg ordering on the related elements of monoid. As known symmetric inverse monoids are partial bijections and they are very well known and important in combinatorics. By taking into account the Gröbner-Shirshov basis, we achieved the normal form structure of this important monoid. This normal form gave us the solution of the word problem. At the final part of this study, we presented an application of our main result which find out a Gröbner-Shirshov basis for the symmetric inverse monoid I4 by using a package program, GBNP, in GAP. Since GBNP is a restricted package program in point of size of symmetric inverse monoids it is worth to study and obtain a Gröbner-Shirshov basis for general size of this important structure.
In the future, the result of this work can be expanded to some other algebraic, computational structures and associated to graph theory, growth, Hilbert series and knot theory.
This work was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant No (130-211-D1439). The authors, therefore, acknowledge with thanks DSR technical and financial support. The authors would like to thank to the referees for their suggestions and valuable comments.
The authors declare that they have no conflict of interest.
[1] | H. Lee, S. Halverson, N. Ezinwa, Mosquito-borne diseases, Primary Care: Clin. Off. Pract., 45 (2018), 393–407. https://doi.org/10.1016/j.pop.2018.05.001 |
[2] |
M. A. Tolle, Mosquito-borne diseases, Curr. Probl. Pediatr. Adolesc. Health Care, 39 (2009), 97–140. https://doi.org/10.1016/j.cppeds.2009.01.001 doi: 10.1016/j.cppeds.2009.01.001
![]() |
[3] |
J. Oliveira-Ferreira, M. V. G. Lacerda, P. Brasil, J. L. Ladislau, P. L. Tauil, C. T. Daniel-Ribeiro, Malaria in Brazil: an overview, Malar. J., 9 (2010), 1–15. https://doi.org/10.1186/1475-2875-9-115 doi: 10.1186/1475-2875-9-115
![]() |
[4] |
V. Wiwanitkit, Dengue fever: diagnosis and treatment, Expert Rev. Anti-Infect. Ther., 8 (2010), 841–845. https://doi.org/10.1586/eri.10.53 doi: 10.1586/eri.10.53
![]() |
[5] |
E. D. Barnett, Yellow fever: epidemiology and prevention, Clin. Infect. Dis., 44 (2007), 850–856. https://doi.org/10.1086/511869 doi: 10.1086/511869
![]() |
[6] |
E. B. Hayes, J. J. Sejvar, S. R. Zaki, R. S. Lanciotti, A. V. Bode, Virology, pathology, and clinical manifestations of West Nile virus disease, Emerging Infect. Dis., 11 (2005), 1174. https://doi.org/10.3201/eid1108.050289b doi: 10.3201/eid1108.050289b
![]() |
[7] |
L. Esteva, H. M. Yang, Mathematical model to assess the control of Aedes aegypti mosquitoes by the sterile insect technique, Math. Biosci., 198 (2005), 132–147. https://doi.org/10.1016/j.mbs.2005.06.004 doi: 10.1016/j.mbs.2005.06.004
![]() |
[8] |
E. A. Newton, P. Reiter, A model of the transmission of dengue fever with an evaluation of the impact of ultra-low volume (ULV) insecticide applications on dengue epidemics, Am. J. Trop. Med. Hyg., 47 (1992), 709–720. https://doi.org/10.4269/ajtmh.1992.47.709 doi: 10.4269/ajtmh.1992.47.709
![]() |
[9] |
H. R. Pandey, G. R. Phaijoo, D. B. Gurung, Analysis of dengue infection transmission dynamics in Nepal using fractional order mathematicalmodeling, Chaos, Solitons Fractals: X, 11 (2023), 100098. https://doi.org/10.1016/j.csfx.2023.100098 doi: 10.1016/j.csfx.2023.100098
![]() |
[10] | R. Shi, H. Zhao, S. Tang, Global dynamic analysis of a vector-borne plant disease model, Adv. Differ. Equations, 59 (2014), 1–16. https://doi.org/10.1186/1687-1847-2014-59 |
[11] |
N. S. Chong, J. M. Tchuenche, R. J. Smith, A mathematical model of avian influenza with half-saturated incidence, Theory Biosci., 133 (2014), 23–38. https://doi.org/10.1007/s12064-013-0183-6 doi: 10.1007/s12064-013-0183-6
![]() |
[12] |
Y. Li, F. Haq, K. Shah, G. Rahman, M. Shahzad, Numerical analysis of fractional order pine wilt disease model with bilinear incident rate, J. Math. Comput. Sci., 17 (2017), 420–428. https://doi.org/10.22436/jmcs.017.03.07 doi: 10.22436/jmcs.017.03.07
![]() |
[13] |
X. Yu, S. Yuan, T. Zhang, Persistence and ergodicity of a stochastic single species model with Allee effect under regime switching, Commun. Nonlinear Sci. Numer. Simul., 59 (2018), 359–374. https://doi.org/10.1016/j.cnsns.2017.11.028 doi: 10.1016/j.cnsns.2017.11.028
![]() |
[14] |
X. Lv, X. Meng, X. Wang, Extinction and stationary distribution of an impulsive stochastic chemostat model with nonlinear perturbation, Chaos, Solitons Fractals, 110 (2018), 273–279. https://doi.org/10.1016/j.chaos.2018.03.038 doi: 10.1016/j.chaos.2018.03.038
![]() |
[15] |
T. Su, Q. Yang, X. Zhang, D. Jiang, Stationary distribution, extinction and probability density function of a stochastic SEIV epidemic model with general incidence and Ornstein-Uhlenbeck process, Physica A, 615 (2023), 128605. https://doi.org/10.1016/j.physa.2023.128605 doi: 10.1016/j.physa.2023.128605
![]() |
[16] |
B. Zhou, D. Jiang, B. Han, T. Hayat, Threshold dynamics and density function of a stochastic epidemic model with media coverage and mean-reverting Ornstein-Uhlenbeck process, Math. Comput. Simul., 196 (2022), 15–44. https://doi.org/10.1016/j.matcom.2022.01.014 doi: 10.1016/j.matcom.2022.01.014
![]() |
[17] |
X. Mu, D. Jiang, T. Hayat, A. Alsaedi, Y. Liao, A stochastic turbidostat model with Ornstein-Uhlenbeck process: dynamics analysis and numerical simulations, Nonlinear Dyn., 107 (2022), 2805–2817. https://doi.org/10.1007/s11071-021-07093-9 doi: 10.1007/s11071-021-07093-9
![]() |
[18] |
E. Allen, Environmental variability and mean-reverting processes, Discrete Contin. Dyn. Syst. - Ser. B, 21 (2016), 2073–2089. https://doi.org/10.3934/dcdsb.2016037 doi: 10.3934/dcdsb.2016037
![]() |
[19] | X. Mao, Stochastic Differential Equations and Applications, 2nd edition, Woodhead Publishing, 2011. |
[20] | Z. Ma, Y. Zhou, C. Li, Qualitative and Stability Methods for Ordinary Differential Equations, Science Press, Beijing, 2001. |
[21] |
B. Zhou, D. Jiang, Y. Dai, T. Hayat, Stationary distribution and density function expression for a stochastic SIQRS epidemic model with temporary immunity, Nonlinear Dyn., 105 (2021), 931–955. https://doi.org/10.1007/s11071-020-06151-y doi: 10.1007/s11071-020-06151-y
![]() |
[22] |
S. P. Meyn, R. L. Tweedie, Stability of markovian processes III: foster-lyapunov criteria for continuous-time processes, Adv. Appl. Probab., 25 (1993), 518–548. https://doi.org/10.1017/s0001867800025532 doi: 10.1017/s0001867800025532
![]() |
[23] |
N. T. Dieu, Asymptotic properties of a stochastic SIR epidemic model with Beddington-DeAngelis incidence rate, J. Dyn. Partial Differ. Equations, 30 (2018), 93–106. https://doi.org/10.1007/s10884-016-9532-8 doi: 10.1007/s10884-016-9532-8
![]() |
[24] |
J. S. Muldowney, Compound matrices and ordinary differential equations, Rocky Mt. J. Math., 20 (1990), 857–872. https://doi.org/10.1216/rmjm/1181073047 doi: 10.1216/rmjm/1181073047
![]() |
[25] |
Z. Shi, D. Jiang, Dynamical behaviors of a stochastic HTLV-I infection model with general infection form and Ornstein-Uhlenbeck process, Chaos, Solitons Fractals, 165 (2022), 112789. https://doi.org/10.1016/j.chaos.2022.112789 doi: 10.1016/j.chaos.2022.112789
![]() |
[26] | C. W. Gardiner, Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences, Springer Berlin, 1985. https://doi.org/10.1007/978-3-662-02452-2 |
[27] |
D. J. Higham, An algorithmic introduction to numerical simulation of stochastic differential equations, SIAM Rev., 43 (2001), 525–546. https://doi.org/10.1137/s0036144500378302 doi: 10.1137/s0036144500378302
![]() |
[28] |
M. Aguiar, V. Anam, K. B. Blyuss, C. D. S. Estadilla, B. V. Guerrero, D. Knopoff, et al., Mathematical models for dengue fever epidemiology: A 10-year systematic review, Phys. Life Rev., 40 (2022), 65–92. https://doi.org/10.1016/j.plrev.2022.02.001 doi: 10.1016/j.plrev.2022.02.001
![]() |
[29] |
J. K. K. Asamoah, E. Yankson, E. Okyere, G. Sun, Z. Jin, R. Jan, et al., Optimal control and cost-effectiveness analysis for dengue fever model with asymptomatic and partial immune individuals, Results Phys., 31 (2021), 104919. https://doi.org/10.1016/j.rinp.2021.104919 doi: 10.1016/j.rinp.2021.104919
![]() |
[30] | J. Duan, An Introduction to Stochastic Dynamics, Cambridge University Press, 2015. |
[31] |
A. Yang, H. Wang, T. Zhang, S. Yuan, Stochastic switches of eutrophication and oligotrophication: Modeling extreme weather via non-Gaussian Lévy noise, Chaos, 32 (2022), 043116. https://doi.org/10.1063/5.0085560 doi: 10.1063/5.0085560
![]() |
[32] |
S. Khajanchi, S. Bera, T. K. Roy, Mathematical analysis of the global dynamics of a HTLV-I infection model, considering the role of cytotoxic T-lymphocytes, Math. Comput. Simul., 180 (2021), 354–378. https://doi.org/10.1016/j.matcom.2020.09.009 doi: 10.1016/j.matcom.2020.09.009
![]() |
[33] |
B. Zhou, X. Zhang, D. Jiang, Dynamics and density function analysis of a stochastic SVI epidemic model with half saturated incidence rate, Chaos, Solitons Fractals, 137 (2020), 109865. https://doi.org/10.1016/j.chaos.2020.109865 doi: 10.1016/j.chaos.2020.109865
![]() |
[34] |
X. Mu, D. Jiang, A. Alsaedi, Analysis of a stochastic phytoplankton–zooplankton model under non-degenerate and degenerate diffusions, J. Nonlinear Sci., 32 (2022), 35. https://doi.org/10.1007/s00332-022-09787-9 doi: 10.1007/s00332-022-09787-9
![]() |
[35] |
Y. Cai, J. Jiao, Z. Gui, Y. Liu, W. Wang, Environmental variability in a stochastic epidemic model, Appl. Math. Comput., 329 (2018), 210–226. https://doi.org/10.1016/j.amc.2018.02.009 doi: 10.1016/j.amc.2018.02.009
![]() |
[36] |
Q. Yang, X. Zhang, D. Jiang, Dynamical behaviors of a stochastic food chain system with Ornstein-Uhlenbeck process, J. Nonlinear Sci., 32 (2022), 34. https://doi.org/10.1007/s00332-022-09796-8 doi: 10.1007/s00332-022-09796-8
![]() |
[37] |
B. Zhou, D. Jiang, Y. Dai, T. Hayat, Threshold dynamics and probability density function of a stochastic avian influenza epidemic model with nonlinear incidence rate and psychological effect, J. Nonlinear Sci., 33 (2023), 1–52. https://doi.org/10.1007/s00332-022-09885-8 doi: 10.1007/s00332-022-09885-8
![]() |
1. | H. Bin Jebreen, Hijaz Ahmad, A Novel and Efficient Numerical Algorithm for Solving 2D Fredholm Integral Equations, 2020, 2020, 2314-4785, 1, 10.1155/2020/6662721 | |
2. | Haifa Bin Jebreen, Fairouz Tchier, On the Numerical Simulation of HPDEs Using θ-Weighted Scheme and the Galerkin Method, 2020, 9, 2227-7390, 78, 10.3390/math9010078 | |
3. | Neslişah İmamoğlu Karabaş, Sıla Övgü Korkut, Gurhan Gurarslan, Gamze Tanoğlu, A reliable and fast mesh-free solver for the telegraph equation, 2022, 41, 2238-3603, 10.1007/s40314-022-01927-x | |
4. | M. Abdelhakem, Mona Fawzy, M. El-Kady, Hanaa Moussa, An efficient technique for approximated BVPs via the second derivative Legendre polynomials pseudo-Galerkin method: Certain types of applications, 2022, 43, 22113797, 106067, 10.1016/j.rinp.2022.106067 | |
5. | Ishtiaq Ali, Maliha Tehseen Saleem, Azhar ul Din, Special Functions and Its Application in Solving Two Dimensional Hyperbolic Partial Differential Equation of Telegraph Type, 2023, 15, 2073-8994, 847, 10.3390/sym15040847 | |
6. | Şuayip Yüzbaşı, Gamze Yıldırım, A numerical approach to solve hyperbolic telegraph equations via Pell–Lucas polynomials, 2023, 17, 1658-3655, 10.1080/16583655.2023.2255404 | |
7. | Haifa Bin Jebreen, Beatriz Hernández-Jiménez, An approach based on the pseudospectral method for fractional telegraph equations, 2023, 8, 2473-6988, 29221, 10.3934/math.20231496 |