交错群与旗传递点本原非对称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.     

旗传递点本原且基柱为${\rm PSL}_n(q)$的$(v,k,4)$-对称设计

若$\cal D$为一个非平凡旗传递点本原对称$(v,k,4)$设计, 其基柱为${\rm PSL}_n(q)$且$G\leq {\rm Aut}(\cal D)$. 那么, $\cal D$ 必为$2$-$(15,8,4)$设计且${\rm Soc}(G)={\rm PSL}_2(9)$.     

自同构群基柱为~3D_4(q)的2-(v,k,1)设计

2-(v,k,1)设计的存在性问题是组合设计理论中重要的问题,当这类设计具有一个有意义自同构群时,讨论其存在性是尤其令人感兴趣的.30年前,一个6人团队基本上完成了旗传递的2-(v,k,1)设计分类.此后,人们开始致力于研究区传递但非旗传递的2-(v,k,1)设计的分类课题.本文证明了自同构群基柱为~3D_4(q)的区传递及点本原非旗传递的2-(v,k,1)设计是不存在的.     

一类仿射型本原群与4-(v,k,2)设计

本文证明了若群G旗传递地作用于4-(v,k,2)设计,且G是仿射型群,则SL(ad,pa)G0,这里v=pd,a|d,0是p元域上的d维向量空间的零向量。     

点数不超过20的旗传递非对称2-设计

本文研究了旗传递点数不大于20的2-(v,k,λ)设计的分类,证明了当(r,λ)=1时,在同构意义下只存在18个这样的设计.     

以PSL(2,q)作为本原自同构群的旗传递对称$(v,k,\lambda)$设计的分类

设$D$是一个非平凡的对称$(v,k,\lambda)$设计, $G$是$D$的一个自同构群.本文证明了如果$G$以二维典型群PSL$(2,q)$作为基柱且在$D$上的作用是旗传递和点本原的,那么设计$D$的参数只能为$(7, 3, 1)$, $(7, 4, 2)$, $(11, 5, 2)$, $(11, 6, 3)$或$(15, 8, 4)$.     

3-齐次群与旗传递5-（v，k，3）设计

旗传递t-设计的分类是代数组合学的一个重要课题．本文主要讨论了旗传递5-（v,k,3）设计．由P．J．Cameron和C．E．Praeger的结论可知,此时设计的自同构群是3-齐次群．本文利用3-齐次群的分类,证明了设计的自同构群不能是仿射型群．     

区传递的2-(v,9,1)设计的分类

讨论区传递的2-(v,k,1)设计的分类问题.特别地,讨论自同构群的基柱为典型单群的区传递,点本原但非旗传递的2-(v,9,1)设计.设D为一个2-(v,9,1)设计,若G≤Aut(D)是区传递,点本原但非旗传递的,则G的基柱Soc(G)不是有限域GF(q)上的典型单群.结合Camina,Praeger,刘伟俊,李慧陵...     

例外Lie型单群与旗传递三平面

三平面也称为2-（v,k,3）对称设计.设D是一个三平面,且G是D的全自同构群Aut（D）的一个子群.本文证明了若G是旗传递和点本原的,则G的基柱不可能是例外Lie型单群.     

有限典型群和本原旗传递对称(v,k,5)设计

设D=(P,B)为具有旗传递点本原自同构群G的(v,k,5)对称设计.本文证明如果G是几乎单型的,那么G的基柱不能是有限典型群.     

A New Characterization of PSL(p,q)

Abstract

Order components of a finite group are introduced in Chen [Chen, G. Y. (1996c) On Thompson's conjecture. J. Algebra 185:184–193]. It was proved that PSL(3, q), where q is an odd prime power, is uniquely determined by its order components [Iranmanesh, A., Alavi, S. H., Khosravi, B. (2002a). A characterization of PSL(3, q) where q is an odd prime power. J. Pure Appl. Algebra 170(2–3): 243–254]. Also in Iranmanesh et al. [Iranmanesh, A., Alavi, S. H., Khosravi, B. (2002b). A characterization of PSL(3, q) where q = 2 ⁿ . Acta Math. Sinica, English Ser. 18(3):463–472] and [Iranmanesh, A., Alavi, S. H. (2002). A characterization of simple groups PSL(5, q). Bull. Austral. Math. Soc. 65:211–222] it was proved that PSL(3, q) for q = 2 ⁿ and PSL(5, q) are uniquely determined by their order components. In this paper we prove that PSL(p, q) can be uniquely determined by its order components, where p is an odd prime number. A main consequence of our results is the validity of Thompson's conjecture for the groups under consideration.     

Parametrization of Triangle Groups as Subgroups of PSL(2, q)

In this paper we are interested in triangle groups (j, k, l) where j = 2 and k = 3. The groups (j, k, l) can be considered as factor groups of the modular group PSL(2, Z) which has the presentation x, y : x² = y³ = 1. Since PSL(2,q) is a factor group of G^k,l,m if -1 is a quadratic residue in the finite field F_q, it is therefore worthwhile to look at (j, k, l) groups as subgroups of PSL(2, q) or PGL(2, q). Specifically, we shall find a condition in form of a polynomial for the existence of groups (2, 3, k) as subgroups of PSL(2, q) or PGL(2, q).Mathematics Subject Classification: Primary 20F05 Secondary 20G40.     

Flag-transitive point-primitive 2-（v,k,4） symmetric designs and two dimensional classical groups

Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ⊴ G ≤ Aut(X) where X ≅ PSL ₂(q). Then D is a 2-(15, 8, 4) symmetric design with X = PSL ₂(9) and X _x = PGL ₂(3) where x is a point of D.     

The existence of resolvable bibd with λ=1

Letk be any integer andk≥-3. In this article it is proved that the necessary conditionv≡k (modk(k−1)) for the existence of anRB(v,k,1) is sufficient wheneverv>exp{exp{k ^{12k 2} }}. This project is supported by the National Natural Science Foundation of China (No.19701002) and Huo Yingdong Foundation.     

Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4

A (2,3)-packing on X is a pair (X,), where is a set of 3-subsets (called blocks) of X, such that any pair of distinct points from X occurs together in at most one block. For a (6k+5)-set X, an optimal partition of triples (denoted by OPT(6k+5)) is a set of 6k+3 optimal (2,3)-packings and a (2,3)-packing of size 8k+4 on X. Etzion conjectured that there exists an OPT(6k+5) for any positive integer k. In this paper, we construct such a system for any k≥1. This complete solution is based on the known existence results of S(3,4,v)s by Hanani and that of special S(3,{4,6},6m)s by Mills. Partitionable candelabra systems also play an important role together with an OPT(11) and a holey OPT(11). Research supported by Natural Science Foundation of Universities of Jiangsu Province under Grant 05KJB110111     

Some designs and codes invariant under the groups <Emphasis Type="Italic">S</Emphasis><Subscript>9</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>8</Subscript>

We examine some designs and binary codes constructed from the primitive permutation representations of the groups PSL ₂(8) and PSL ₂(9). For PSL ₂(8) of degree 36, we construct a design and its code with the automorphism groups PSL ₂(8) and S ₉, respectively. For PSL ₂(8) of degree 36 and PSL ₂(9) of degree 15, we construct some designs and its codes invariant under the groups S ₉ and A ₈, respectively. The weight distribution and the dual of these codes are determined. By considering the action of automorphism groups on some of these codes, we obtain the structure of the stabilizer for every codeword and construct some designs such that S ₉ or A ₈ act primitively on them.      

New pairs of -sequences with 4-level cross-correlation

Let ω be a primitive element of GF(2ⁿ), where . Let d=(2^2k+2^s+1-2^k+1-1)/(2^s-1), where n=2k, and s is such that 2s divides k. We prove that the binary m-sequences s(t)=tr(ω^t) and s(dt) have a four-level cross-correlation function and give the distribution of the values.     

On signed distance-k-domination in graphs

The signed distance-k-domination number of a graph is a certain variant of the signed domination number. If v is a vertex of a graph G, the open k-neighborhood of v, denoted by N _k (v), is the set N _k (v) = {u: u ≠ v and d(u, v) ⩽ k}. N _k [v] = N _k (v) ⋃ {v} is the closed k-neighborhood of v. A function f: V → {−1, 1} is a signed distance-k-dominating function of G, if for every vertex . The signed distance-k-domination number, denoted by γ _k,s (G), is the minimum weight of a signed distance-k-dominating function on G. The values of γ _2,s (G) are found for graphs with small diameter, paths, circuits. At the end it is proved that γ _2,s (T) is not bounded from below in general for any tree T.     

A note on triangle‐free quasi‐symmetric designs

Triangle‐free quasi‐symmetric 2‐ (v, k, λ) designs with intersection numbers x, y; 0<x<y<kand λ>1, are investigated. It is proved that λ?2y ? x ? 3. As a consequence it is seen that for fixed λ, there are finitely many triangle‐free quasi‐symmetric designs. It is also proved that: k?y(y ? x) + x. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:422‐426, 2011     

A Family of Finite Simple Groups Which Are 2-Recognizable by Their Elements Order

Abstract

Let G be a finite group and ω(G) the set of all orders of elements in G. Denote by h(ω(G)) the number of isomorphism classes of finite groups H satisfying ω(H) = ω(G), and put h(G) = h(ω(G)). A group G is called k-recognizable if h(G) = k < ∞ , otherwise G is called non-recognizable. In the present article we will show that the simple groups PSL(3, q), where q ≡ ±2(mod 5) and (6, (q ? 1)/2) = 2, are 2-recognizable. Therefore if q is a prime power and q ≡ 17, 33, 53 or 57 (mod 60), then the groups PSL(3, q) are 2-recognizable. Hence proving the existing of an infinite families of 2-recognizable simple groups.