Research article Special Issues

A novel formulation of the fuzzy hybrid transform for dealing nonlinear partial differential equations via fuzzy fractional derivative involving general order

  • Received: 20 March 2022 Revised: 25 May 2022 Accepted: 30 May 2022 Published: 13 June 2022
  • MSC : 46S40, 47H10, 54H25

  • The main objective of the investigation is to broaden the description of Caputo fractional derivatives (in short, CFDs) (of order 0<α<r) considering all relevant permutations of entities involving t1 equal to 1 and t2 (the others) equal to 2 via fuzzifications. Under gH-differentiability, we also construct fuzzy Elzaki transforms for CFDs for the generic fractional order α(r1,r). Furthermore, a novel decomposition method for obtaining the solutions to nonlinear fuzzy fractional partial differential equations (PDEs) via the fuzzy Elzaki transform is constructed. The aforesaid scheme is a novel correlation of the fuzzy Elzaki transform and the Adomian decomposition method. In terms of CFD, several new results for the general fractional order are obtained via gH-differentiability. By considering the triangular fuzzy numbers of a nonlinear fuzzy fractional PDE, the correctness and capabilities of the proposed algorithm are demonstrated. In the domain of fractional sense, the schematic representation and tabulated outcomes indicate that the algorithm technique is precise and straightforward. Subsequently, future directions and concluding remarks are acted upon with the most focused use of references.

    Citation: M. S. Alqurashi, Saima Rashid, Bushra Kanwal, Fahd Jarad, S. K. Elagan. A novel formulation of the fuzzy hybrid transform for dealing nonlinear partial differential equations via fuzzy fractional derivative involving general order[J]. AIMS Mathematics, 2022, 7(8): 14946-14974. doi: 10.3934/math.2022819

    Related Papers:

    [1] Zhenhua Su, Zikai Tang . Minimum distance–unbalancedness of the merged graph of C3 and a tree. AIMS Mathematics, 2024, 9(7): 16863-16875. doi: 10.3934/math.2024818
    [2] Muhammad Kamran Jamil, Muhammad Imran, Aisha Javed, Roslan Hasni . On the first general Zagreb eccentricity index. AIMS Mathematics, 2021, 6(1): 532-542. doi: 10.3934/math.2021032
    [3] Vu Dinh, Lam Si Tung Ho . Convergence of maximum likelihood supertree reconstruction. AIMS Mathematics, 2021, 6(8): 8854-8867. doi: 10.3934/math.2021513
    [4] Zhen Lin . The biharmonic index of connected graphs. AIMS Mathematics, 2022, 7(4): 6050-6065. doi: 10.3934/math.2022337
    [5] Xiao Xu, Hong Liao, Xu Yang . An automatic density peaks clustering based on a density-distance clustering index. AIMS Mathematics, 2023, 8(12): 28926-28950. doi: 10.3934/math.20231482
    [6] Junfeng An, Yingzhi Tian . Graphs with a given conditional diameter that maximize the Wiener index. AIMS Mathematics, 2024, 9(6): 15928-15936. doi: 10.3934/math.2024770
    [7] Yang Liu, Ruihu Li, Qiang Fu, Hao Song . On the minimum distances of binary optimal LCD codes with dimension 5. AIMS Mathematics, 2024, 9(7): 19137-19153. doi: 10.3934/math.2024933
    [8] Rehab Alharbi, Hibba Arshad, Imran Javaid, Ali. N. A. Koam, Azeem Haider . Distance-based granular computing in networks modeled by intersection graphs. AIMS Mathematics, 2025, 10(5): 10528-10553. doi: 10.3934/math.2025479
    [9] Milica Anđelić, Saleem Khan, S. Pirzada . On graphs with a few distinct reciprocal distance Laplacian eigenvalues. AIMS Mathematics, 2023, 8(12): 29008-29016. doi: 10.3934/math.20231485
    [10] Syafrizal Sy, Rinovia Simanjuntak, Tamaro Nadeak, Kiki Ariyanti Sugeng, Tulus Tulus . Distance antimagic labeling of circulant graphs. AIMS Mathematics, 2024, 9(8): 21177-21188. doi: 10.3934/math.20241028
  • The main objective of the investigation is to broaden the description of Caputo fractional derivatives (in short, CFDs) (of order 0<α<r) considering all relevant permutations of entities involving t1 equal to 1 and t2 (the others) equal to 2 via fuzzifications. Under gH-differentiability, we also construct fuzzy Elzaki transforms for CFDs for the generic fractional order α(r1,r). Furthermore, a novel decomposition method for obtaining the solutions to nonlinear fuzzy fractional partial differential equations (PDEs) via the fuzzy Elzaki transform is constructed. The aforesaid scheme is a novel correlation of the fuzzy Elzaki transform and the Adomian decomposition method. In terms of CFD, several new results for the general fractional order are obtained via gH-differentiability. By considering the triangular fuzzy numbers of a nonlinear fuzzy fractional PDE, the correctness and capabilities of the proposed algorithm are demonstrated. In the domain of fractional sense, the schematic representation and tabulated outcomes indicate that the algorithm technique is precise and straightforward. Subsequently, future directions and concluding remarks are acted upon with the most focused use of references.



    Constructing quantum codes is an important subject in the quantum information. The CSS construction and the Hermitian construction were introduced to construct quantum codes from classical error-correcting codes in [1,2,3,4]. Constructing quantum codes needs Euclidean dual-containing or Hermitian dual-containing codes with respect to the Euclidean or Hermitian inner product using the CSS construction or Hermitian construction. Fan and Zhang [5] introduced the Galois inner products to generalize the Euclidean inner product and the Hermitian inner product. In [6], Hermitian LCD λ-constacyclic codes over Fq were addressed by studying the Galois inner product. Galois hulls of linear codes over finite fields were addressed by studying the Galois dual in [7]. In [8], σ-self-orthogonal constacyclic codes over Fpm+uFpm were studied by generalizing the notion of self-orthogonal codes to σ-self-orthogonal codes over an arbitrary finite ring. Fu and Liu [9] extended constacyclic codes to obtain Galois self-dual codes.

    Now, many quantum codes have been constructed by studying the algebraic structure of cyclic and constacyclic codes over finite fields, finite chain rings and finite non-chain ring. Huang et al. [10] constructed quantum codes from Hermitian dual-containing codes by applying the Hermitian construction. In [11], some quantum codes were obtained from constacyclic over Fq[u,v]/u2γu,v2δv,uv=vu=0 by using the CSS construction. Gowdhaman et al. [12] studied the the structure of cyclic and λ-constacyclic codes over Fp[u,v]v3v,u3u,uvvu and constructed quantum codes over Fp using the CSS construction. Islam and Prakash [13] obtained quantum codes from cyclic codes over a finite non-chain ring Fq[u,v]/u2αu,v21,uvvu using the CSS construction. Kong and Zheng obtained some quantum codes from constacyclic codes over Fq[u1,u2,,uk]/u3i=ui,uiuj=ujui [14] and Fq[u1,u2,,uk]/u3i=ui,uiuj=ujui=0 [15] using the CSS construction. As an application, Galois inner product can be applied in the constructions of quantum codes. Some entanglement-assisted quantum codes were obtained from Galois dual codes in [16,17,18].

    Motivated by these works, we define a new non-chain ring Rl,k by generalizing [15] and study the algebraic structure of σ-self-orthogonal and σ-dual-containing constacyclic codes over Rl,k based on the σ-inner product. Then, we give the necessary and sufficient conditions for λ-constacyclic codes over Rl,k to satisfy σ-self-orthogonal and σ-dual-containing. Finally, we obtain some new quantum codes from σ-dual-containing constacyclic codes over Rl,k using the CSS construction or Hermitian construction and compare these codes better with the existing codes that appeared in some recent papers.

    Let R be a finite commutative ring, I is an ideal of R and I is generated by one element, then I is called a principal ideal. If all the ideas of R are principal, R is called a principal ideal ring. If R has a unique maximal ideal, R is called a local ring. If the ideals of R are linearly ordered by inclusion, R is called a chain ring.

    Let Rl,k=Fpm[u1,u2,,uk]/uli=ui,uiuj=ujui=0, where p is a prime, l is a positive integer, (l1)(p1) and 1i,jk. It is a commutative non-chain ring with pm(l1)k+m elements. Since (l1)(p1), then

    uliui=(uiα1)(uiα2)(uiαl),

    where αiFpm for i=1,2,,l.

    Let

    ςij=(ujα1)(ujαi1)(ujαi+1)(ujαl)(αiα1)(αiαi1)(αiαi+1)(αiαl),

    where 2il and 1jk.

    We can get that ijςij=1, ς2ij=ςij and ςijςij=0, where (i,j)(i,j).

    Let e1=ς21,e2=ς22,,ek=ς2k,,e(l1)k=ςlk,e(l1)k+1=ς11. Let s=(l1)k+1, thus, 1=e1+e2++es, e2i=ei and eiej=0, where ij and i,j=1,2,,s. By the Chinese Remainder Theorem, then

    Rl,k=sj=1ejRl,k=sj=1ejFpm.

    For any element rRl,k, it can be expressed uniquely as

    r=r1e1+r2e2++rses,

    where riFpm for i=1,2,,s.

    Let Aut(Rl,k) be the ring automorphism group of Rl,k. If σAut(Rl,k), then we can get a bijective map

    Rnl,kRnl,k,(a0,a1,,an1)(σ(a0),σ(a1),,σ(an1)).

    Let a=(a0,a1,,an1) and b=(b0,b1,,bn1)Rnl,k, the σ-inner product [8] of a,b is defined as

    a,bσ=a0σ(b0)+a1σ(b1)++an1σ(bn1).

    When Rl,k=Fpm and σ is the identity map of Fpm, then σ-inner product is the Euclidean inner product. When Rl,k=Fpm and m is even, aFpm, if σ(a)=apm2, then σ-inner product is the Hermitian inner product. When Rl,k=Fpm and aFpm, σ(a)=apl, 0lm1, then σ-inner product is the Galois inner product [5].

    When a,bσ=0, a and b are called σ-orthogonal, for any code C over Rl,k, the σ-dual code of C is defined as

    Cσ={x|x,yσ=0,yC}.

    If CCσ, C is σ-self-orthogonal, if CσC, C is σ-dual-containing, and if C=Cσ, C is σ-self-dual.

    Let θt be an automorphism of Fpm, θt: FpmFpm defined by θt(a)=apt, where 0tm1. We can define the automorphism of Rl,k as follows:

    σ:Rl,kRl,k,sj=1ajejsj=1ejaptj.

    Let c=(c0,c1,,cn1)Rnl,k and λ be a unit of Rl,k, then the constacyclic shift δλ of c is defined as δλ(c)=(λcn1,c0,,cn2). If δλ(C)=C, C is called a λ-constacyclic code of length n over Rl,k. In particular, when λ=1, C is called cyclic code and negative cyclic code when λ=1.

    Let f(x)=a0+a1x+a2x2++ar1xr1+xr be a monic polynomial, the reciprocal polynomial of f(x) is denoted by f(x)=xrf(x1).

    Each codeword (a0,a1,,an1)Rnl,k can be represented by a polynomial a0+a1x++an1xn1Rl,k[x]/xnλ,

    ψ:Rnl,kRl,k[x]/xnλ,(a0,a1,,an1)a0+a1x++an1xn1.

    In polynomial representation, a λ-constacyclic code of length n over Rl,k is defined as an ideal of Rl,k[x]/xnλ.

    We define a Gray map ϕl,k:Rl,kFspm by a=si=1aiei(a1,a2,,as), and we extend ϕl,k as

    ϕl,k:Rnl,kFsnpm,(a0,a1,,an1)(a1,0,,a1,n1,a2,0,,a2,n1,,as,0,,as,n1),

    where ai=a1,ie1+a2,ie2++as,iesRl,k, i=0,1,,n1.

    rRl,k, the Gray weight of r is defined as wG(r)=wH(ϕl,k(r)), where wH(ϕl,k(r)) is the Hamming weight of the image of r under ϕl,k.

    x=(x1,x2,,xn),y=(y1,y2,,yn)Rnl,k, the Gray weight of xy is defined as wG(xy)=ni=1wG(xiyi), the Gray distance of x,y is defined as dG(x,y)=wG(xy), and the Gray distance of C is defined as dG(C)=min{dG(a,b),a,bC,ab}.

    For a linear code C of length n over Rl,k. Let

    Cj={xjFnpmsi=1xieiC,xiFnpm},

    where j=1,2,,s.

    Then, C1,C2,,Cs are linear codes of length n over Fpm, C=sj=1ejCj and C∣=sj=1Cj.

    Lemma 2.1. An element (λ1e1+λ2e2++λses)Rl,k is a unit in Rl,k if and only if λi is a unit in Fpm for i=1,2,,s.

    Proof. This proof is the same as Lemma 3.1 in [14].

    In this section, let λ=sj=1λjej be a unit in Rl,k, then λ1=sj=1λ1jej, where s=(l1)k+1, λjFpm for j=1,2,,s.

    Lemma 3.1. (See [8]) Let R be a finite commutative Frobenius ring with identity, σ,˜σAut(R) and C be a liner code of length n over R, then

    (1) Cσ is a linear code over R.

    (2) Cσ=σ1(C) and C∣∣Cσ∣=∣Rn.

    (3) (Cσ)˜σ=˜σ1σ1(C).

    Theorem 3.1. C=sj=1ejCj is a λ-constacyclic code of length n over Rl,k if and only if Cj is a λj-constacyclic code of length n over Fpm for j=1,2,,s.

    Proof. This proof is the same as Theorem 1 in [15].

    Theorem 3.2. Let C=sj=1ejCj be a linear code of length n over Rl,k. Then Cσ=sj=1ejCσj, where Cσj is the σ dual code of Cj for j=1,2,,s.

    Proof. Let ˜C=sj=1ejCσj, x=sj=1ejxjC and ˜x=sj=1ej~xj˜C, then

    x,˜xσ=sj=1(xjσ(~xj))ej=0,

    where xjCj, ~xjCσj.

    So

    ˜CCσ.

    For Rl,k is a Frobenius ring, by Lemma 3.1,

    C∣∣Cσ∣=∣Rl,kn.

    Hence

    ˜C∣=sj=1Cσj∣=sj=1pmnCj=Rl,knC=∣Cσ.

    So

    Cσ=˜C=sj=1ejCσj.

    Theorem 3.3. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k. Then Cσ=sj=1ejCσj is a σ(λ1)-constacyclic code of length n over Rl,k, and Cσj is a σ(λ1j)-constacyclic code over Fpm for j=1,2,,s.

    Proof. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k. x=(x0,x1,,xn1)Cσ and y=(y0,y1,,yn1)C, then

    δn1λ(y)=(λy1,λy2,,λyn1,y0)C

    and

    δσ(λ1)(x)=(σ(λ1)xn1,x0,,xn2).

    We can get that

    0=x,δn1λ(y)σ=σ(λ)x0σ(y1)+σ(λ)x1σ(y2)++σ(λ)xn2σ(yn1)+xn1σ(y0)=σ(λ)(x0σ(y1)+x1σ(y2)++xn2σ(yn1)+σ(λ1)xn1σ(y0)).

    So

    δσ(λ1)(x),yσ=σ(λ1)xn1σ(y0)+x0σ(y1)++xn2σ(yn1)=0.

    We have δσ(λ1)(x)Cσ, so Cσ is a σ(λ1)-constacyclic code.

    By Lemma 2.1, λ1=λ11e1+λ12e2++λ1ses, it implies that Cσ is a σ(λ1)-constacyclic code of length n over Rl,k. By Theorem 3.1, we can have Cj is a σ(λ1j)-constacyclic code over Fpm for j=1,2,,s.

    Theorem 3.4. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k, then there exists a polynomial g(x)Rl,k[x] such that C=g(x), where g(x)=sj=1ejgj(x) is the divisor of xnλ, gj(x)Fpm[x] is the generator polynomial of λj-constacyclic over Cj, and gj(x) divides xnλj for j=1,2,,s.

    Proof. This proof is the same as Theorem 2 in [15].

    Corollary 3.1. Let C=g(x) be a λ-constacyclic code of length n over Rl,k. Then Cσ=sj=1ejσ1(fj(x)) and Cσ∣=pmsj=1deg(gj), where fj(x)gj(x)=xnλj, j=1,2,,s.

    Proof. Let Cj=fj(x). By Lemma 3.1, Theorem 3.3 and Theorem 3.4, we can have

    Cσj=σ1(Cj)=σ1(fj(x))

    and

    Cσ=sj=1ejCσj,

    where j=1,2,,s.

    Then

    Cσ∣=sj=1Cσj∣=sj=1Cj∣=pmsj=1deg(gj)

    and Cσ has the form

    Cσ=e1σ1(f1(x)),,esσ1(fs(x)).

    Let

    ˜D=sj=1ejσ1(fj(x)),

    it is easy to see that, ˜DC.

    On the other hand, for j=1,2,,s,

    ejsj=1ejσ1(fj(x))=ejσ1(fj(x)).

    Thus Cσ˜D, it implies that,

    Cσ=˜D=sj=1ejσ1(fj(x)).

    Theorem 3.5. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k, then C is a σ-self-orthogonal code over Rk if and only if C1,C2,,Cs are σ-self-orthogonal codes over Fpm.

    Proof. By Theorem 3.2, Cσ=sj=1ejCσj, so CCσ if and only if CjCσj, it implies that C is a σ-self-orthogonal code over Rl,k if and only if C1,C2,,Cs are σ-self-orthogonal codes over Fpm.

    Lemma 3.2. Let C be a λ-constacyclic code of length n over Fpm, its generator polynomial is g(x). Then C is a σ-self-orthogonal code if and only if f(x)σ1(f(x)) is the divisor of xnλ, λ=±1, where f(x) is the generator polynomial of C.

    Proof. We can assume that σ(λ1)=λ.

    Since C is a λ-constantcyclic code of length n over Fpm, and Cσ is a σ(λ1)-constantcyclic code of length n over Fpm, so C is a σ-self-orthogonal code must satisfy the condition CCσ.

    Let C=f(x), where f(x)g(x)=(xnλ) and λ=±1. Cσ=σ1(C)=σ1(f(x)), C is a σ-self-orthogonal code if and only if there exists a polynomial h(x)Fpm[x], such that σ1(f(x))h(x)=g(x), if and only if f(x)σ1(f(x))h(x)=f(x)g(x)=(xnλ) if and only if f(x)σ1(f(x)) is the divisor of xnλ.

    By Theorem 3.5 and Lemma 3.2, it is easy to get the following theorem.

    Theorem 3.6. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k, then C is a σ-self-orthogonal code over Rl,k if and only if fj(x)σ1(fj(x)) is the divisor of xnλj, where fj(x) is the generator polynomial of Cj and σ(λ1j)=λj for j=1,2,,s.

    Theorem 4.1. Let C=sj=1ejCj be a linear code of length n over Rl,k, which order C∣=pmk and the minimum Gray distance of C is dG, where s=(l1)k+1. Then ϕl,k(C) is a linear code [sn,k,dG] and ϕl,k(C)σ=ϕl,k(Cσ). If C is a σ-self-orthogonal code over Rl,k, then ϕl,k(C) is a σ-self-orthogonal code over Fpm. Specifically, if C is a σ-self-dual code over Rl,k, then ϕl,k(C) is a σ-self-dual code over Fpm.

    Proof. By the definition of ϕl,k, it is easy to know that ϕl,k is both a distance preserving map and a linear map from Rnl,k to Fsnq, it implies that ϕl,k(C) is a linear code [sn,k,dG].

    If C is a σ-self-orthogonal code, x=sj=1ejxjC, y=sj=1ejyjC, where xj,yjFnpm, because CCσ, so the σ-inner product of x,y is x,yσ=sj=1ejxj,yjσ=0, which implies xj,yjσ=0, so

    ϕl,k(x),ϕl,k(y)σ=sj=1xj,yjσ=0.

    So ϕl,k(C) is a σ-self-orthogonal code over Fpm.

    Let a=(a0,a1,,an1)C and b=(b0,b1,,bn1)Cσ, where aj=si=1ai,jei and bj=si=1bi,jeiRl,k for j=0,1,2,,n1, a(i)=(ai,0,ai,1,,ai,n1) and b(i)=(bi,0,bi,1,,bi,n1) for i=1,2,,s.

    Then

    a,bσ=n1j=0aj,bjσ=n1j=0si=1eiai,j,bi,jσ=si=1eia(i),b(i)σ=0.

    So a(i),b(i)σ=0 for i=1,2,,s.

    Since ϕl,k(a)=(a(1),a(2),,a(s)) and ϕl,k(b)=(b(1),b(2),,b(s)). It follows that

    ϕl,k(a),ϕl,k(b)σ=si=1a(i),b(i)σ=0.

    So we have

    ϕl,k(Cσ)ϕl,k(C)σ.

    As ϕl,k is a bijection, and C∣=∣ϕl,k(C).

    Then

    ϕl,k(Cσ)∣=∣ϕl,k(C)∣=pmsnC=pmsnϕl,k(C)=∣ϕl,k(C)∣=∣ϕl,k(C)σ.

    We have

    ϕl,k(C)σ=ϕl,k(Cσ).

    Suppose C is a σ-self-dual code and C=Cσ, then

    ϕl,k(C)σ=ϕl,k(Cσ)=ϕl,k(C).

    Therefore, ϕl,k(C) is a σ-self-dual code over Fpm.

    Lemma 4.1. Let C be a λ-constacyclic code of length n over Fpm, whose generator polynomial is g(x). Then, C is a σ-dual-containing code if and only if xnλ is the divisor of σ1(f(x))f(x), where f(x) is the generator polynomial of C and σ(λ1)=λ.

    Proof. Let C=f(x), where f(x)g(x)=(xnλ) and σ(λ1)=λ. Then Cσ=σ1(C)=σ1(f(x)), so C is a σ-dual-containing code if and only if there exists a polynomial h(x)Fpm[x], such that σ1(f(x))=h(x)g(x), if and only if σ1(f(x))f(x)=h(x)g(x)f(x)=h(x)f(x)g(x)=h(x)(xnλ) if and only if xnλ is the divisor of σ1(f(x))f(x).

    Theorem 4.2. (CSS construction [4]) Let C=[n,k,d] be a linear codes over Fq with CC, then there exists a quantum code [[n,2kn,d]]q.

    Theorem 4.3. (Hermitian construction [4]) Let C=[n,k,d] be a linear code over Fq2 with CHC, then there exists a quantum code [[n,2kn,d]]q.

    By Lemma 4.1 and Theorem 3.3, we can have the following theorem.

    Theorem 4.4. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k, where s=(l1)k+1. Then CσC if and only if xnλj is the divisor of σ1(fj(x))fj(x), where σ(λ1j)=λj and fj(x) is the generator polynomial of Cj for j=1,2,,s.

    By Lemma 4.1 and Theorem 4.4, we can have the following corollary and theorem.

    Corollary 4.1. Let C=sj=1ejCj be a λ-constacyclic code of length n over Rl,k. Then CσC if and only if CσjCj for j=1,2,,s.

    Theorem 4.5. Let C=sj=1ejCj be a a λ-constacyclic code of length n over Rl,k, Cj is λj-constacyclic code over Fpm and CσjCj, where s=(l1)k+1, σ(λ1j)=λj for j=1,2,,s. Then ϕl,k(C)σϕl,k(C). If θt is the identity map of Fpm, then there exists a quantum code [[sn,2ksn,dG]]pm. If m is even, aFpm, then σ(a)=apm2, then there exists a quantum code [[sn,2ksn,dG]]pm/2, where dG is the minimum Gray weight of code C, and k is the dimension of the linear code ϕl,k(C).

    Proof. Let CσjCj and σ(λ1j)=λj. By Corollary 4.1, we have CσC, so ϕl,k(Cσ)ϕl,k(C). By Theorem 4.1, ϕl,k(C)σ=ϕl,k(Cσ), therefore ϕl,k(C)σϕl,k(C), and by Theorem 4.1, ϕl,k(C) is a linear code [sn,k,d].

    If θt is the identity map of Fpm, so σ-inner product is the Euclidean inner product, by Theorem 4.2, there exists a quantum code [[sn,2ksn,dG]]pm.

    If m is even, aFpm, then σ(a)=apm2, so σ-inner product is the Hermitian inner product. By Theorem 4.3, there exists a quantum code [[sn,2ksn,dG]]pm/2.

    Example 4.1. Let n=8 and R2,2=F17[u1,u2]/u21=u1,u22=u2,u1u2=u2u1=0. In F17[x],

    x81=(x+1)(x+2)(x+4)(x+8)(x+9)(x+13)(x+15)(x+16),x8+1=(x+3)(x+5)(x+6)(x+7)(x+10)(x+11)(x+12)(x+14).

    If θt is the identity map of Fpm, then σ-inner product is the Euclidean inner product. Let C be an (e1+e2+(1)e3)-constacyclic code of length 8 over R2,2. Let g(x)=e1g1+e2g2+e3g3 be the generator polynomial of C, where g1(x)=(x+2)(x+4)(x+8),g2(x)=g3(x)=(x+3), then C1=g1(x) is a cyclic code of length 8 over F17, C2=g2(x) and C3=g3(x) are negacyclic codes of length 8 over F17.

    By Theorem 4.1, ϕ2,2(C) is a linear code over F17 with parameters [24,19,4]. By Theorem 4.5, we have CC, we get a quantum code [[24,14,4]]17.

    Example 4.2. Let n=45 and R2,2=F5[u1,u2]/u21=u1,u22=u2,u1u2=u2u1=0. In F5[x],

    x451=(x2+x+1)5(x+4)5(x6+x3+1)5,x45+1=(x2+4x+1)5(x+1)5(x6+4x3+1)5.

    Let C be an (e1+(1)e2+(1)e3)-constacyclic code of length 45 over R2,2. Let g1(x)=x2+x+1, g2(x)=g3(x)=x+1, then C1=g1(x) is a cyclic code of length 45, C2=g2(x) and C3=g3(x) are negacyclic codes of length 45 over F5.

    By Theorem 4.1, ϕ2,2(C) is a linear code over F5 with parameters [135,131,3]. By Theorem 4.5, we have CC, we can get a quantum code [[135,127,3]]5, which has larger dimension than [[135,63,3]]5 in [12].

    Example 4.3. Let n=30 and R2,2=F5[u1,u2]/u21=u1,u22=u2,u1u2=u2u1=0. In F5[x],

    x301=(x2+x+1)5(x+4)5(x+1)5(x2+4x+1)5,x30+1=(x2+2x+4)5(x+3)5(x+2)5(x2+3x+4)5.

    Let C be an (e1+(1)e2+(1)e3)-constacyclic code of length 30 over R2,2. Let g1(x)=x2+x+1, g2(x)=g3(x)=x+3, then C1=g1(x) is a cyclic code of length 30, C2=g2(x) and C3=g3(x) are negacyclic codes of length 30 over F5.

    By Theorem 4.1, ϕ2,2(C) is a linear code over F5 with parameters [90,86,3]. By Theorem 4.5, we have CC, we get a quantum code [[90,82,3]]5, which has larger dimension than [[90,68,3]]5 in [11].

    Example 4.4. Let n=8 and R1,2=F9[u1]/u21=u1, σ(a)=a3. In F9[x],

    x81=(x+1)(x+w)(x+w2)(x+w3)(x+2)(x+w5)(x+w6)(x+w7).

    Let C be an (e1+e2)-constacyclic code of length 8 over R1,2. Let g1(x)=(x+w)(x+w2) and g2(x)=x+w3, then C1=g1(x) and C2=g2(x) are cyclic codes of length 8 over F9.

    By Theorem 4.1, ϕ1,2(C) is a linear code over F9 with parameters [16,13,3]. By Theorem 4.5, we have CσC, we can get a quantum code [[16,10,3]]3 satisfying nk+22d=2.

    In Table 1, we provide some new quantum codes (in the eighth column) and compare the existing codes (in the ninth column) better (by means of larger code rate or larger distance) than [11,12,13]. Further, the fifth column gives the value of units (λ1,,λs), the sixth column gives the generator polynomials g1(x),,gs(x), where gi(x)=anxn+an1xn1++a1x+a0 is denoted by anan1a1a0, e.g., "11" represents the polynomial "x2+x", the seventh column gives parameters of ϕl,k(C).

    Table 1.  New quantum codes from σ-dual-containing constacyclic codes over Rl,k.
    pm n k l (λ1,,λs) g1(x),,gs(x) ϕl,k(C) New codes Existing codes
    5 60 2 2 (1,1,1) (11,13,10301) [180,174,3] [[180,168,3]]5 [[180,166,3]]5[11]
    5 33 2 2 (1,1,1) (124114,114431,114431) [99,84,5] [[99,69,5]]5 [[99,9,5]]5[12]
    5 93 2 2 (1,1,1) (1014,1014,1011) [279,270,3] [[279,261,3]]5 [[279,225,3]]5[12]
    17 45 2 2 (1,1,1) (15(13)81,146(16)1,146(16)1 [135,123,5] [[135,111,5]]17 [[135,63,3]]17[12]
    3 48 2 2 (1,1,1) (1211011,11,11) [144,136,4] [[144,128,4]]3 [[144,36,3]]3[12]
    5 44 2 2 (1,1,1) (114431,134411,134411) [132,117,5] [[132,102,5]]5 [[132,92,4]]3[13]
    5 48 2 2 (1,1,1) (12,13,13) [144,141,2] [[144,138,2]]5 [[144,136,2]]5[13]
    9 14 1 2 (1,1) (1ww72,1w) [28,24,4] [[28,20,4]]9 [[28,10,4]]9[13]

     | Show Table
    DownLoad: CSV

    In this article, we construct quantum codes by studying the algebraic structure of σ-self-orthogonal constacyclic codes over a new finite non-chain ring Rl,k, and our results will enrich the code sources of constructing quantum codes. As an application, we obtain some new quantum codes from σ-dual-containing constacyclic codes over Rl,k using the CSS construction or Hermitian construction and compare these codes better with the existing codes that appeared in some recent references.

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

    This work was supported in part by the Zhengzhou Special Fund for Basic Research and Applied Basic Research under Grant ZZSZX202111, in part by the Postgraduate Education Reform and Quality Improvement Project of Henan Province under Grant YJS2023JD6, and in part by the Soft Science Research Project of Henan Province under Grant 232400411122.

    We would like to thank the referees and the editor for their careful reading the paper and valuable comments and suggestions, which improved the presentation of this manuscript.

    We declare no conflicts of interest.



    [1] M. Nazeer, F. Hussain, M. I. Khan, A. ur Rehman, E. R. El-Zahar, Y. M. Chu, et al., Theoretical study of MHD electro-osmotically flow of third-grade fluid in micro channel, Appl. Math. Comput., 420 (2022), 126868. https://doi.org/10.1016/j.amc.2021.126868 doi: 10.1016/j.amc.2021.126868
    [2] Y. M. Chu, B. M. Shankaralingappa, B. J. Gireesha, F. Alzahrani, M. Ijaz Khan, S. U. Khan, Combined impact of Cattaneo-Christov double diffusion and radiative heat flux on bio-convective flow of Maxwell liquid configured by a stretched nano-material surface, Appl. Math. Comput., 419 (2022), 126883. https://doi.org/10.1016/j.amc.2021.126883 doi: 10.1016/j.amc.2021.126883
    [3] Y. M. Chu, U. Nazir, M. Sohail, M. M. Selim, J. R. Lee, Enhancement in thermal energy and solute particles using hybrid nanoparticles by engaging activation energy and chemical reaction over a parabolic surface via finite element approach, Fractal Fract., 5 (2021), 119. https://doi.org/10.3390/fractalfract5030119 doi: 10.3390/fractalfract5030119
    [4] T. H. Zhao, M. I. Khan, Y. M. Chu, Artificial neural networking (ANN) analysis for heat and entropy generation in flow of non-Newtonian fluid between two rotating disks, Math. Methods Appl. Sci., 2021. https://doi.org/10.1002/mma.7310 doi: 10.1002/mma.7310
    [5] Y. M. Chu, S. Bashir, M. Ramzan, M. Y. Malik, Model-based comparative study of magnetohydrodynamics unsteady hybrid nanofluid flow between two infinite parallel plates with particle shape effects, Math. Methods Appl. Sci., 2022. https://doi.org/10.1002/mma.8234 doi: 10.1002/mma.8234
    [6] S. A. Iqbal, M. G. Hafez, Y. M. Chu, C. Park, Dynamical analysis of nonautonomous RLC circuit with the absence and presence of Atangana-Baleanu fractional derivative, J. Appl. Anal. Comput., 12 (2022), 770–789. https://doi.org/10.11948/20210324 doi: 10.11948/20210324
    [7] F. Jin, Z. S. Qian, Y. M. Chu, M. ur Rahman, On nonlinear evolution model for drinking behavior under Caputo-Fabrizio derivative, J. Appl. Anal. Comput., 12 (2022), 790–806. https://doi.org/10.11948/20210357 doi: 10.11948/20210357
    [8] F. Z. Wang, M. N. Khan, I. Ahmad, H. Ahmad, H. Abu-Zinadah, Y. M. Chu, Numerical solution of traveling waves in chemical kinetics: Time-fractional fishers equations, Fractals, 30 (2022), 2240051. https://doi.org/10.1142/S0218348X22400515 doi: 10.1142/S0218348X22400515
    [9] S. Rashid, A. Khalid, S. Sultana, F. Jarad, K. M. Abualnaja, Y. S. Hamed, Novel numerical investigation of the fractional oncolytic effectiveness model with M1 virus via generalized fractional derivative with optimal criterion, Results Phys., 37 (2022), 105553. https://doi.org/10.1016/j.rinp.2022.105553 doi: 10.1016/j.rinp.2022.105553
    [10] T. H. Zhao, O. Castillo, H. Jahanshahi, A. Yusuf, M. O. Alassafi, F. E. Alsaadi, et al., A fuzzy-based strategy to suppress the novel coronavirus (2019-NCOV) massive outbreak, Appl. Comput. Math., 20 (2021), 160–176.
    [11] S. Rashid, F. Jarad, A. G. Ahmad, K. M. Abualnaja, New numerical dynamics of the heroin epidemic model using a fractional derivative with Mittag-Leffler kernel and consequences for control mechanisms, Results Phys., 35 (2022), 105304. https://doi.org/10.1016/j.rinp.2022.105304 doi: 10.1016/j.rinp.2022.105304
    [12] S. N. Hajiseyedazizi, M. E. Samei, J. Alzabut, Y. M. Chu, On multi-step methods for singular fractional q-integro-differential equations, Open Math., 19 (2021), 1378–1405. https://doi.org/10.1515/math-2021-0093 doi: 10.1515/math-2021-0093
    [13] T. H. Zhao, M. K. Wang, Y. M. Chu, On the bounds of the perimeter of an ellipse, Acta Math. Sci., 42 (2022), 491–501. https://doi.org/10.1007/s10473-022-0204-y doi: 10.1007/s10473-022-0204-y
    [14] T. H. Zhao, M. K. Wang, G. J. Hai, Y. M. Chu, Landen inequalities for Gaussian hypergeometric function, RACSAM, 116 (2022), 53. https://doi.org/10.1007/s13398-021-01197-y doi: 10.1007/s13398-021-01197-y
    [15] H. H. Chu, T. H. Zhao, Y. M. Chu, Sharp bounds for the Toader mean of order 3 in terms of arithmetic, quadratic and contraharmonic means, Math. Slovaca, 70 (2020), 1097–1112. https://doi.org/10.1515/ms-2017-0417 doi: 10.1515/ms-2017-0417
    [16] K. S. Miller, B. Ross, Introduction to the fractional calculus and fractional differential equations, New York: John Wiley & Sons, 1993.
    [17] I. Podlubny, Fractional differential equations, San Diego: Academic Press, 1998.
    [18] S. Rashid, E. I. Abouelmagd, S. Sultana, Y. M. Chu, New developments in weighted n-fold type inequalities via discrete generalized ĥ-proportional fractional operators, Fractals, 30 (2022), 2240056. https://doi.org/10.1142/S0218348X22400564 doi: 10.1142/S0218348X22400564
    [19] S. Rashid, S. Sultana, Y. Karaca, A. Khalid, Y. M. Chu, Some further extensions considering discrete proportional fractional operators, Fractals, 30 (2022), 2240026. https://doi.org/10.1142/S0218348X22400266 doi: 10.1142/S0218348X22400266
    [20] S. Rashid, E. I. Abouelmagd, A. Khalid, F. B. Farooq, Y. M. Chu, Some recent developments on dynamical -discrete fractional type inequalities in the frame of nonsingular and nonlocal kernels, Fractals, 30 (2022), 2240110. https://doi.org/10.1142/S0218348X22401107 doi: 10.1142/S0218348X22401107
    [21] H. M. Srivastava, A. K. N. Alomari, K. M. Saad, W. M. Hamanah, Some dynamical models involving fractional-order derivatives with the Mittag-Leffler type kernels and their applications based upon the Legendre spectral collocation method, Fractal Fract., 5 (2021), 131. https://doi.org/10.3390/fractalfract5030131 doi: 10.3390/fractalfract5030131
    [22] H. M. Srivastava, K. M. Saad, Numerical Simulation of the fractal-fractional Ebola virus, Fractal Fract., 4 (2020), 49. https://doi.org/10.3390/fractalfract4040049 doi: 10.3390/fractalfract4040049
    [23] S. Rashid, S. Sultana, N. Idrees, E. Bonyah, On analytical treatment for the fractional-order coupled partial differential equations via fixed point formulation and generalized fractional derivative operators, J. Funct. Spaces, 2022 (2022), 3764703. https://doi.org/10.1155/2022/3764703 doi: 10.1155/2022/3764703
    [24] M. Al Qurashi, S. Rashid, S. Sultana, F. Jarad, A. M. Alsharif, Fractional-order partial differential equations describing propagation of shallow water waves depending on power and Mittag-Leffler memory, AIMS Math., 7 (2022), 12587–12619. https://doi.org/10.3934/math.2022697 doi: 10.3934/math.2022697
    [25] M. Sharifi, B. Raesi, Vortex theory for two dimensional Boussinesq equations, Appl. Math. Nonliner Sci., 5 (2020), 67–84. https://doi.org/10.2478/amns.2020.2.00014 doi: 10.2478/amns.2020.2.00014
    [26] T. A. Sulaiman, H. Bulut, H. M. Baskonus, On the exact solutions to some system of complex nonlinear models, Appl. Math. Nonliner Sci., 6 (2020), 29–42. https://doi.org/10.2478/amns.2020.2.00007 doi: 10.2478/amns.2020.2.00007
    [27] S. Rashid, Y. G. Sánchez, J. Singh, K. M. Abualnaja, Novel analysis of nonlinear dynamics of a fractional model for tuberculosis disease via the generalized Caputo fractional derivative operator (case study of Nigeria), AIMS Math., 7 (2022), 10096–10121. https://doi.org/10.3934/math.2022562 doi: 10.3934/math.2022562
    [28] M. Caputo, Elasticita e dissipazione, Zanichelli, Bologna, 1969.
    [29] A. Atangana, D. Baleanu, New fractional derivatives with non-local and non-singular kernel: Theory and application to heat transfer model, Therm. Sci., 20 (2016), 763–769.
    [30] D. Li, W. Sun, C. Wu, A novel numerical approach to time-fractional parabolic equations with nonsmooth solutions, Numer. Math. Theor. Methods Appl., 14 (2021), 355–376. https://doi.org/10.4208/nmtma.OA-2020-0129 doi: 10.4208/nmtma.OA-2020-0129
    [31] M. She, D. Li, H. W. Sun, A transformed L1 method for solving the multi-term time-fractional diffusion problem, Math. Comput. Simulat., 193 (2022), 584–606. https://doi.org/10.1016/j.matcom.2021.11.005 doi: 10.1016/j.matcom.2021.11.005
    [32] H. Qin, D. Li, Z. Zhang, A novel scheme to capture the initial dramatic evolutions of nonlinear sub-diffusion equations, J. Sci. Comput., 89 (2021), 65. https://doi.org/10.1007/s10915-021-01672-z doi: 10.1007/s10915-021-01672-z
    [33] M. El-Borhamy, N. Mosalam, On the existence of periodic solution and the transition to chaos of Rayleigh-Duffing equation with application of gyro dynamic, Appl. Math. Nonlinear Sci., 5 (2020), 93–108. https://doi.org/10.2478/amns.2020.1.00010 doi: 10.2478/amns.2020.1.00010
    [34] R. A. de Assis, R. Pazim, M. C. Malavazi, P. P. da C. Petry, L. M. E. da Assis, E. Venturino, A mathematical model to describe the herd behaviour considering group defense, Appl. Math. Nonlinear Sci., 5 (2020), 11–24. https://doi.org/10.2478/amns.2020.1.00002 doi: 10.2478/amns.2020.1.00002
    [35] J. Singh, Analysis of fractional blood alcohol model with composite fractional derivative, Chaos Solition. Fract., 140 (2020), 110127. https://doi.org/10.1016/j.chaos.2020.110127 doi: 10.1016/j.chaos.2020.110127
    [36] P. A. Naik, Z. Jain, K. M. Owolabi, Global dynamics of a fractional order model for the transmission of HIV epidemic with optimal control, Chaos Solition. Fract., 138 (2020), 109826. https://doi.org/10.1016/j.chaos.2020.109826 doi: 10.1016/j.chaos.2020.109826
    [37] A. Atangana, E. Alabaraoye, Solving a system of fractional partial differential equations arising in the model of HIV infection of CD4+ cells and attractor one-dimensional Keller-Segel equations, Adv. Differ. Equ., 2013 (2013), 94. https://doi.org/10.1186/1687-1847-2013-94 doi: 10.1186/1687-1847-2013-94
    [38] H. Günerhan, E. Çelik, Analytical and approximate solutions of fractional partial differential-algebraic equations, Appl. Math. Nonlinear Sci., 5 (2020), 109–120. https://doi.org/10.2478/amns.2020.1.00011 doi: 10.2478/amns.2020.1.00011
    [39] F. Evirgen, S. Uçar, N. Özdemir, System analysis of HIV infection model with CD4+T under non-singular kernel derivative, Appl. Math. Nonlinear Sci., 5 (2020), 139–146. https://doi.org/10.2478/amns.2020.1.00013 doi: 10.2478/amns.2020.1.00013
    [40] M. R. R. Kanna, R. P. Kumar, S. Nandappa, I. N. Cangul, On solutions of fractional order telegraph partial differential equation by Crank-Nicholson finite difference method, Appl. Math. Nonliner Sci., 5 (2020), 85–98. https://doi.org/10.2478/amns.2020.2.00017 doi: 10.2478/amns.2020.2.00017
    [41] M. A. Alqudah, R. Ashraf, S. Rashid, J. Singh, Z. Hammouch, T. Abdeljawad, Novel numerical investigations of fuzzy Cauchy reaction-diffusion models via generalized fuzzy fractional derivative operators, Fractal Fract., 5 (2021), 151. https://doi.org/10.3390/fractalfract5040151 doi: 10.3390/fractalfract5040151
    [42] S. Rashid, M. K. A. Kaabar, A. Althobaiti, M. S. Alqurashi, Constructing analytical estimates of the fuzzy fractional-order Boussinesq model and their application in oceanography, J. Ocean Eng. Sci., 2022. https://doi.org/10.1016/j.joes.2022.01.003 doi: 10.1016/j.joes.2022.01.003
    [43] S. Rashid, R. Ashraf, Z. Hammouch, New generalized fuzzy transform computations for solving fractional partial differential equations arising in oceanography, J. Ocean Eng. Sci., 2021. https://doi.org/10.1016/j.joes.2021.11.004 doi: 10.1016/j.joes.2021.11.004
    [44] Z. Li, C. Wang, R. P. Agarwal, R. Sakthivel, Hyers-Ulam-Rassias stability of quaternion multidimensional fuzzy nonlinear difference equations with impulses, Iran. J. Fuzzy Syst., 18 (2021), 143–160.
    [45] A. Kandel, W. J. Byatt, Fuzzy differential equations, Proceedings of the International Conference Cybernetics and Society, Tokyo, Japan, 1978.
    [46] R. P. Agarwal, V. Lakshmikantham, J. J. Nieto, On the concept of solution for fractional differential equations with uncertainty, Nonlinear Anal.: Theory Methods Appl., 72 (2010), 2859–2862. https://doi.org/10.1016/j.na.2009.11.029 doi: 10.1016/j.na.2009.11.029
    [47] K. Nemati, M. Matinfar, An implicit method for fuzzy parabolic partial differential equations, J. Nonlinear Sci. Appl., 1 (2008), 61–71.
    [48] T. Allahviranloo, M. Afshar Kermani, Numerical methods for fuzzy partial differential equations under new definition for derivative, Iran. J. Fuzzy Syst., 7 (2010), 33–50.
    [49] O. A. Arqub, M. Al-Smadi, S. Momani, T. Hayat, Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems, Soft Comput., 21 (2017), 7191–7206. https://doi.org/10.1007/s00500-016-2262-3 doi: 10.1007/s00500-016-2262-3
    [50] O. A. Arqub, Adaptation of reproducing kernel algorithm for solving fuzzy Fredholm-Volterra integrodifferential equations, Neural Comput. Applic., 28 (2017), 1591–1610. https://doi.org/10.1007/s00521-015-2110-x doi: 10.1007/s00521-015-2110-x
    [51] T. M. Elzaki, S. M. Ezaki, Application of new transform "Elzaki transform" to partial differential equations, Global J. Pure Appl. Math., 7 (2011), 65–70.
    [52] S. Rashid, K. T. Kubra, S. U. Lehre, Fractional spatial diffusion of a biological population model via a new integral transform in the settings of power and Mittag-Leffler nonsingular kernel, Phys. Scr., 96 (2021), 114003.
    [53] S. Rashid, Z. Hammouch, H. Aydi, A. G. Ahmad, A. M. Alsharif, Novel computations of the time-fractional Fisher's model via generalized fractional integral operators by means of the Elzaki transform, Fractal Fract., 5 (2021), 94. https://doi.org/10.3390/fractalfract5030094 doi: 10.3390/fractalfract5030094
    [54] S. Rashid, R. Ashraf, A. O. Akdemir, M. A. Alqudah, T. Abdeljawad, S. M. Mohamed, Analytic fuzzy formulation of a time-fractional Fornberg-Whitham model with power and Mittag-Leffler kernels, Fractal Fract., 5 (2021), 113. https://doi.org/10.3390/fractalfract5030113 doi: 10.3390/fractalfract5030113
    [55] G. Adomian, A review of the decomposition method in applied mathematics, J. Math. Anal. Appl., 135 (1988), 501–544. https://doi.org/10.1016/0022-247X(88)90170-9 doi: 10.1016/0022-247X(88)90170-9
    [56] G. Adomian, R. Rach, On composite nonlinearities and the decomposition method, J. Math. Anal. Appl., 113 (1986), 504–509. https://doi.org/10.1016/0022-247X(86)90321-5 doi: 10.1016/0022-247X(86)90321-5
    [57] S. S. L. Chang, L. Zadeh, On fuzzy mapping and control, IEEE Trans. Syst. Man Cybern., 2 (1972), 30–34. https://doi.org/10.1109/TSMC.1972.5408553 doi: 10.1109/TSMC.1972.5408553
    [58] R. Goetschel Jr., W. Voxman, Elementary fuzzy calculus, Fuzzy. Sets. Syst., 18 (1986), 31–43. https://doi.org/10.1016/0165-0114(86)90026-6 doi: 10.1016/0165-0114(86)90026-6
    [59] A. Kaufmann, M. M. Gupta, Introduction to fuzzy arithmetic, New York: Van Nostrand Reinhold Company, USA, 1991.
    [60] B. Bede, J. Fodor, Product type operations between fuzzy numbers and their applications in geology, Acta Polytech. Hung., 3 (2006), 123–139.
    [61] A. Georgieva, Double fuzzy Sumudu transform to solve partial Volterra fuzzy integro-differential equations, Mathematics, 8 (2020), 692. https://doi.org/10.3390/math8050692 doi: 10.3390/math8050692
    [62] B. Bede, L. Stefanini, Generalized differentiability of fuzzy-valued functions, Fuzzy Sets Syst., 230 (2013), 119–141. https://doi.org/10.1016/j.fss.2012.10.003 doi: 10.1016/j.fss.2012.10.003
    [63] B. Bede, S. G. Gal, Generalizations of the differentiability of fuzzy-number-valued functions with applications to fuzzy differential equations, Fuzzy Sets Syst., 151 (2005), 581–599. https://doi.org/10.1016/j.fss.2004.08.001 doi: 10.1016/j.fss.2004.08.001
    [64] Y. Chalco-Cano, H. Román-Flores, On new solutions of fuzzy differential equations, Chaos Solition. Fract., 38 (2008), 112–119. https://doi.org/10.1016/j.chaos.2006.10.043 doi: 10.1016/j.chaos.2006.10.043
    [65] H. C. Wu, The improper fuzzy Riemann integral and its numerical integration, Inf. Sci., 111 (1998), 109–137. https://doi.org/10.1016/S0020-0255(98)00016-4 doi: 10.1016/S0020-0255(98)00016-4
    [66] A. H. Sedeeg, A coupling Elzaki transform and homotopy perturbation method for solving nonlinear fractional heat-like equations, Am. J. Math. Comput. Model., 1 (2016), 15–20
    [67] A. Georgieva, A. Pavlova, Fuzzy Sawi decomposition method for solving nonlinear partial fuzzy differential equations, Symmetry, 13 (2021), 1580. https://doi.org/10.3390/sym13091580 doi: 10.3390/sym13091580
    [68] R. Henstock, Theory of integration, Butterworth, London, 1963.
    [69] Z. T. Gong, L. L. Wang, The Henstock-Stieltjes integral for fuzzy-number-valued functions, Inf. Sci., 188 (2012), 276–297. https://doi.org/10.1016/j.ins.2011.11.024 doi: 10.1016/j.ins.2011.11.024
    [70] L. Jäntschi, The Eigenproblem translated for alignment of molecules, Symmetry, 11 (2019), 1027. https://doi.org/10.3390/sym11081027 doi: 10.3390/sym11081027
    [71] L. Jäntschi, D. Bálint, S. D. Bolboacǎ, Multiple linear regressions by maximizing the likelihood under assumption of generalized Gauss-Laplace distribution of the error, Comput. Math. Methods Med., 2016 (2016), 8578156. https://doi.org/10.1155/2016/8578156 doi: 10.1155/2016/8578156
  • This article has been cited by:

    1. Thijs Beurskens, Steven Van Den Broek, Arjen Simons, Willem Sonke, Kevin Verbeek, Tim Ophelders, Michael Hoffmann, Bettina Speckmann, 2025, ParkView: Visualizing Monotone Interleavings, 979-8-3315-0581-3, 118, 10.1109/PacificVis64226.2025.00018
  • Reader Comments
  • © 2022 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(2406) PDF downloads(118) Cited by(4)

Figures and Tables

Figures(6)  /  Tables(2)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog