Flag-transitive 4-designs and PSL(2,q) groups
Huili Dong111
Corresponding author:[email protected]
*College of Mathematics and Information Science, Henan Normal University,
Xinxiang, Henan 453007, P. R. China
Abstract This paper considers flag-transitive 4-(q+1,k,λ) designs with λ≥5 and q+1>k>4. Let
the automorphism group of a design D be a simple group G=PSL(2,q). Depend on the fact that the setwise stabilizer GB must be one of twelve kinds of subgroups, up
to isomorphism we get the following two results.
(i) If 10≥λ≥5, then except (G,Gx,GB,k,λ)=(PSL(2,761),E761⋊C380,S4,24,7) or
(PSL(2,512),E512⋊C511,D18,18,8) undecided, D
is a 4-(24,8,5), 4-(9,8,5), 4-(8,6,6), 4-(10,9,6), 4-(9,6,10), 4-(9,7,10), 4-(12,11,8) or 4-(14,13,10) design with
GB=D8, E8⋊C7, D6, E9⋊C4, PSL(2,2), D14, E11⋊C5
or E13⋊C6
respectively.
(ii) If λ>10, GB=A4, S4, A5, PGL(2,q0)(g>1 even) or PSL(2,q0), where q0g=q, then
there is no such
design.
Keywords 4-Design, flag-transitive, PSL(2,q)
MSC(2000) Subject Classification 05B05, 05B25, 20B25
1 Introduction
A t-(v,k,λ) design with a simple group G=PSL(2,q) as an automorphism group is interesting. Many classification results about flag-transitive designs have been got.
In 1986, 2-(v,k,1) designs are classified by Delandtsheer[1]. In 2016,
2-(v,k,λ) symmetric designs with the sole of G equal to PSL(2,q) are studyed by Alavi, Bayat and Daneshkhah[2]. In 2018, all
nonsymmetric 2-designs with
(r,λ)=1 are determined by Zhan and Zhou[3]. In 2019, 2-designs with k=4 are considered by Zhan, Ding and Bai[4].
For 3-designs, there are also many results given in[5, 6, 7, 8]. After Dai and Li[9, 10] classified
flag-transitive 4-designs with λ=3 or 4, we continue this work, and
get the following two theorems:
Theorem 1.1**.**
Let D be a flag-transitive 4-(q+1,k,λ) design with 10≥λ≥5 and q+1>k>4, G=PSL(2,q) be an automorphism simple group. Then
up
to isomorphism except (G,Gx,GB,k,λ)=(PSL(2,761),E761⋊C380,S4,24,7) or
(PSL(2,512),E512⋊C511,D18,18,8) undecided, D
is a 4-(24,8,5), 4-(9,8,5), 4-(8,6,6), 4-(10,9,6), 4-(9,6,10), 4-(9,7,10), 4-(12,11,8) or 4-(14,13,10) design with
GB=D8, E8⋊C7, D6, E9⋊C4, PSL(2,2), D14, E11⋊C5
or E13⋊C6
respectively.
Theorem 1.2**.**
Let D be a flag-transitive 4-(q+1,k,λ) design with λ>10 and q+1>k>4, G=PSL(2,q) be a simple automorphism group of D, GB=A4, S4, A5, PGL(2,q0)(g>1 even) or PSL(2,q0), where q0g=q. Then
there is no such
design.
2 Preliminaries
We give some useful results. The notations n, GB
and GxB denote gcd(2,q−1), the setwise stabilizer and Gx∩GB respectively, where x∈B.
Lemma 2.1**.**
Let D be a 4-(q+1,k,λ) design with an automorphism group G=PSL(2,q) flag-transitively acting on D. Then
(i) λ(q−2)=n∣GB∣k(k−1)(k−2)(k−3);
(ii) q=λn∣GxB∣(k−1)(k−2)(k−3)+2;
(iii) k∣(λn(q−2)∣GxB∣+6);
(iv) k∣gcd(nq(q2−1),λn(q−2)∣GxB∣+6).
Proof. Since G is flag-transitive, then by [11] G is 2-transitive, therefore, G is also block-transitive and point-primitive.
From ∣G∣=∣GB∣∣BG∣=∣GxB∣∣(x,B)G∣, we get b=∣GB∣∣G∣=∣GxB∣k∣G∣. By [12],
k(k−1)(k−2)(k−3)λq(q+1)(q−1)(q−2)=n∣GB∣q(q2−1)=nk∣GxB∣q(q2−1).
Obviously (i) and (ii) hold. Since (k−1)(k−2)(k−3)=(k2−6k+11)k−6, k∣∣GB∣ and ∣GB∣∣∣G∣, (iii) and (iv) hold.
3 Proof of two theorems
First we assume that D is a 4-(q+1,k,λ) design with λ≥5 and q+1>k>4, G=PSL(2,q) is
a flag-transitive automorphism group of D, where q=pf≥4 and p is a prime.
Since D is flag-transitive, we get that k is one orbit length of GB acting on D.
By [10, 13], up to conjugation GB must be one of twelve kinds of subgroups, then several results can be got.
Lemma 3.1**.**
GB=A4, S4 or A5 except (G,Gx,GB,k,λ)=(PSL(2,761),
E761⋊C380,S4,24,7) undecided.
Proof. Assume that GB=A4, S4 or A5, then ∣GB∣=12, 24 or 60. Since k∣∣GB∣, we have (∣GB∣,k)=(12,12), (12,6),
(24,24), (24,12), (24,8), (24,6), (60,60), (60,30), (60,20), (60,15), (60,12), (60,10), (60,6) or (60,5). Note that q>k−1, q is a power of a prime and
λ≥5,
by Lemma 2.1(i) and (ii), we get that
(∣GB∣,k,q,λ)=(12,12,32,33), (12,12,13,45), (12,12,17,33), (12,12,47,11), (12,12,101,5), (12,6,8,5),
(24,24,25,231), (24,24,71,77), (24,24,79,69), (24,24,163,33),
(24,24,233,23), (24,24,761,
7), (24,8,16,5), (24,8,9,5),(60,60,61,1653), (60,60,89,1121), (60,60,179,
551), (60,60,1123,87), (60,30,128,87), (60,30,31,189), (60,30,89,63),
(60,
30,263,21), (60,30,191,29), (60,20,53,19), (60,20,59,
17), (60,15,16,39), (60,15,23,13), (60,15,41,7), (60,12,13,9) or
(60,10,16,
6). By the lengths of orbits listed in [10, 13], we need consider
(∣GB∣,k,q,λ)=(12,12,17,33), (12,12,47,11), (12,12,101,5),
(24,24,71,77), (24,24,79,69), (24,24,233,2
3), (24,24,761,7), (60,60,89,1121), (60,60,179,551) or (60,30,89,63).
Using Magma[14] we can rule out all cases except case 7. The possible parameters are listed in Table 1, where the notation mn means that the degree m appears n times.
For example, in case 1, the group PrimitiveGroup(18,1) denotes the primitive permutation group G=PSL(2,17)
acting on the set Ω={1,2,…,18}.
And G have two conjugacy classes of subgroups of order 12 and
the possible lengths of all orbits of GB acting on Ω are both
6, 12. There are 2 possible basic blocks B0 of designs.
However, the command Design<4,18∣D> where D=BG returns both structures are not 4-designs, then case 1 can be ruled out.
For case 7, from ∣Gx∣=v∣G∣=289180, we know Gx=E761⋊C380. There are 64 possible basic blocks B0 of designs.
However, b=∣GB∣∣G∣=9181465 is too large to use Magma. This case is undecided.
Table 1: Possible parameters with GB=A4, S4 or A5
[TABLE]
Lemma 3.2**.**
GB=PGL(2,q0), where q0g=q and g>1 even.
Proof. Assume that GB=PGL(2,q0), where q0g=q and g>1 even. Then
k=q0+1, q0(q0−1) or q0(q02−1).
If k=q0+1, then by Lemma 2.1(i)
nλ(q0g−2)=q0−2. However, there is no solution of this equation.
If k=q0(q0−1), then q0≥3 and
[TABLE]
Thus g=2 or 4.
Since
[TABLE]
we get (q02−2)∣(q0−2) or
(q04−2)∣(q03+10q02−3q0−14). However, this is impossible.
If k=q0(q02−1), then
[TABLE]
Thus g=2, 4, 6 or 8. Since
[TABLE]
we get (q02−2)∣(13q0−18), (q04−2)∣(4q03−18q02−q0+18), (q06−2)∣(3q05+12q04+12q03−6q02−17q0−18) or (q08−2)∣(3q07+6q06−3q05−12q04−10q03+6q02+9q0+6).
Therefore, (g,q0)=(2,2), (2,3).
However, this is contrary with q>k−1.
Lemma 3.3**.**
Let GB=PSL(2,q0), where q0g=q. Then D
is a 4-(9,6,10) design with GB=PSL(2,2), denoted by D1.
Proof. Assume tht GB=PSL(2,q0), where q0g=q. Then k=q0+1, q0(q0−1) if g is even or gcd(2,q0−1)q0(q02−1).
If k=q0+1, then λ(q0g−2)=q0−2. However, there is no such q0>3 satisfying the equation.
If k=q0(q0−1), then q0≥3 and
q05−2>λ(q0g−2)=(q0−2)(q02−q0−1)(q02−q0−3).
Thus g=2 or 4.
The same as in Lemma 3.2, this is impossible.
If k=gcd(2,q0−1)q0(q02−1), then
q09−2>n4λ(q0g−2)=(q03−q0−n)(q03−q0−2n)(q03−q0−3n). Note that q+1>k>4,
we get 8≥g≥2.
Since
[TABLE]
we get
(g,q0)=(3,2). Thus (q,k,λ)=(8,6,10).
The generators of G=PSL(2,8) acting on the set Ω={1,2,…,9} are as follows:
g1=(1,8)(2,4)(3,7)(5,6), g2=(2,7)(3,6)(4,5)(8,9), g3=(1,2,3,4,5,6,7).
Then all orbits of GB acting on Ω are
Ω1={4,6,8} and Ω2={1,2,3,5,7,9}.
Take
B=Ω2 as a possible basic block of a design, then it
returns a 4-(9,8,5) design D1. Clearly, D1 is also flag-transitive.
Next we consider GB is one of the remaining four kinds of subgroups and assume that 10≥λ≥5.
Lemma 3.4**.**
Let GB=Cc or D2c, where c∣nq±1, then (λ,∣GB∣,c,k,q)=(5,8,4,8,23), (8,18,9,18,512), (10,6,3,6,8),
(7,8,8,8,17), (7,8,4,8,17), (10,14,7,7,8) or (6,6,3,6,7).
Proof. Assume that GB=Cc or D2c, where c∣nq±1.
Then
k=c or 2c$$(|G_{B}|=2c).
Let c∣nq+1, then by Lemma 2.1(iii) c∣gcd(λn(q−2)∣GxB∣+6,nq+1), that is,
c∣gcd(3λn∣GxB∣−6,nq+1). By Lemma 2.1(ii), (λ,∣GB∣,c,k,q)=(5,8,4,8,23), (8,18,9,18,512) or (10,6,3,6,8).
Let c∣nq−1.
Assume that (λ,n,∣GB∣,k)=(6,1,2c,2c), then 6(2f−2)=(2c−1)(2c−2)(2c−3)=2c(4c2−12c+11)−6, therefore, 3c2f−1=4c2−12c+11. From 3∣(4c2−12c+11), we have that
c=3l+1 or 3l+2, where l is a positive integer. If c=3l+1, then 2f=l(6l+1)(6l−1)+2, therefore, 8∣(l(6l+1)(6l−1)+2), we get l≡2(mod8). Let
l=8m+2, then 2f−1=(4m+1)(48m+13)(48m+11)+1. Obviously, m=0, therefore, 2f−1≥5⋅61⋅59+1>214. Thus 214∣((4m+1)(48m+13)(48m+11)+1), however, this is impossible.
Assume that (λ,n,∣GB∣,k)=(6,1,c,c), then
6(2f−2)=(c−1)(c−2)(c−3)=c(c2−6c+11)−6, therefore, 6c2f−1=c2−6c+11. From 6∣(c2−6c+11), we have that
c=6l+1 or 6l+5, where l is an integer.
If c=6l+1, then 2f−1=l(6l−1)(3l−1)+1, therefore, 4∣(l(6l−1)(3l−1)+1), that is, 4∣(18l3−9l2+l+1). However, this is impossible.
If c=6l+5, then 2f−1=(3l+2)(2l+1)(3l+1)+1, therefore, 4∣((3l+2)(2l+1)(3l+1)+1), that is, 4∣(18l3+27l2+13l+3). However, this is also impossible.
Now we consider that (λ,n,∣GB∣,k)=(6,1,2c,2c) and (6,1,c,c),
then c∣gcd(λn(q−2)∣GxB∣+6,nq−1), that is,
c∣gcd(λn∣GxB∣−6,nq−1). Thus
(λ,∣GB∣,c,k,q)=(7,8,8,8,17), (7,8,4,8,17), (7,16,8,16,197), (10,14,7,7,8), (6,6,3,6,7).
By employing the command Subgroups(G:OrderEqual:=b), we rule out (λ,∣GB∣,c,k,q)=(7,16,8,16,197).
Lemma 3.5**.**
Let GB=Eq0 or Eq0⋊Cc, where q0∣q, c∣(q0−1) and c∣(q−1), then
(λ,i,k,q)=(5,1,8,8), (6,2,9,9), (8,2,11,11) or (10,2,13,13) where k=q0 and c=ik−1.
Proof. Let GB=Eq0 or Eq0⋊Cc, where q0∣q, c∣(q0−1) and c∣(q−1).
Then
k=q0 or cq0.
Let k=q0, then k∣gcd(λn(q−2)∣GxB∣+6,q), that is, k∣gcd(2λn∣GxB∣−6,q).
If ∣GB∣=q0, then (λ,∣GB∣,k,q)=(7,8,8,32).
If ∣GB∣=cq0, then ∣GxB∣=c, therefore,
k≤2λnc−6, so 2λnk−1<2λnk+6≤c.
From c∣(k−1), we let c=ik−1, where i=1, 2, ⋯, 2λn−1.
Then from k∣gcd(i2λn(k−1)−6,q), we get k∣gcd(2λn+6i,q).
All possible parameters of (λ,i,k,q) are (5,1,8,8), (5,1,13,13), (6,2,9,9), (6,3,7,7), (7,1,17,17),
(8,1,19,19), (8,2,11,11), (10,1,23,23) or (10,2,13,13).
By employing the command Subgroups(G:OrderEqual:=b), we rule out (λ,i,k,q)=(5,1,13,13), (6,3,7,
7), (7,1,17,17),
(8,1,19,19) and (10,1,23,23).
If k=cq0, then ∣GxB∣=1. From k∣(λn(q−2)+6),
we have that q0∣gcd(2λn−6,q). Since c∣(q0−1). We get no possible parameters.
Lemma 3.6**.**
Let GB=Cc, D2c or Eq0, Eq0⋊Cc, where c∣nq±1 or q0∣q, c∣(q0−1) and c∣(q−1). Then except (G,Gx,GB,k,λ)=(PSL(2,512),E512⋊C511,D18,18,8) undecided, up
to isomorphism D
is a 4-(24,8,5), 4-(9,8,5), 4-(8,6,6), 4-(10,9,6), 4-(9,6,10), 4-(9,7,10), 4-(12,11,8) or 4-(14,13,10) design with
GB=D8, E8⋊C7, D6, E9⋊C4, PSL(2,2), D14, E11⋊C5
or E13⋊C6
respectively.
Proof. We consider the cases appearing in Lemma 3.4 and 3.5 and list the results in Table 2. The lengths of all orbits and the number of the designs are listed in
column 5 and column 6 respectively, where twice or five times denote such lengths of orbits appearing twice or five times.
Table 2: Possible values with GB=Cc, D2c, Eq0 or Eq0⋊Cc
[TABLE]
For case 2, from ∣Gx∣=v∣G∣=261632, we know Gx=E761⋊C380. There are 28 possible basic blocks B0 of designs.
However, b=∣GB∣∣G∣=7456512 is too large to use Magma.
For the remaining cases, the same as before, we can deal with them by the same method. For example,
the generators of the group G=PSL(2,23) acting on the set Ω={1,2,…,24} are listed as follows:
g1=(1,8)(2,10)(3,16)(4,24)(5,15)(6,21)(7,23)(9,20)(11,22)(12,14)(13,18)(17,19),
g2=(1,19,24,6)(2,13,22,20)(3,12,23,5)(4,17,8,21)(7,14,16,15)(9,11,18,10),
g3=(1,24)(2,22)(3,23)(4,8)(5,12)(6,19)(7,16)(9,18)(10,11)(13,20)(14,15)(17,21).
G has only one conjugacy class of subgroups of order 8 and
all the orbits of
GB acting on the set Ω are listed as follows:
Ω1={1,4,6,8,17,19,21,24},Ω2={2,9,10,11,13,18,20,22},
Ω3={3,5,7,12,14,15,16,23}.
First take
B0=Ω1 as a possible basic block of a design. However,
the structure is not 4-design.
Now take
B0=Ω2 or Ω3 as a possible basic block of a design,
then
we construct two flag-transitive 4-(24,8,5) designs D2 and D3.
By[15], it shows that both designs are isomorphic. It need to note that the design corresponding to case 3 is isomorphic to the design D1.
This completes the proof of Theorem 1.1 and 1.2.
AcknowledgementsThis work was supported by the
National Natural Science Foundation of China(No:11301158,11601132).