On the Existence of

Let there is an . For or , has been determined by Hanani, and for or , has been determined by the first author. In this paper, we investigate the case . A necessary condition for is . It is known that , and that there is an for all with a possible exception . We need to consider the case . It is proved that there is an for all with an exception and a possible exception , thereby, .     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

On the 3BD‐closed set B3({4,5,6})

Let B₃(K) = {v:? an S(3,K,v)}. For K = {4} or {4,6}, B₃(K) has been determined by Hanani, and for K = {4, 5} by a previous paper of the author. In this paper, we investigate the case of K = {4,5,6}. It is easy to see that if v ∈ B₃ ({4, 5, 6}), then v ≡ 0, 1, 2 (mod 4). It is known that B₃{4, 6}) = {v > 0: v ≡ 0 (mod 2)} ? B₃({4,5,6}) by Hanani and that B₃({4, 5}) = {v > 0: v ≡ 1, 2, 4, 5, 8, 10 (mod 12) and v ≠ 13} ? B₃({4, 5, 6}). We shall focus on the case of v ≡ 9 (mod 12). It is proved that B₃({4,5,6}) = {v > 0: v ≡ 0, 1, 2 (mod 4) and v ≠ 9, 13}. © 2003 Wiley Periodicals, Inc.     

Group divisible 3‐designs with block size four and group type 1ns1

In this article, we mainly consider the existence problem of a group divisible design GDD $\left(3,4,n+s\right)$ of type $1^n{s}^1$. We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD $\left(3,4,n+s\right)$s of type $1^n{s}^1$ are produced. Meanwhile a few new infinite families on candelabra quadruple systems with group sizes being odd and stem size greater than one are also obtained.     

More results on perfect (3,3,6k + 4; 6k − 2)‐threshold schemes

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. Its leave is a graph (X,E) such that E consists of all the pairs which do not appear in any block of . In this article, we shall construct a set of 6k ? 2 disjoint (2,3)‐packings of order 6k + 4 with K_1,3 ∪ 3kK₂ or G₁ ∪ (3k ? 1)K₂ as their common leave for any integer k ≥ 1 with a few possible exceptions (G₁ is a special graph of order 6). Such a system can be used to construct perfect threshold schemes as noted by Schellenberg and Stinson ( 22 ). © 2006 Wiley Periodicals, Inc. J Combin Designs     

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.     

A S(3, {4, 6}, 18) with a subdesign S(3, 4, 8) does not exist

For , a S(t,K,v) design is a pair, , with |V| = v and a set of subsets of V such that each t‐subset of V is contained in a unique and for all . If , , , and is a S(t,K,u) design, then we say has a subdesign on U. We show that a S(3,{4,6},18) design with a subdesign S(3,4,8) does not exist. © 2007 Wiley Periodicals, Inc. J Combin Designs 17: 36–38, 2009     

A complete solution to existence of H designs

An H design is a triple , where is a set of points, a partition of into disjoint sets of size , and a set of ‐element transverses of , such that each ‐element transverse of is contained in exactly one of them. In 1990, Mills determined the existence of an H design with . In this paper, an efficient construction shows that an H exists for any integer with . Consequently, the necessary and sufficient conditions for the existence of an H design are , , and , with a definite exception .     

Existence of large sets of disjoint group‐divisible designs with block size three and type 2n41

Large sets of disjoint group‐divisible designs with block size three and type 2ⁿ4¹ (denoted by LS (2ⁿ4¹)) were first studied by Schellenberg and Stinson and motivated by their connection with perfect threshold schemes. It is known that such large sets can exist only for n ≡ 0 (mod 3) and do exist for any n ? {12, 36, 48, 144} ∪ {m > 6 : m ≡ 6,30 (mod 36)}. In this paper, we show that an LS (2^{12k + 6}4¹) exists for any k ≠ 2. So, the existence of LS (2ⁿ4¹) is almost solved with five possible exceptions n ∈ {12, 30, 36, 48, 144}. This solution is based on the known existence results of S (3, 4, v)s by Hanani and special S (3, {4, 6}, 6m)s by Mills. Partitionable H (q, 2, 3, 3) frames also play an important role together with a special known LS (2¹⁸4¹) with a subdesign LS (2⁶4¹). © 2004 Wiley Periodicals, Inc.     

Some New Infinite Classes of Candelabra Quadruple Systems

Candelabra quadruple systems (CQS) were first introduced by Hanani who used them to determine the existence of Steiner quadruple systems. In this paper, a new method has been developed by constructing partial candelabra quadruple systems with odd group size, which is a generalization of the even cases, to complete a design. New results of candelabra quadruple systems have been obtained, i.e. we show that for any , there exists a CQS for all , and .     

Extending AG(4, 2) to S(4, {5, 6}, 17)

A construction of S(4, {5, 6}, 17) is given using the geometry of AG(4, 2) and PG(3, 2). © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 113–117, 1999     

Directed B(K, 1; v) with K = {4, 5} and {4, 6} related to deletion/insertion‐correcting codes

Motivated by the construction of t‐deletion/insertion‐correcting codes, we consider the existence of directed PBDs with block sizes from K = {4, 5} and {4, 6}. The spectra of such designs are determined completely in this paper. For any integer {υ ≥ 4, a DB({4,5} ,1; υ) exists if and only if υ∉{6, 8, 9, 12, 14}, and a DB({4, 6}, 1; υ) exists if and only if υ ≡ 0,1 mod 3 and υ∉{9,15}. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 147–156, 2001     

最优(v,{3,4},1,Q)-光正交码的构造

在光纤码分多址(OCDMA)系统中,变重量光正交码被广泛使用,以满足多种服务质量的需求.利用分圆类和斜starter给出了直接构造方法,借助有关循环差阵的递归构造方法,从而构造了两类循环填充设计.通过建立循环填充设计与变重量光正交码之间的联系,证明了当Q∈{{2/3,1/3},{3/4,1/4}}时,最优(v,{3,4},1,Q)-光正交码存在的无穷类.     

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

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

Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with {Q \in \{(\frac {1}{3}, \frac {2}{3}), (\frac {2}{3}, \frac{1}{3})\}}

Variable-weight optical orthogonal code (OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service requirements. It is proved that optimal (v, {3, 4}, 1, (1/2, 1/2))-OOCs exist for some complete congruence classes of v. In this paper, for ${Q \in \{(1/3, 2/3), (2/3, 1/3)\}}$ , by using skew starters, it is also proved that optimal (v, {3, 4}, 1, Q)-OOCs exist for some complete congruence classes of v.     

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.     

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     

Existence of 3‐chromatic Steiner quadruple systems

A Steiner quadruple system of order v (briefly SQS (v)) is a pair (X, ), where X is a v‐element set and is a set of 4‐element subsets of X (called blocks or quadruples), such that each 3‐element subset of X is contained in a unique block of . The chromatic number of an SQS(v)(X, ) is the smallest m for which there is a map such that for all , where . The system (X, ) is equitably m‐chromatic if there is a proper coloring with minimal m for which the numbers differ from each other by at most 1. Linek and Mendelsohn showed that an equitably 3‐chromatic SQS(v) exists for v ≡ 4, 8, 10 (mod 12), v ≥ 16. In this article we show that an equitably 3‐chromatic SQS(v) exists for v ≡ 2 (mod 12) with v > 2. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 469–477, 2007     

P3BD‐closed sets

A concept called P3BD‐closed set is introduced to describe a set of positive integers which is both PBD‐closed and 3BD‐closed. The theory of P3BD‐closure is developed and a few examples of P3BD‐closed sets are exhibited. In the process, the existence spectrum of OLIQ ^?s (overlarge sets of idempotent quasigroups with their own idempotent orthogonal mates) is almost determined. A pair of orthogonal OLIQ ^?s is shown to asymptotically exist. The existence of OLIQ s (overlarge sets of idempotent quasigroups with their own orthogonal mates not necessarily specifying idempotency) is also established with only 10 possible exceptions remained. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:407‐421, 2011