Existence of (2, 8) GWhD( v) and (4, 8) GWhD( v) with $${ v \equi v 0,1 (mod 8)}$$

(2, 8) Generalized Whist tournament Designs (GWhD) on v players exist only if . We establish that these necessary conditions are sufficient for all but a relatively small number of (possibly) exceptional cases. For there are at most 12 possible exceptions: {177, 249, 305, 377, 385, 465, 473, 489, 497, 537, 553, 897}. For there are at most 98 possible exceptions the largest of which is v = 3696. The materials in this paper also enable us to obtain four previously unknown (4, 8)GWhD(8n+1), namely for n = 16,60,191,192 and to reduce the list of unknown (4, 8) GWhD(8n) to 124 values of v the largest of which is v = 3696.      

带两洞的不完全自正交拉丁方的存在性

讨论不完全自正交拉丁方ISOLS(v;3,3)的存在性问题.证明当v≥12,v{13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,33,35,36}时,存在ISOLS(v;3,3).     

EXISTENCE OF INDECOMPOSABLE AND SIMPLE BLOCK DESIGN B(5,4;v)

It is proved that there exists an indecomposable and simple block design B(5,4;v) if and only if v = 0 or l(mod5) and v \geq 6.     

(v,k, λ)-Graphs and polarities of (v,k, λ)-designs

In 2.1 it is established that there is a one-to-one correspondence between (v, k, )-graphs and polarities, with no absolute points, of (v, k, )-designs. This is used to show that the parameters of a (v, k, )-graph are of the form ((s/a)((s + a)²–1), s(s+a), sa) where s and a are positive integers with a dividing s(s²–1) (Theorem 3.4) but strictly less than s(s²–1) (Proposition 4.3). Some consequences of this parametrization are discussed and in particular, it is shown that for fixed 2 there are only finitely many non-isomorphic (v, k, )-graphs. In 4. it is shown that (v, k, )-graphs can also be constructed using polarities, with all points absolute, of certain designs. In 5. isomorphisms and automorphisms of graphs and designs are discussed. Many examples of (v, k, )-graphs, including some apparently new ones, are given.Dedicated to Peter Dembowski, 28 January 1971     

单纯正交表OA$_\lambda(3, 5, v)$的存在性

An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.     

Eine Klasse spezieller gemischter Ovale in STS(v)

At first in the case v=7, 15+12IN a new class of ovals in STS(v) is defined and then Steiner Triple Systems with these ovals are really constructed.     

完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

(ε v q)-fuzzy subgroup

The definition of an (ε, ε v q)-fuzzy subgroup is slightly modified and some of the fundamental properties of such fuzzy subgroups are obtained.     

2—（v,7,1） 设计的可解区传递自同构群

设G是一个2－（v,7,1)设计的可解区传递自同构群,则G是点－本原,且下列之一成立：（1）v=7^n,G是旗－传递的;（2）v=5^6,G=Z5^6:H,这里H是GL（6,5）的可解且不可约的子群;（3）v=p^n,P≤ALT(1,p^n)。特别地,p≠2且p^n≡1(mod42)。     

The Existence of （v, 4, 1） Disjoint Difference Families with v a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.     

On the greatest number of 2 and 3 colorings of a (v,e)-graph

Let F denote the family of simple undirected graphs on v vertices having e edges ((v, e)-graphs) and P(λ, G) be the chromatic polynomial of a graph G. For the given integers v, e, Δ, let f(v, e, Δ) denote the greatest number of proper colorings in Δ or less colors that a (v, e)-graph G can have, i.e., f(v, e, Δ) = max{P(Δ, G): G ∈ F}. In this paper we determine f(v, e, 2) and describe all graphs G for which P(2, G) = f(v, e, 2). For f(v, e, 3), a lower bound and an upper bound are found.     

2-(v,6,1)设计的可解区传递自同构群

设G是一个2-（v,6,1）设计的可解区传递自同构群,且G非旗传递,则：（1）v＝91,G=Z91×Zd,这里3|d|12;（2）v=pm,G≤AL（1,pm）,之一成立．其中p≠2．当p＝3时,4|m见且m＞4;当p＞5时,pm≡1（mod30）。     

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.     

自同构群基柱为~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)设计是不存在的.     

Group theory for tetraammineplatinum(II) withC 2v andC 4v point group in the non-rigid system

The non-rigid molecule group theory (NRG) in which the dynamical symmetry operations are defined as physical operations is a new field of chemistry. Smeyers in a series of papers applied this notion to determine the character table of restricted NRG of some molecules. In this work, a simple method is described, by means of which it is possible to calculate character tables for the symmetry group of molecules consisting of a number of NH3 groups attached to a rigid framework. We study the full non-rigid group (f-NRG) of tetraammineplatinum (II) with two separate symmetry groups C2v and C4v. We prove that they are groups of order 216 and 5184 with 27 and 45 conjugacy classes, respectively. Also, we will compute the character tables of these groups.     

Existence of a-fold Perfect （v, {5, 8}, 1）-Mendelsohn Designs

Let v be a positive integer and let K be a set of positive integers. A （v, K, 1）-Mendelsohn design, which we denote briefly by （v, K, 1）-MD, is a pair （X, B） where X is a v-set （of points） and B is a collection of cyclically ordered subsets of X （called blocks） with sizes in the set K such that every ordered pair of points of X are consecutive in exactly one block of B. If for all t =1, 2,..., r, every ordered pair of points of X are t-apart in exactly one block of B, then the （v, K, 1）-MD is called an r-fold perfect design and denoted briefly by an r-fold perfect （v, K, 1）-MD. If K = {k） and r = k - 1, then an r-fold perfect （v, （k）, 1）-MD is essentially the more familiar （v, k, 1）-perfect Mendelsohn design, which is briefly denoted by （v, k, 1）-PMD. In this paper, we investigate the existence of 4-fold perfect （v, （5, 8}, 1）-Mendelsohn designs.     

Decompositions of the 3-uniform hypergraphs K(3)v into hypergraphs of a certain type

In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K(3)v into a special kind of hypergraph K(3)4 - e exists if and only if v ≡ 0, 1, 2 (mod 9) and v ≥ 9.     

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

Suzuki群Sz(q)与2-(v,k,1)区组设计

§ 1　IntroductionA2 -( v,k,1 ) design D=( Ω,B) is a system consisting of a finite setΩ ofv points anda collection Bofk-subsets ofΩ ,called blocks,such thatany 2 -subsetofΩ is contained inexactly one block.We shall always assume that2 相似文献   

(? ε v q)-fuzzy subgroup

The definition of an (?, ? v q)-fuzzy subgroup is slightly modified and some of the fundamental properties of such fuzzy subgroups are obtained.