Abstract
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.
1. Introduction
A design is a finite incidence structure , where is a set of points and a set of blocks, such that (1) each block is incident with k points and (2) each t-subset of is incident with blocks. If , then we call D a design [1].
Usually we denote . 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 . 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 design with a block-transitive automorphism group, then . Thus, it is necessary to discuss block-transitive designs with .
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 , and e is odd prime) [3]. However, when , the current research progress is slow and has yielded few results. In this paper, we are going to study the existence of block-transitive designs. The main results are as follows.
Theorem.
Let be a non-trivial 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.
2. Preliminary Results
Lemmas 1–5 can be found in the results of Beth et al. [4].
Lemma 1.
Let be a design, where and [4]. Therefore, the following holds:
- 1.
- If acts block-transitively on , then G acts point -homogeneously on .
- 2.
- If acts flag-transitively on , then acts point -homogeneously on .
In particular, when and acts block-transitively on , then acts point 3-homogeneously on . We can use the classification of finite 3-homogeneous permutation groups to discuss a block-transitive design.
Lemma 2.
Let be a design. Therefore, the following holds:
- 1.
- 2.
- 3.
- For any 1 , a design is also a design, where:
- 4.
- If t = 7, then
Lemma 3.
If is a non-trivial design, then
Lemma 4.
If is a non-trivial design, then .
Lemma 5.
If is a design, then
In this case, when , we deduce from Lemma 5 the following upper bound for the positive integer .
Lemma 6.
Let be a non-trivial design, then
Proof.
By Lemma 5, when , we have then
Lemma 7.
Let be a non-trivial design and G be an automorphism group of D [2]. If acts block-transitively on , then
Lemma 8.
Let G be a finite 3-homogeneous permutation group on a set X with , 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]:
- 1.
- 2.
- 3.
Lemma 10.
In finite 3-homogeneous permutation groups on a set X with , 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 . Thus, N and are given as follows:
- 1.
- 2.
- 3.
- 4.
Lemma 11.
Let be a 3-dimensional subspace in vector space , then acts point-transitively on ([6]).
3. Proof of the Main Theorem
Let be a non-trivial design, the automorphism group of D acts block-transitively on , then is a finite 3-homogeneous permutation group. Using Lemma 8, we know that a permutation group of a design is either Affine Type or Almost Simple Type. For is non-trivial, then we can suppose . Now we are going to discuss the problem in two cases.
3.1. G Is an Affine Type Group
Corollary 1.
G is not isomorphic to .
If , then , which is a contradiction to the condition of .
If and , by Lemma 6, we have and combining the condition of the parameter satisfies condition . It is clear here that these are not possible if . Because of Lemma 2 (2), we have 29|b, but (where means that cannot be divisible by 29), which leads to a contradiction. Corollary 1 is impossible.
Corollary 2.
G is not isomorphic to .
Here . If then and by the proof of the above Corollary 1, none of the designs satisfying the above conditions exist. Now we assume . Let be a set of bases of vector space . Therefore, the dimension of the subspace generated by any 7 points in vector space is at least 3. Let be a vector subspace generated by the base vectors and 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 Thus, If contains a vector and , then by the transitivity of on the vector space , we have and
Therefore, we have or , on the other hand, by Lemma 5, we have , so . As the same proof method of Corollary 1, we can rule out this case.
Corollary 3.
G is not isomorphic to .
Here and for and the possible value of k is 8, 9, 10, or 11 by calculation. The corresponding r are not positive integers. This is impossible.
Thus, Corollary 3 is not possible.
3.2. G Is an Almost Simple Type
Corollary 4.
G is not isomorphic to
Since D is a non-trivial 7-design, then, by Lemma 4, . Of course, we have , so 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.
Corollary 5.
G is not isomorphic to
Here, and For , .
Then
For then . By Lemmas 2 (1) and 7, we have
and
For v = q + 1, we have
After simplification, we obtain the following:
Using Lemma 5 again, then
Add Equation (4) into Equation (3), we have
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 . By , we know , so
Now, we construct an auxiliary function as follows:
Equation (9) is a decreasing function of e (). Using a computer to calculate, we find that . Using MATLAB software, we map Figure 1 and Figure 2 as follows (see Appendix A and Appendix B):
Figure 1.
Partial graph of f(e) ().
Figure 2.
Partial graph of f(e) ().
For , by properties of a decreasing function, we obtain . As a result, the corresponding values of q and v are as shown in Table 1.
Table 1.
Values of q and v.
Since and . By Equation (3), the possible values of v and k are only one of the following three kinds , (131073,8), and (262145,8). They are all in contradiction with the hypothesis .
Now, we are going to discuss the case that k is less than 27. We can introduce Inequality (10) with Equation (3) and :
Let
and
Then, is an increasing function of e, and the maximum value of is It can be calculated that the maximum value of e is . Due to and the minimum value of e is .
Again, with Equation (3), we have
and
The admissible parameter sets (with Inequality (12) and Lemmas 3–6) are shown in Table 2.
Table 2.
Values of q, v and k.
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.
The proof is similar to the above. However, here , and by , we have . Correspondingly, we can construct the following auxiliary function:
Similar to the proof method of the above, we can rule out it.
3. and p is a prime.
Since and then If then , and . By Inequality (7), we have
Let
since is a reduced function when q is greater than 28 (Figure 3 and Figure 4) (see Appendix C and Appendix D).
Figure 3.
Partial graph of .
Figure 4.
Partial graph of .
For binding Inequality (11), the range of possible values of q is . Accordingly, the values of k satisfy the condition . For each pair (q, k), there is no corresponding design by Lemma 2.
In a word, if , and , cannot act block-transitively on any designs.
Now, we discuss the case of . By Equation (3),
After calculating, the prime number that is suitable for the above inequality does not exist.
In summary, Corollary 2 is not possible.
Corollary 6.
G is not isomorphic to .
By inequality and Lemma 2 (4), we know that admissible parameter sets are 7–(11, 8, 3), 7–(12, 8, 3), 7–(22, 8, 3), 7–(23, 8, 3), 7–(24, 8, 3), and 7–(22, 9, 3), 7–(22, 10, 3).
By Lemma 3, if , we have
- For parameter set 7–(11, 8, 3), Equation (16) does not hold if we take , and 7–(11, 8, 3) design does not exist.
- For parameter sets 7–(12, 8, 3), 7–(22, 8, 3), 7–(22, 9, 3), and 7–(22, 10, 3), Equation (16) does not hold if we take , thus neither of these four designs exist.
- For parameter sets 7–(23, 8, 3), Equation (16) does not hold when , and this design does not exist.
At last, using Lemma 2, we have
For parameter sets 7–(24, 8, 3), the right side of Equation (17) can be divisible by 19, so b can be divisible by 19. By Lemma 7, can be divisible by 19, but if (where a = 1 or 2), this is impossible. Therefore, the 7–(24, 8, 3) design does not exist.
Corollary 7.
G is not isomorphic to .
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.
4. 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.
Acknowledgments
The authors thank the referees for their valuable comments and suggestions on this paper. In particular, the first author thanks Weijun Liu and Huiling Li for their guidance and help. This research was supported by Science Research Project of Hunan Provincial Department of Education (Xiang Jiao Tong(2016)No365).
Author Contributions
This article was completed under the joint efforts of all three authors. The main writing work of the article was completed by L.X., C.G. mainly used the MATLAB software to produce the auxiliary graph, and L.S. used the MATLAB software for the larger parameters.
Conflicts of Interest
There is no conflict of interest.
Appendix A
e = 3:1/10:30;
y = (18.*e.*(2.^e-5).^2.*((3.*2.^e-59./4).^(1./2) + (3./2)))./((2.^e-2).*(2.^e-3).*(2.^e-4));
plot(e,y);
Appendix B
e = 5:1/10:30;
y = (18.*e.*(2.^e-5).^2.*((3.*2.^e-59./4).^(1./2) + (3./2)))./((2.^e-2).*(2.^e-3).*(2.^e-4));
plot(e,y);
Appendix C
q = 30:1/10:80;
y = (18.* (q-5).^2.*((3.*q-59./4).^(1./2) + (3./2))).*log2(q)./((q2).*(q-3).*(q-4));
plot(q,y);
Appendix D
q = 6000:1/100:80000;
y = (18.*(q-5).^2.*((3.*q-59./4).^(1./2) + (3./2))).*log2(q)./((q2).*(q-3).*(q-4));
plot(q,y);
References
- Biggs, N.L.; White, A.T. Permutation Groups and Combinatorial Structures; Peking University Press: Beijing, China, 1979. [Google Scholar]
- Cameron, P.J.; Praeger, C.E. Block-transitive t-designs II. In Finite Geometry and Combinatorics; de Clerck, F., Ed.; Cambridge University Press: Cambridge, UK, 1993; pp. 103–119. [Google Scholar]
- Huber, M. On the Cameron Praeger conjecture. J. Comb. Theory Ser. A 2010, 117, 196–203. [Google Scholar] [CrossRef] [Scilit]
- Beth, T.; Jungnickel, D.; Lenz, H. Design Theory, 2nd ed.; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
- Kantor, W.M. K-homogeneous groups. Math. Z. 1972, 124, 261–265. [Google Scholar] [CrossRef] [Scilit]
- Xu, X.; Zhang, J. 3-Homogeneous Groups and 5-(v,k,3) Designs. Math. Theory Appl. 2012, 32, 5–11. [Google Scholar]
© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).



