In this study, we proposed a normalized time-fractional diffusion equation and conducted a numerical investigation of the dynamics of the proposed equation. We discretized the governing equation by using a finite difference method. The proposed normalized time-fractional diffusion equation features a different time scale compared to the conventional time-fractional diffusion equation. This distinct time scale provides an intuitive understanding of the fractional time derivative, which represents a weighted average of the temporal history of the time derivative. Furthermore, the sum of the weight function is one for all values of the fractional parameter and time. The primary advantage of the proposed model over conventional time-fractional equations is the unity property of the sum of the weight function, which allows us to investigate the effects of the fractional order on the evolutionary dynamics of time-fractional equations. To highlight the differences in performance between the conventional and normalized time-fractional diffusion equations, we have conducted several numerical experiments.
Citation: Chaeyoung Lee, Yunjae Nam, Minjoon Bang, Seokjun Ham, Junseok Kim. Numerical investigation of the dynamics for a normalized time-fractional diffusion equation[J]. AIMS Mathematics, 2024, 9(10): 26671-26687. doi: 10.3934/math.20241297
[1] | Jiaxin Shen, Yuqing Xia . Flag-transitive 2-designs with block size 5 and alternating groups. AIMS Mathematics, 2025, 10(5): 10308-10323. doi: 10.3934/math.2025469 |
[2] | Cenap Özel, Habib Basbaydar, Yasar Sñzen, Erol Yilmaz, Jung Rye Lee, Choonkil Park . On Reidemeister torsion of flag manifolds of compact semisimple Lie groups. AIMS Mathematics, 2020, 5(6): 7562-7581. doi: 10.3934/math.2020484 |
[3] | Simone Fiori . Coordinate-free Lie-group-based modeling and simulation of a submersible vehicle. AIMS Mathematics, 2024, 9(4): 10157-10184. doi: 10.3934/math.2024497 |
[4] | Yunpeng Xiao, Wen Teng . Representations and cohomologies of modified λ-differential Hom-Lie algebras. AIMS Mathematics, 2024, 9(2): 4309-4325. doi: 10.3934/math.2024213 |
[5] | Yupei Zhang, Yongzhi Luan . Dimension formulas of the highest weight exceptional Lie algebra-modules. AIMS Mathematics, 2024, 9(4): 10010-10030. doi: 10.3934/math.2024490 |
[6] | Amjad Hussain, Muhammad Khubaib Zia, Kottakkaran Sooppy Nisar, Velusamy Vijayakumar, Ilyas Khan . Lie analysis, conserved vectors, nonlinear self-adjoint classification and exact solutions of generalized (N+1)-dimensional nonlinear Boussinesq equation. AIMS Mathematics, 2022, 7(7): 13139-13168. doi: 10.3934/math.2022725 |
[7] | Nouf Almutiben, Ryad Ghanam, G. Thompson, Edward L. Boone . Symmetry analysis of the canonical connection on Lie groups: six-dimensional case with abelian nilradical and one-dimensional center. AIMS Mathematics, 2024, 9(6): 14504-14524. doi: 10.3934/math.2024705 |
[8] | Muhammad Asad Iqbal, Abid Ali, Ibtesam Alshammari, Cenap Ozel . Construction of new Lie group and its geometric properties. AIMS Mathematics, 2024, 9(3): 6088-6108. doi: 10.3934/math.2024298 |
[9] | Wei Shi . Nonexistence results of nonnegative solutions of elliptic equations and systems on the Heisenberg group. AIMS Mathematics, 2025, 10(5): 12576-12597. doi: 10.3934/math.2025567 |
[10] | Lilan Dai, Yunnan Li . Primitive decompositions of idempotents of the group algebras of dihedral groups and generalized quaternion groups. AIMS Mathematics, 2024, 9(10): 28150-28169. doi: 10.3934/math.20241365 |
In this study, we proposed a normalized time-fractional diffusion equation and conducted a numerical investigation of the dynamics of the proposed equation. We discretized the governing equation by using a finite difference method. The proposed normalized time-fractional diffusion equation features a different time scale compared to the conventional time-fractional diffusion equation. This distinct time scale provides an intuitive understanding of the fractional time derivative, which represents a weighted average of the temporal history of the time derivative. Furthermore, the sum of the weight function is one for all values of the fractional parameter and time. The primary advantage of the proposed model over conventional time-fractional equations is the unity property of the sum of the weight function, which allows us to investigate the effects of the fractional order on the evolutionary dynamics of time-fractional equations. To highlight the differences in performance between the conventional and normalized time-fractional diffusion equations, we have conducted several numerical experiments.
A 2-(v,k,λ) design D is a pair (P,B), where P is a set of v points, and B is a set of k-subsets of P called blocks, such that any 2 points are contained in exactly λ blocks. A flag is a point-block pair (α,B) with α∈B. The Fisher's inequality in [8, 1.3.8] shows that the number of blocks is at least v. Design D is said to be non-symmetric if v<b and non-trivial if 2<k<v−1. We always assume D to be non-trivial and non-symmetric in this paper. An automorphism of D is a permutation of P that leaves B invariant. All automorphisms of the design D form a group called the full automorphism group of D, denoted by Aut(D). Let G≤Aut(D). The design D is called point (block, flag)-transitive if G acts transitively on the set of points (blocks, flags) and point-primitive if G acts primitively on P, that is, G does not preserve a partition of P in classes of size c with 1<c<v.
For decades, works have been done on the classification of 2-designs admitting a transitive automorphism group. In 1988, Buekenhout, Delandtsheer, and Doyen first proved in [5] that the flag-transitive automorphism group of a 2-(v,k,1) design must be of affine or almost simple type. Then, the classification of flag-transitive 2-(v,k,1) designs was given in [6] by a six-person team, except for the case of the one-dimensional affine type. In recent years, some researchers have focused on into classifying 2-(v,k,λ) designs with general λ admitting flag-transitive automorphism group, such as [1,3,12,16,25,26,27]. Moreover, some of the works also considered classification of such designs admitting automorphism groups in a weaker condition, namely, block-transitive rather than flag-transitive [21,22,23,24].
The current paper tackles the 2-(v,k,λ) designs where λ is a prime. In [25], Zhang and Chen reduced the flag-transitive, point-primitive automorphism groups of such 2-designs either to the affine type (with an elementary abelian p-group as socle) or to the almost simple type (with a nonabelian simple socle). Hence, it is possible to classify such 2-designs based on the classification of simple groups. The aim of this paper is to consider the case when the socle of the automorphism group G is an exceptional simple group of Lie type. Note that groups G2(2), 2G2(3), 2B2(2), and 2F4(2) are not simple, so they are not under consideration in this work. It is also worth noting that the symmetric 2-designs with exceptional simple socle have been studied in [1,2,20]. The main result of the current paper is the following:
Theorem 1.1. Let D be a non-symmetric 2-(v,k,λ) design with λ prime and G a flag-transitive automorphism group of D. If the socle T of G is an exceptional Lie type simple group in characteristic p, then one of the following holds:
(1) T is 2B2(q) with q=22n+1>2 and (v,k,λ)=(q2+1,q,q−1), where q−1 is a Mersenne prime;
(2) T is G2(q), and (v,k,λ)=(q3(q3−1)2,q32,q+1) where q>2 is even and q+1 is a Fermat prime.
Remark 1.1. For the parameters in Theorem 1.1(1), the design D is described in [26]. For the parameters in Theorem 1.1(2), the existence of such a design remains uncertain at this time.
We begin with some well-established results about the parameters of 2-(v,k,λ) designs and the automorphism groups of them. For any point α, we denote by r the number of blocks that contain α, as it is a constant.
Lemma 2.1. ([8]) For a 2-(v,k,λ) design D, it is well known that
(1) bk=vr;
(2) λ(v−1)=r(k−1);
(3) λv<r2.
Lemma 2.2. ([8,Section 1.2]) Assume that G is an automorphism group of D. Then the flag-transitivity of G is equivalent to one of the following:
(1) G is point-transitive, and the point stabilizer Gα is transitive on all blocks that contain α;
(2) G is block-transitive, and the block stabilizer GB is transitive on the k points in block B.
Lemma 2.3. [7]) Assume that G is a flag-transitive automorphism group of D, and T is the socle of G. Then, we have
(1) r∣|Gα|, where Gα is the point-stabilizer of G;
(2) r∣λdi, where di is any nontrivial subdegree of G.
Assume that λ is a prime. Then either (λ,r)=1 or λ∣r. For the former case, by the results of [26], we immediately obtain the following Lemma:
Lemma 3.1. Assume that G and D satisfy the hypothesis of Theorem 1.1. If (λ,r)=1, then T=2B2(q) with q=22n+1≥8, and D is a 2-(q2+1,q,q−1) design with q−1 a Mersenne prime. In particular, 2n+1 is prime.
Therefore, we always assume λ∣r in the remaining content. Let r0=rλ. We get the following from Lemmas 2.1 and 2.3.
Lemma 3.2. Assume that D is a 2-(v,k,λ) design where λ is a prime divisor of r, and G is a flag-transitive automorphism group of D. Then we have
(1) v<λr20;
(2) r0 divides the greatest common divisor of |Gα|, v−1 and all nontrivial subdegrees of G.
Since G is point-primitive, the point stabilizer Gα is a maximal subgroup of G. In this section, we first deal with the case when Gα is a maximal parabolic subgroup of G.
Lemma 3.3. Assume that T=2B2(q) with q=22n+1>2. Then Gα cannot be the maximal parabolic subgroup of G.
Proof. If Gα is a maximal parabolic subgroup of G, we know that |Gα|=fq2(q−1) with f∣(2n+1) from [19], and hence v=q2+1. Then, according to (1) and (2) in Lemma 2.1 and the fact λ∣r, we further get k−1∣q2 and b=λq2(q2+1)k(k−1). Since G is flag-transitive, Lemma 2.2 implies that |GB|=|G|b=fk(k−1)(q−1)λ. All maximal subgroups of G can be read off from [19], and let M be any one of them with GB≤M. The fact that |GB| divides |M| implies that M is the maximal parabolic subgroup of G, and k(k−1) divides λq2. This forces k=λ, for otherwise k(k−1)∣q2, which is a contradiction. It follows that GB is primitive on B, and so TB is transitive on B. Namely, |TB:Tγ,B|=k for any point γ∈B. On the other hand, since M is parabolic, there exists a point α such that M=Gα. That is to say, TB≤Tα and therefore Tγ,B≤Tγ,α for γ∈B. Since the stabilizer of any two points in 2B2(q) is a cyclic group of order q−1 by [9, p.187], |Tγ,B| divides (q−1). Also, |T:Tγ,α| divides bk by the flag-transitivity of G. It follows that (k−1)∣λ, which holds only when λ=k=2, for it has been proved that k=λ above. This is impossible as D is nontrivial.
Lemma 3.4. Assume that T=2G2(q) with q=32n+1>3. Then Gα cannot be the maximal parabolic subgroup of G.
Proof. If Gα is the maximal parabolic subgroup of G, then we know that |Gα|=fq3(q−1) with f∣(2n+1) from [11], and so v=q3+1. Similar as to Lemma 3.3, we have
b=λv(v−1)k(k−1)=λq3(q3+1)k(k−1) |
and k−1∣q3. Let f1 be a divisor of f such that |GB:TB|=f1. Then by the flag-transitivity of G, we get
|TB|=f(q−1)k(k−1)f1λ. |
Here, we also consider the maximal subgroups M of 2G2(q) such that TB≤M. From [11], either M is parabolic, or M≅Z2×PSL2(q).
If M is a parabolic subgroup, then k(k−1)∣λq3. Since k−1∣q3, we have k∣λ and therefore λ=k. It follows that λ−1∣q3 and λ=3n1+1, which forces λ=k=2, for λ is prime. However, now we get b=q3(q3+1)>(v2), which is obviously impossible. Hence, in the remaining part of the proof, we assume that TB≤Z2×PSL2(q).
According to the list of the maximal subgroups of PSL2(q) in [4, Tables 8.1 and 8.2], TB is isomorphic to a subgroup of Z2×A4, Z2×Dq±1, Z2×([q]:Zq−12) or Z2×PSL2(q0) with qℓ0=q=32n+1. Obviously, the former two cases are impossible as k−1∣q3. Then, if TB≲Z2×([q]:Zq−12), we also have λ=k, a contradiction again. For the last case, the condition that |TB| divides |Z2×PSL2(q0)| forces q0=q, which implies that TB is isomorphic to Z2×PSL2(q) or PSL2(q). Then, by |T:TB|∣b, we have k(k−1)∣q(q+1)λ. This, together with k−1∣q2, implies that k−1∣q when λ≠3, and k−1∣3q when λ=3. Furthermore, the facts that q+1 is the smallest degree of non-trivial action of PSL2(q) since q is an odd power of 3 and that |TB:Tα,B| divides k imply k=q+1. Hence, |TB|=fk(k−1)(q−1)f1λ=q(q2−1)a, with a=1 or 2 when TB is Z2×PSL2(q) or PSL2(q), respectively. It follows that λ∣f when TB is Z2×PSL2(q), or λ=2 when TB is PSL2(q).
Let R be the Ree unital of order q (which is a 2-(q3+1,q+1,1) design). For the former case, let σ be the central involution of Z2×PSL2(q). It can be deduced from [15] that σ fixes a block ℓ of R pointwise and preserves a point-partition Sσ of R∖ℓ into q2−q blocks, each of them invariant by σ. Now, Z2×PSL2(q) induces PSL2(q) on Sσ∪{ℓ}, and PSL2(q) preserves ℓ acting on this one in its natural 2-transitive action of degree q+1. Further, PSL2(q) partitions Sσ into two orbits each of length q2−q2. Thus, ℓ is the unique Z2×PSL2(q)-orbit of points of R of length q+1. Note that k=q+1, which means B=ℓ. This means that |BG|=|ℓG|=q2(q2−q+1) by [6], and so λ=1, which contradicts with λ being prime. For the latter case, the block stabilizer Tℓ for the Ree unital is Z2×PSL2(q), and Z2 fixed all points in ℓ. However, since αTB⊆αTℓ and |αTB|=|αTℓ|=q+1, we have αTB=αTℓ. This means that Z2 fixed all points in B, and so Z2∈TB, an obvious contradiction.
For the remaining possibility of T in T, where
T={2F4(q),3D4(q),G2(q),F4(q),Eϵ6(q),E7(q),E8(q)}, |
we use the following Lemma from [14] to prove that Gα cannot be the maximal parabolic subgroup. Note that in the following we denote by np the p-part of n and np′ the p′-part of n, i.e., np=pt where pt∣n but pt+1∤n, and np′=n/np.
Lemma 3.5. ([14]) Assume that T is a simple group of Lie type in characteristic p and acts on the set of cosets of a maximal parabolic subgroup. Then T has a unique subdegree which is a power of p except when T is Ld(q), Ω+2m(q) (m is odd) or E6(q).
Lemma 3.6. If T∈T, then Gα cannot be a parabolic subgroup of G.
Proof. By Lemma 3.5, for all cases where T∈T∖{E6(q)}, there is a unique subdegree which is a power of p. Then, Lemma 3.2 implies that r0 divides |v−1|p. Since we also have λ divides |Gα|, we can easily check that r0 is too small to satisfy the condition v<λr20. Therefore, we assume that T=E6(q). If G contains a graph automorphism, or Gα∩T is P2 or P4, then there is also a unique subdegree that is a power of p. However, r0 is too small again. If Gα∩T is P3 with type A1A4, we have λ≤q5−1q−1 by λ∣|Gα| and
v=(q3+1)(q4+1)(q9−1)(q6+1)(q4+q2+1)(q−1). |
Moreover, from [1, Proposition 6.3], we know that there exist two nontrivial subdegrees: q13q5−1q−1 and q(q5−1)(q4−1)(q−1)2. Lemma 3.2 then implies that r divides λqq5−1q−1. However, the condition v<λr20 cannot be satisfied again. If Gα∩T is P1 with type D5, then
v=(q8+q4+1)(q9−1)q−1, |
and there exist two nontrivial subdegrees (see [13]): q(q3+1)(q8−1)(q−1) and q8(q4+1)(q5−1)(q−1). It follows that r∣λq(q4+1). This, together with λ∣|Gα|, implies that r2<λ2q2(q4+1)2<λv, which is contradictive with Lemma 2.1.
In this section, we assume that Gα is a non-parabolic maximal subgroup of G.
Lemma 3.7. Assume that G and D satisfy the hypothesis of Theorem 1.1. Then, |G|<|Gα|3.
Proof. From Lemma 2.3, we know that r divides every nontrivial subdegree of G, and so r divides |Gα|. Since v<r2 by (3) of Lemma 2.1, it follows that |G|<|Gα|3.
Lemma 3.7 implies that Gα is a large maximal non-parabolic subgroup of G. The type of Gα can be read from [1, Table 2]. Note that Theorem 1.1(2) just corresponds to the non-parabolic case here, with T=G2(q) and the type of Gα being SLϵ3(q).2.
Lemma 3.8. Assume that G and D satisfy the hypothesis of Theorem 1.1. If T=G2(q) and the type of Gα is SLϵ3(q).2 with ϵ=±, then ϵ=−, T is flag-transitive on D, and the parameters of D are (v,b,r,k,λ)=(q3(q3−1)2,(q+1)(q6−1),(q+1)(q3+1),q32,q+1), where q is even, and λ=q+1 is a Fermat prime.
Proof. It is obvious that |Tα|=2q3(q2−1)(q3−ϵ1), and hence v=12q3(q3+ϵ1). We first deal with the case when q is even. Since G2(2) is not simple (G2(2)≅PSU3(3):2), we assume that q>2. From [17, Section 3, Case 8], we know that r divides λ(q3−ϵ1). Then, the equality λ(v−1)=r(k−1) from Lemma 2.1 implies that there exists an odd integer t dividing (q3−ϵ1) such that
k=t(q3+ϵ2)2+1andr=λ(q3−ϵ1)t. |
Obviously, the fact that k<r implies t<λ. Moreover, by Lemma 2.1 we have
b=λv(v−1)k(k−1)=λq3(q6−1)(q3+ϵ2)4k(k−1)=λq3(q6−1)2kt. | (3.1) |
Note also that (2k,q3−ϵ1)∣3t+ϵ2, (2k,q3+1)∣t+ϵ2, (k,q32)∣t+ϵ1, and therefore (2k,q2−1)∣(t+ϵ2)(3t+ϵ2). Since b is an integer, it follows from (3.1) that k∣λq32(q3−ϵ1)(q3+ϵ1). Hence, we have
t(q3+ϵ2)2+1∣λ(t+ϵ2)(t+ϵ1)(3t+ϵ2). | (3.2) |
Since 3t+ϵ2≤5t, it follows that q3+ϵ2<10λ(t+ϵ2)(t+ϵ1) except when t=1 and ϵ=−. When t≠1, the above together with t<λ further implies that λ cannot be a prime divisor of |Out(T)|, and hence λ divides |SLϵ3(q).2|.
In the following, we prove that t=1. Obviously, t≠2, for t is odd. When t≥3, we have rλ≤13(q3−ϵ1) and 3t2<λ by t(q3+ϵ2)2<k≤r≤λ(q3−ϵ1)3. Now, assume that λ∣k. Then λ divides (2q3(q2−1)(q3−ϵ1),2k), and it follows that λ∣4(t+ϵ1)(t+ϵ2)(3t+ϵ2)2. Since 32t<λ, we have λ=3t+ϵ2, or ϵ=+ and λ=3t+22. If λ=3t+2ϵ, then k<r forces (t,λ,ϵ)=(5,17,+), (5,13,−), (3,11,+), (3,7,−), or (1,5,+). Note that k∣λ(t+ϵ2)(t+ϵ1)(3t+ϵ2), and we check each case and know that it is impossible. If λ=3t+22, then we get (t,λ)=(4,7), which can be ruled out similarly. Hence, λ∤k, and it follows (3.2) that t>q. On the other hand, since |T:TB|∣b, there exists an integer f1 dividing f such that f1|T:TB|=b and
|TB|=2f1q3(q2−1)kλt. |
Since λ∤k and λ>t>q≥2, λ is a divisor of f1, (q−1), q+1, or q, and so λ≤q+1. Since q<t<23λ, we get a contradiction. Therefore, t=1 as we claim.
Let t=1. Then, rλ=(q3−ϵ1), and k=(q3+2ϵ)2+1 with q even. If ϵ=+, then r=λ(q3−1), and k=q3+42. Since b is an integer, we get that q3+4 divides λq3(q6−1). It follows that q3+4∣60λ, and so λ divides q3+4, which is impossible as λ is a prime divisor of 2q3(q2−1)(q3−1). We now assume that ϵ=−. Then, k=q32 and b=λ(q6−1), and r=λ(q3+1) for q≥4. Moreover, in this case |TB|=f1q6(q2−1)λ and we further find that TB is contained in a maximal parabolic subgroup M=q5:GL2(q) of G2(q). Since G is flag-transitive, Lemma 2.2 implies that |SU3(q).2:Tα,B| divides λ(q3+1). Using the maximal subgroup list for SU3(q) provided in [4, Tables 8.5 and 8.6], we get that Tα,B is isomorphic to a subgroup of M1=q3:Cq2−1.2. If Tα,B=M1 or λ∤q2−1, then Tα,B contains a cyclic group of order q2−1, which contradicts Tα,B≤TB≤q5:GL2(q). Hence, |M1:Tα,B|=λ divides q2−1. This also implies that T is flag-transitive, and so |T:M||M:TB|=λ(q6−1). It follows that |M:TB|=|GL2(q):TB∩GL2(q)|=λ(q−1), which gives |TB∩GL2(q)|=q(q2−1)λ. Then, using the list of maximal subgroups of SL(2,q) provided in [4, Tables 8.1 and 8.2], we get that λ∤q−1, and so λ∣q+1, which further implies that λ=q+1. This is to say, if such design exists, then the design parameters tuple is (v,b,r,k,λ)=(q3(q3−1)2,(q+1)(q6−1),(q+1)(q3+1),q32,q+1), where λ=q+1 is a Fermat prime.
Now, we assume that q is odd. Then, we conclude that r divides λ(q3−ϵ1)2 from [17, Section 4, Case 1, i=1]. Let rt=λ(q3−ϵ1)2. Similar as in the even case, we also have t=1. That is to say, k=q3+ϵ2+1 and r=λ(q3−ϵ1)2. When ϵ=+, the fact of k dividing λq3(q6−1) q3+3 implies that q3+3 divides 24λ, and so λ divides q3+3, which is impossible as λ is a prime divisor of 2q3(q2−1)(q3−1). If ϵ=−, we have k=q3−1, and so b=λq3(q3+1)4. We consider a maximal subgroup M containing TB. It is proven later that M≅TB≅SL3(q).2 and hence that is unique. The fact that |T:M|∣b implies that M is SL3(q).2 by [4,Tables 8.41 and 8.42] and that |T:M|=q3(q3+1)2. It follows that 2|M:TB|∣λ, which forces λ=2 and M=TB≅SL3(q).2. Since Tα≅SU3(q).2 and r=q3+1, we have Tα,B≅q3.Cq2−1.2 or q3.Cq2−1. According to the maximal subgroups of SL3(q) in [4, Tables 8.3 and 8.4], we know that Tα,B is isomorphic to a subgroup of q2.GL2(q).2, which is impossible.
All other types of Gα in [1, Table 2], except two cases which we will discuss in Lemma 3.10, can be ruled out using the method stated below. First, for each possibility of Gα, the order of Gα and the value of v can be determined. We can hence get an upper bound of λ according to λ∣|Gα|. Then, to get an upper bound of r0, we consider the divisors of |Gα| in two parts: ∏i1i=1Φi for which Φi divides v, and ∏i2j=1Ψj=|Gα|/∏i1i=1Φi. Obviously, all Φi are coprime with v−1. For each Ψj, we calculate the remainder ˉΨj of Ψj divided by v−1. This implies that (|Gα|,v−1) divides |Out(T)|∏i2j=1ˉΨj, which implies that r0≤|Out(T)|∏i2j=1ˉΨj. Finally, one can check that the values of r0 for all these cases are too small to satisfy the condition that v<λr20. That is, no new designs arise in these cases. To be more explicit, we take T=E8(q) as an example.
Lemma 3.9. Assume that G and D satisfy the hypothesis of Theorem 1.1. If T=E8(q) with q=pe, then Gα cannot be a non-parabolic maximal subgroup of G.
Proof. Let T=E8(q). Then, it follows from [1, Table 2] that the type of Gα is one of the following:
{A1(q)E7(q),D8(q),E8(q12),E8(q13),Aϵ2(q)Eϵ6(q)}. |
For the case that Gα is of type A1(q)E7(q), we have λ<q8 since λ∣|Gα| and v=q56(q6+1)(q10+1)(q12+1)q30−1q2−1 by v=|G:Gα|. Obviously, q(q6+1)∣v and q30−1q2−1∣v, which also implies q6−1q2−1∣v and q10−1q2−1∣v. This means (|Gα|,v−1) divides |Out(T)|(q2−1)5(q8−1)(q14−1)(q18−1). Since r0∣(|Gα|,v−1), we have r0<q51. However, Lemma 3.2 shows q112<v<λr20<q110, a contradiction.
For the case that Gα is of type D8(q), we have λ<q7 and
v=q64(q12+q6+1)(q16+q8+1)(q10+1)(q30−1)q4−1. |
Since v−1≡2(modq4+1), (v−1,q4+1)=2 or 1. This, together with q∣v and q30−1q2−1∣v, implies that (|Gα|,v−1) divides 4|Out(T)|(q2−1)3(q4−1)3(q12−1)(q14−1). It follows that r0≤4|Out(T)|q44<4q45, and q128<v<λr20<4q97, which is a contradiction.
Assume that Gα is of type E8(q12). Then, λ≤q15 and v=q60(q+1)(q4+1)(q6+1)(q7+1)(q9+1)(q10+1)(q12+1)(q15+1). Since q, q3+1, q4+1, q5+1, and q6+1 are divisors of v, we get that (|Gα|,v−1) divides |Out(T)|(q−1)2(q3−1)2(q5−1)(q7−1)(q9−1)(q15−1). It follows that r0<q45, and so q124<v<λr20<q105, a contradiction again.
Assume that Gα is of type Aϵ2(q)Eϵ6(q) or E8(q13). Then, since Gα is non-parabolic, the Tits lemma in [18, 1.6] implies that p divides v=|G:Gα|, and so (|Gα|,v−1) is coprime with p. It follows that r0≤|Gα|p′ as r0 divides (|Gα|,v−1). This implies that v<λ|Out(T)|2|Tα|2p′ by Lemma 3.2, which cannot be satisfied when Gα is of type Aϵ2(q)Eϵ6(q) or E8(q13).
Lemma 3.10. Assume that G and D satisfy the hypothesis of Theorem 1.1. Then the type of Gα cannot be either (q−ϵ1)Dϵ5(q) when T=Eϵ6(q) or (q−ϵ1)Eϵ6(q) when T=E7(q).
Proof. Assume that T is Eϵ6(q) and Gα is of type (q−ϵ1)Dϵ5(q). Then, λ<2q4 as λ divides |Gα| and v=q16(q9−ϵ1)(q12−1)(3,q−1)(q−ϵ1)(q4−1). In addition, we know from [1, Theorem 4.1] that there exist two subdegrees: q8(q5−ϵ)(q4+1) and q10(q3+ϵ)(q8−1). Since r0 divides the greatest common divisors of every non-trivial subdegree and v−1 (Lemma 2.3), we have (r0,p)=1, and so r0∣2(q−ϵ1)(q4+1), which implies that r0 is too small to satisfy v<λr20 again.
If T is E7(q) and Gα is of type (q−ϵ1)Eϵ6(q), we have λ≤2q6 and v=q27(q5+ϵ1)(q9+ϵ1)(q14−1)q−ϵ1. [1, Theorem 4.1] shows that there exist two subdegrees, which divide q12(q5−ϵ)(q9−ϵ) and(4,qm−1ϵ)q16(q5−ϵ)(q12−1q4−1), respectively. However, by Lemma 2.3 we know that r0 is too small again.
Proof of Theorem 1.1. It follows immediately from Lemmas 3.1–3.10.
In this paper, we figure out all possible parameters of 2-(v,k,λ) designs D (with λ prime) that admit flag-transitive point-primitive automorphism groups with an exceptional Lie type socle. Our work contributes to the classification of flag-transitive 2-(v,k,λ) designs. In addition, the cases that the automorphism groups of such designs with classical socle will be the main focus in our future work.
Y. Zhang: Data curation, writing-review and editing; J. Shen: Writing-original draft. All authors have read and agreed to the published version of the manuscript.
The authors declare they have not used artificial intelligence (AI) tools in the creation of this article.
The authors would like to thank the anonymous referees for corrections and valuable comments that led to the improvement of this paper.
This work is financially supported by the National Natural Science Foundation of China (Grant number: 12301020 and 12201469) and the Science and Technology Projects in Guangzhou (Grant number: 2023A04J0027).
The authors declare no conflict of interest.
[1] |
J. J. Liu, M. Yamamoto, A backward problem for the time-fractional diffusion equation, Appl. Anal., 89 (2010), 1769–1788. https://doi.org/10.1080/00036810903479731 doi: 10.1080/00036810903479731
![]() |
[2] |
L. Feng, I. Turner, P. Perré, K. Burrage, The use of a time-fractional transport model for performing computational homogenisation of 2D heterogeneous media exhibiting memory effects, J. Comput. Phys., 480 (2023), 112020. https://doi.org/10.1016/j.jcp.2023.112020 doi: 10.1016/j.jcp.2023.112020
![]() |
[3] |
M. Biglari, A. R. Soheili, Efficient simulation of two-dimensional time-fractional Navier–Stokes equations using RBF-FD approach, Eng. Anal. Bound. Elem., 160 (2024), 134–159. https://doi.org/10.1016/j.enganabound.2023.12.021 doi: 10.1016/j.enganabound.2023.12.021
![]() |
[4] |
F. A. Rihan, Q. M. Al-Mdallal, H. J. AlSakaji, A. Hashish, A fractional-order epidemic model with time-delay and nonlinear incidence rate, Chaos Soliton. Fract., 126 (2019), 97–105. https://doi.org/10.1016/j.chaos.2019.05.039 doi: 10.1016/j.chaos.2019.05.039
![]() |
[5] |
M. Inc, The approximate and exact solutions of the space-and time-fractional Burgers equations with initial conditions by variational iteration method, J. Math. Anal. Appl., 345 (2008), 476–484. https://doi.org/10.1016/j.jmaa.2008.04.007 doi: 10.1016/j.jmaa.2008.04.007
![]() |
[6] |
J. G. Liu, J. Zhang, A new approximate method to the time fractional damped Burger equation, AIMS Math., 8 (2023), 13317–13324. https://doi.org/10.3934/math.2023674 doi: 10.3934/math.2023674
![]() |
[7] |
A. M. Zidan, A. Khan, R. Shah, M. K. Alaoui, W. Weera, Evaluation of time-fractional Fisher's equations with the help of analytical methods, AIMS Math., 7 (2022), 18746–66. https://doi.org/10.3934/math.20221031 doi: 10.3934/math.20221031
![]() |
[8] |
X. Qin, X. Yang, P. Lyu, A class of explicit implicit alternating difference schemes for generalized time fractional Fisher equation, AIMS Math., 6 (2021), 11449–11466. https://doi.org/10.3934/math.2021663 doi: 10.3934/math.2021663
![]() |
[9] |
W. Chen, X. Xu, S. P. Zhu, Analytically pricing double barrier options based on a time-fractional Black–Scholes equation, Comput. Math. Appl., 69 (2015), 1407–1419. https://doi.org/10.1016/j.camwa.2015.03.025 doi: 10.1016/j.camwa.2015.03.025
![]() |
[10] |
A. Golbabai, O. Nikan, T. Nikazad, Numerical analysis of time fractional Black–Scholes European option pricing model arising in financial market, Comput. Appl. Math., 38 (2019), 1–24. https://doi.org/10.1007/s40314-019-0957-7 doi: 10.1007/s40314-019-0957-7
![]() |
[11] |
H. Zhang, F. Liu, I. Turner, Q. Yang, Numerical solution of the time fractional Black–Scholes model governing European options, Comput. Math. Appl., 71 (2016), 1772–1783. https://doi.org/10.1016/j.camwa.2016.02.007 doi: 10.1016/j.camwa.2016.02.007
![]() |
[12] |
Q. Du, J. Yang, Z. Zhou, Time-fractional Allen–Cahn equations: analysis and numerical methods, J. Sci. Comput., 85 (2020), 42. https://doi.org/10.1007/s10915-020-01351-5 doi: 10.1007/s10915-020-01351-5
![]() |
[13] |
H. Liu, A. Cheng, H. Wang, J. Zhao, Time-fractional Allen–Cahn and Cahn–Hilliard phase-field models and their numerical investigation, Comput. Math. Appl., 76 (2018), 1876–1892. https://doi.org/10.1016/j.jocs.2023.102114 doi: 10.1016/j.jocs.2023.102114
![]() |
[14] |
B. Derbissaly, M. Sadybekov, Inverse source problem for multi-term time-fractional diffusion equation with nonlocal boundary conditions, AIMS Math., 9 (2024), 9969–9988. https://doi.org/10.3934/math.2024488 doi: 10.3934/math.2024488
![]() |
[15] |
W. M. Abd-Elhameed, H. M. Ahmed, Spectral solutions for the time-fractional heat differential equation through a novel unified sequence of Chebyshev polynomials, AIMS Math., 9 (2024), 2137–2166. https://doi.org/10.3934/math.2024107 doi: 10.3934/math.2024107
![]() |
[16] |
Y. E. Aghdam, H. Mesgarani, Z. Asadi, V. T. Nguyen, Investigation and analysis of the numerical approach to solve the multi-term time-fractional advection-diffusion model, AIMS Math., 8 (2023), 29474. https://doi.org/10.3934/math.20231509 doi: 10.3934/math.20231509
![]() |
[17] |
J. Kim, S. Kwak, H. G. Lee, Y. Hwang, S. Ham, A maximum principle of the Fourier spectral method for diffusion equations, Electron. Res. Arch., 31 (2023), 5396–5405. https://doi.org/10.3934/era.2023273 doi: 10.3934/era.2023273
![]() |
[18] |
J. M. Carcione, Theory and modeling of constant-Q P-and S-waves using fractional time derivatives, Geophysics, 74 (2009), T1–T11. https://doi.org/10.1190/1.3008548 doi: 10.1190/1.3008548
![]() |
[19] |
J. M. Carcione, F. Cavallini, F. Mainardi, A. Hanyga, Time-domain modeling of constant-Q seismic waves using fractional derivatives, Pure Appl. Geophys., 159 (2002), 1719–1736. https://doi.org/10.1007/s00024-002-8705-z doi: 10.1007/s00024-002-8705-z
![]() |
[20] |
S. Ham, J. Kim, Stability analysis for a maximum principle preserving explicit scheme of the Allen–Cahn equation, Math. Comput. Simul., 207 (2023), 453–465. https://doi.org/10.1016/j.matcom.2023.01.016 doi: 10.1016/j.matcom.2023.01.016
![]() |
[21] |
J. Wang, Z. Han, W. Jiang, J. Kim, A fast, efficient, and explicit phase-field model for 3D mesh denoising, Appl. Math. Comput., 458 (2023), 128239. https://doi.org/10.1016/j.amc.2023.128239 doi: 10.1016/j.amc.2023.128239
![]() |
[22] | J. W. Thomas, Numerical partial differential equations: finite difference methods in Springer Science & Business Media (2013). |
[23] |
M. Sarboland, A. Aminataei, On the numerical solution of time fractional Black-Scholes equation, Int. J. Comput. Math., 99 (2022), 1736–1753. https://doi.org/10.1080/00207160.2021.2011248 doi: 10.1080/00207160.2021.2011248
![]() |
[24] |
J. Huang, Z. Cen, J. Zhao, An adaptive moving mesh method for a time-fractional Black–-Scholes equation, Adv. Differ. Equ., 2019 (2019), 1–14. https://doi.org/10.1186/s13662-019-2453-1 doi: 10.1186/s13662-019-2453-1
![]() |
[25] |
B. Xia, R. Yu, X. Song, X. Zhang, J. Kim, An efficient data assimilation algorithm using the Allen–Cahn equation, Eng. Anal. Bound. Elem., 155 (2023), 511–517. https://doi.org/10.1016/j.enganabound.2023.06.029 doi: 10.1016/j.enganabound.2023.06.029
![]() |
[26] |
Y. Hwang, I. Kim, S. Kwak, S. Ham, S. Kim, J. Kim, Unconditionally stable monte carlo simulation for solving the multi-dimensional Allen–Cahn equation, Electron. Res. Arch., 31 (2023), 5104–5123. https://doi.org/10.3934/era.2023261 doi: 10.3934/era.2023261
![]() |
[27] |
Y. Hwang, S. Ham, C. Lee, G. Lee, S. Kang, J. Kim, A simple and efficient numerical method for the Allen–Cahn equation on effective symmetric triangular meshes, Electron. Res. Arch., 31 (2023), 4557–4578. https://doi.org/10.3934/era.2023233 doi: 10.3934/era.2023233
![]() |
[28] |
C. Lee, S. Kim, S. Kwak, Y. Hwang, S. Ham, S. Kang, J. Kim, Semi-automatic fingerprint image restoration algorithm using a partial differential equation, AIMS Math., 8 (2023), 27528-27541. https://doi.org/10.3934/math.20231408 doi: 10.3934/math.20231408
![]() |
[29] |
Z. W. Fang, H. W. Sun, H. Wang, A fast method for variable-order Caputo fractional derivative with applications to time-fractional diffusion equations, Comput. Math. Appl., 80 (2020), 1443–1458. https://doi.org/10.1016/j.camwa.2020.07.009 doi: 10.1016/j.camwa.2020.07.009
![]() |