Flag-transitive point-quasiprimitive 2-$$(v,\, k,\, 2)$$ designs

Let \(\mathcal {D}\) be a non-trivial 2-\((v,\,k,\,2)\) design. Assume that G is a flag-transitive and point-quasiprimitive automorphism group of \(\mathcal {D},\) then G is of holomorph affine or almost simple type.     

交错群与旗传递点本原非对称2-（v，k，3）设计

受旗传递2-(v,k,3)对称设计和非对称2-(v,k,2)设计有关分类结果的启发,本论文继续研究旗传递非对称2-(v,k,3)设计.文章利用置换群的理论和组合设计的数量性质,借助计算机代数软件Gap和Magma,完全分类了自同构群G旗传递点本原,且基柱Soc(G)为交错群An(n≥5)的非对称2-(v,k,3)设计,证明了此类设计只能是唯一的2-(5,3,3)设计,且G=A_5或S_5.     

Cycle structures of automorphisms of 2-(v,k,1) designs

An automorphism of a 2?(v,k, 1) design acts as a permutation of the points and as another of the blocks. We show that the permutation of the blocks has at least as many cycles, of lengths n > k, as the permutation of the points. Looking at Steiner triple systems we show that this holds for all n unless n|Cp(n)| ? 3, where Cp(n) is the set of cycles of length n of the automorphism in its action on the points. Examples of Steiner triple systems for each of these exceptions are given. Considering designs with infinitely many points, but with k finite, we show that these results generalize. © 1995 John Wiley & Sons, Inc.     

Steinberg triality groups acting on 2 - (v, k, 1) designs

A 2 - (v,k,1) design D = (P, B) is a system consisting of a finite set P of v points and a collection B of k-subsets of P, called blocks, such that each 2-subset of P is contained in precisely one block. Let G be an automorphism group of a 2- (v,k,1) design. Delandtsheer proved that if G is block-primitive and D is not a projective plane, then G is almost simple, that is, T ≤ G ≤ Aut(T), where T is a non-abelian simple group. In this paper, we prove that T is not isomorphic to 3D4(q). This paper is part of a project to classify groups and designs where the group acts primitively on the blocks of the design.     

Admissible parameters of symmetric designs satisfying v=4(k-\lambda )+2 and symmetric designs with inner balance

The admissible parameters of symmetric \((v,k,\lambda )\) designs satisfying \(v=4(k-\lambda )+2\) are shown to correspond with the solutions of a certain Pell equation. We then determine the feasible parameters of such designs that could have a quasi-symmetric residual design with respect to a block, and classify them into two possible families. Finally, we consider the feasible parameters of symmetric designs with inner balance as defined by Nilson and Heidtmann (Des. Codes Cryptogr. doi:10.1007/s10623-012-9730-2, (2012)), and show that (with one exception) they must all belong to one of these families.     

Flag-transitive 2-(v, k, λ) symmetric designs with (k, λ) = 1 and alternating socle

Consider the flag-transitive 2-(v, k, λ) symmetric designs with (k, λ) = 1. We prove that if {D} is a nontrivial 2-(v, k, λ) symmetric design with (k, λ) = 1 and G≤Aut({D}) is flag-transitive with Soc(G) = A_n for n≥5, then {D} is the projective space PG₂(3,2) and G = A₇.     

SUZUKI GROUPS Sz（q） AND 2-（v,k, 1） BLOCK DESIGNS

It is proved that if D be a 2-(v,k,1) design with G≤Aut D block primitive then G does not have a Suzuki group Sz(q) as the socle.     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

区传递的2-（v，k，1）设计与射影辛群PSpn（q）

分类自同构群为射影辛群PSpn(q)的区传递2-(v,k,1)设计,得到如下定理:设D为一个2-(v,k,1)设计,G≤Aut(D)是区传递,点本原但非旗传递的.若q为偶数且n≥14,则GPSpn(q).     

Flag-Transitive 3-(v,k, 3) Designs and PSL(2, q) Groups

This article is a contribution to the study of the automorphism groups of 3-(v,k,3) designs.Let S =(P,B) be a non-trivial 3-(q+ 1,k,3) design.If a two-dimensional projective linear group PSL(2,q) acts flag-transitively on S,then S is a 3-(q + 1,4,3) or 3-(q + 1,5,3) design.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

典型群PSU(3,q~2)与2-(v,k,1)设计

讨论自同构群是酉群 PSU(3 ,q2 ) (q=2 l)的区 -本原的 2 -(v,k,1 )设计 .首先证明了它必是点 -本原的 ,然后确定了这种类型的设计 ,即它只能为 2 -(q3+1 ,q+1 ,1 )设计     

^2F4（q2）与2-（v，k，3）对称设计

本文要证明不存在一个非平凡2-（v，k，3）对称设计，它的旗传递自同构群的基柱是^2F4（q2）