3-Homogeneous Groups and Block-Transitive 7 – ( v , k , 3 ) Designs

The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block-transitive 7–(v, k, 3) design and prove our main theorem: If the automorphism group of a 7–(v, k, 3) design is block-transitive, then it is neither isomorphic to Affine Type Groups nor Almost Simple Type Groups.


Introduction
A t-design is a finite incidence structure D = (X, B), where X is a set of points and B a set of blocks, such that (1) each block is incident with k points and (2) each t-subset of X is incident with λ blocks.If |X| = v, then we call D a t − (v, k, λ) design [1].
Usually we denote |B| = b.A t-design D is trivial, if each t-subset of X is a block and all t-subsets of X are contained in B. If any two blocks of D are different, then D is called simple.If a permutation of X preserves a block of D to a block of itself, the permutation is called an automorphism of D, and all the automorphisms of D form a group G, called the automorphism group of D, and we denote it G ≤ Aut(D).A group of automorphism of D is block-transitive if G acts transitively on the blocks of D. This is equivalent to that group G is transitive on the blocks and a block stable subgroup of G is also transitive on the blocks.Here we are interested in a design that is nontrivial and simple.
How to construct a block design with given parameters is one of the most important topics of combinatorial mathematics.It is especially difficult to construct a t-design with larger parameters.By [2], we have the following result: if D is a nontrivial t − (v, k, λ) design with a block-transitive automorphism group, then t ≤ 7. Thus, it is necessary to discuss block-transitive designs with t ≤ 7.
Praeger and Cameron proved a very meaningful theorem in 1993 [2]: when t > 8, there is no non-trivial block-transitive t-design, and when t > 7, there is no non-trivial flag-transitive t-design.At present, the research results of flag-transitive design are relatively perfect.However, the research on block-transitive t-designs is scarce.In 2010, Huber completed the proof that there is no block-transitive Steiner 6-design (unless G = PΓL(2, p e ), p = 2, 3, and e is odd prime) [3].However, when λ ≥ 2, the current research progress is slow and has yielded few results.In this paper, we are going to study the existence of block-transitive 7 − (v, k, 3) designs.The main results are as follows.
Theorem.Let D be a non-trivial 7 − (v, k, 3) design and G be an automorphism group of D. If G acts block-transitively on D, then G is neither isomorphic to Affine Type Groups nor Almost Simple Type Groups.
If G acts block-transitively on D , then G acts point [t/2] -homogeneously on D.
In particular, when t = 7, λ = 3 and G acts block-transitively on D, then G acts point 3-homogeneously on D. We can use the classification of finite 3-homogeneous permutation groups to discuss a block-transitive 7 − (v, k, 3) design.
Lemma 2. Let D be a t − (v, k, λ) design.Therefore, the following holds: For any 1 ≤ s < t , a t − (v, k, λ) design is also a s − (v, k, λ s ) design, where: In this case, when t = 7, we deduce from Lemma 5 the following upper bound for the positive integer k.Lemma 8. Let G be a finite 3-homogeneous permutation group on a set X with |X| ≥ 4 , then G is either of Affine Type or Almost Simple Type [5].
Lemma 9.In finite 3-homogeneous permutation groups, the classification of Affine Type Group is one of the following [5]: Lemma 10.In finite 3-homogeneous permutation groups on a set X with |X| ≥ 4, let G be of Almost Simple Type [4].Therefore, G contains a simple normal subgroup N, where N is the socle of group G and N ≤ G ≤ Aut(N).Thus, N and v = |X| are given as follows: Lemma 11.Let ε be a 3-dimensional subspace in vector space V = V(d, 2), then GL(d, 2) = SL(d, 2) acts point-transitively on V\ε ( [6]).

Proof of the Main Theorem
Let D be a non-trivial 7 − (v, k, 3) design, the automorphism group G of D acts block-transitively on D, then G is a finite 3-homogeneous permutation group.Using Lemma 8, we know that a permutation group of a 7 − (v, k, 3) design is either Affine Type or Almost Simple Type.For D is non-trivial, then we can suppose k > 7. Now we are going to discuss the problem in two cases.
and combining the condition of k > 7, the parameter k satisfies condition 8 ≤ k ≤ 14.It is clear here that these are not possible if 10 ≤ k ≤ 14.Because of Lemma 2 (2), we have 29|b, but 29⊥|G| (where 29⊥|G| means that |G| cannot be divisible by 29), which leads to a contradiction.Corollary 1 is impossible. Here , and by the proof of the above Corollary 1, none of the designs satisfying the above conditions exist.Now we assume d > 3. Let e 1 , e 2 , • • • , e d be a set of bases of vector space V(d, 2).Therefore, the dimension of the subspace generated by any 7 points in vector space V(d, 2) is at least 3. Let ε =< e 1 , e 2 , e 3 > be a vector subspace generated by the base vectors e 1 , e 2 , e 3 and S = {0, e 1 , e 2 , e 3 , e 1 + e 2 , e 1 + e 3 , e 2 + e 3 } be any 7-subset of ε.By the definition of t-design, for a 7-design, each 7-subset is contained in exactly 3 blocks and we record these three blocks as then by the transitivity of SL(d, 2) ε on the vector space V(d, 2), we have α SL(d,2) on the other hand, by Lemma 5, we have 3(v − 6) ≥ (k − 6)(k − 5), so k < 14.As the same proof method of Corollary 1, we can rule out this case.

G Is an Almost Simple Type
Since D is a non-trivial 7-design, then, by Lemma 4, k < v − 7. Of course, we have k ≤ v − 2, so A v (v ≥ 5) acts v-2-transitively on D, and then G is k-transitive on D. It means that D contains all k-subsets and D is a trivial design, a contradiction.
Here n = (2, q − 1) = 1.By a|ne , we know a ≤ e, so Now, we construct an auxiliary function as follows: Equation ( 9) is a decreasing function of e (e ≥ 3).Using a computer to calculate, we find that f (18) ≈ 1.0979006, f (19) ≈ 0.8190221 < 1.Using MATLAB software, we map Figures 1 and 2 as follows (see Appendices A and B): Additionally, by Equation ( 4), we can obtain an Inequality (6) under the conditions of By Equations ( 5) and ( 6) and Lemma 6, we have Now we are going to discuss it in three steps.1.

Here
(2, 1) = 1 n q   .By a ne , we know a e  , so Now, we construct an auxiliary function as follows:    As a result, the corresponding values of q and v are as shown in Table 1. .Now, we are going to discuss the case that k is less than 27.We can introduce Inequality (10) with Equation (3) and ( 1)( 2)( 3)( 4)( 5) ( 6).For |G B | ≥ 1, by properties of a decreasing function, we obtain e ≤ 18.As a result, the corresponding values of q and v are as shown in Table 1.Since 8 ≤ k ≤ 3v − 71 4 + 11 2 and v = q + 1 ≥ 15.By Equation ( 3), the possible values of v and k are only one of the following three kinds (v, k) = (65537, 8), (131073,8), and (262145,8).They are all in contradiction with the hypothesis k ≥ 26.Now, we are going to discuss the case that k is less than 27.We can introduce Inequality (10) with Equation (3) and |G B | ≥ 1: Then, f (e) is an increasing function of e, and the maximum value of h(k) is h(k) max =h(26) = 552, 552, 000.It can be calculated that the maximum value of e is e max = 9.Due to k ≥ 8 and v = 2 e + 1 > k + t ≥ 15, the minimum value of e is e min = 4.
Again, with Equation (3), we have and The admissible parameter sets (with Inequality (12) and Lemmas 3-6) are shown in Table 2.At last, the admissible parameter sets (v, k) in Table 2 do not satisfy Equation (11).Therefore, we show that it does not occur.
2. p = 3, q = 3 e .The proof is similar to the above.However, here n = (2, q − 1) = 2, and by a|ne , we have a ≤ 2e.Correspondingly, we can construct the following auxiliary function: Similar to the proof method of the above, we can rule out it.
3. p ≥ 5, q = p e and p is a prime.
Since n = (2, q − 1) = 2 and a|ne , then a ≤ 2e.If p ≥ 5, q = p e ≥ 5 e , then q = p e ≥ 5 e ≥ 5 a 2 > 2 a , and a < log 2 q.By Inequality (7), we have Let since f (q) is a reduced function when q is greater than 28 (Figures 3 and 4) (see Appendices C and D).For (65000) = 1.9617, (60000) = 2.0273, f f binding Inequality (11), the range of possible values of q is 28 60000   q . Accordingly, the values of k satisfy the condition 13 430.k   For each pair (q, k), there is no corresponding 7 ( 1, , 3) In a word, if After calculating, the prime number that is suitable for the above inequality does not exist.For (65000) = 1.9617, (60000) = 2.0273, f f binding Inequality (11), the range of possible values of q is 28 60000   q . Accordingly, the values of k satisfy the condition 13 430.k   For each pair (q, k), there is no corresponding 7 ( 1, , 3) In a word, if After calculating, the prime number that is suitable for the above inequality does not exist.For f (65000) = 1.9617, f (60000) = 2.0273, binding Inequality (11), the range of possible values of q is 28 < q < 60000.Accordingly, the values of k satisfy the condition 13 < k < 430.For each pair (q, k), there is no corresponding 7 − (q + 1, k, 3) design by Lemma 2.
By the proof of Corollary 3, we know that this case will not occur.In this way, we have completed the proof of the main theorem.

Conclusions
With the aid of the MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we have proved that a block-transitive automorphism group of a 7-(v, k, 3) design is neither isomorphic to Affine Type Groups nor Almost Simple Type Groups.
is a decreasing function of e ( 3 e  ).Using a computer to calculate, we find that (software, we map Figures1 and 2as follows (see Appendices A and B):

Table 1 .
Values of q and v.

Table 1 .
Values of q and v.

Table 2 .
Values of q, v and k.