Incomplete Group Divisible Designs with Block Size Four and General Index

In this paper, we investigate the existence of incomplete group divisible designs （IGDDs） with block size four, group-type （g, h） u and general index λ. The necessary conditions for the existence of such a design are that u ≥ 4, g ≥ 3h, λg（u 1） ≡ 0 （mod 3）, λ（g h）（u 1） ≡ 0 （mod 3）, and λu（u 1）（g 2 h 2 ） ≡ 0 （mod 12）. These necessary conditions are shown to be sufficient for all λ≥ 2. The known existence result for λ = 1 is also improved.

Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs

In an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In this paper some constructions of anonymous secret sharing schemes with 2 thresholds by using combinatorial designs are given. Let v（t, w, q） denote the minimum size of the set of shares of a perfect anonymous （t, w） threshold secret sharing scheme with q secrets. In this paper we prove that v（t, w, q） - Θ（q） if t and w are fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.

Super-simple （5, 4）-GDDs of group type g^u

In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super- simple group divisible designs are useful in constructing other types of super- simple designs which can be applied to codes and designs. In this article, the existence of a super-simple （5, 4）-GDD of group type gU is investigated and it is shown that such a design exists if and only if u ≥ 5, g（u - 2） ≥ 12, and u（u - 1）g^2≡ 0 （mod 5） with some possible exceptions.

Frame Self-orthogonal Mendelsohn Triple Systems

A Mendelsohn triple system of order v,MTS(v)for short,is a pair(X,B)where X is a v-set(of points)and B is a collection of cyclic triples on X such that every ordered pair of distinct points from X appears in exactly one cyclic triple of B.The cyclic triple(a,b,c)contains the ordered pairs(a,b),(b,c)and(c,a).An MTS(v)corresponds to an idempotent semisymmetric Latin square (quasigroup)of order v.An MTS(v)is called frame self-orthogonal,FSOMTS for short,if its associated semisymmetric Latin square is frame self-orthogonal.It is known that an FSOMTS(1~n)exists for all n≡1(mod 3)except n=10 and for all n≥15,n≡0(mod 3)with possible exception that n=18.In this paper,it is shown that(i)an FSOMTS(2~n)exists if and only if n≡0,1(mod 3)and n>5 with possible exceptions n ∈{9,27,33,39};(ii)an FSOMTS(3~n)exists if and only if n≥4,with possible exceptions that n ∈{6,14,18,19}.

Existence of Three HMOLS of Type 2~nu^1

A Latin squares of order v with ni missing sub-Latin squares （holes） of order hi （1 〈= i 〈 k）, which are disjoint and spanning （i.e. ∑k i=l1 nihi = v）, is called a partitioned incomplete Latin squares and denoted by PILS. The type of PILS is defined by （h1n1 h2n2…hknk ）. If any two PILS inaset of t PILS of type T are orthogonal, then we denote the set by t-HMOLS（T）. It has been proved that 3-HMOLS（2n31） exist for n ≥6 with 11 possible exceptions. In this paper, we investigate the existence of 3-HMOLS（2nu1） with u ≥ 4, and prove that 3-HMOLS（2~u1） exist if n ≥ 54 and n ≥7/4u ＋ 7.

CONSTRUCTING SELF-CONJUGATE SELF-ORTHOGONAL DIAGONAL LATIN SQUARES

In this paper, we give some constructions of self-conjugate self-orthogonal diagonal Latinsquares (SCSODLS). As an application of such constructions we disproof the conjecture aboutSCSODLS and show that there exist SCSODLS of order V, whenever w=1 (mod 12), with thepossible exception of v∈ {13, 85, 133}.