Directed PBDs with Block Sizes from K Where K

The research on directed PBDs is motivated by the construction of t‐deletion/insertion‐correcting codes. Fuji‐Hara, Miao, Wang, and Yin have determined the existence of directed PBDs with block sizes from the set and the set completely. In this paper, we consider the cases of . We settle almost completely for these cases, leaving finite values undetermined.     

On the Existence of Simple BIBDs with Number of Elements a Prime Power

We show that, when the number of elements is a prime power q, in many situations the necessary conditions

相似文献   

Group Divisible Designs with Block Size Four and Group Type for

Nonuniform group divisible designs (GDDs) have been studied by numerous researchers for the past two decades due to their essential role in the constructions for other types of designs. In this paper, we investigate the existence problem of ‐GDDs of type for . First, we determine completely the spectrum of ‐GDDs of types and . Furthermore, for general cases, we show that for each and , a ‐GDD of type exists if and only if , and , except possibly for , and .     

Constructing difference families through an optimization approach: Six new BIBDs

In this paper we formulate the construction of difference families as a combinatorial optimization problem. A tabu search algorithm is used to find an optimal solution to the optimization problem for various instances of difference families. In particular, we construct six new difference families which lead to an equal number of new balanced incomplete block designs with parameters: (49, 98, 18, 9, 3), (61, 122, 20, 10, 3), (46, 92, 20, 10, 4), (45, 90, 22, 11, 5), (85, 255, 24, 8, 2) and (34, 85, 30, 12, 10). © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 261–273, 2000     

The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3

A generalized balanced tournament design, GBTD(n, k), defined on a kn-set V, is an arrangement of the blocks of a (kn, k, k – 1)-BIBD defined on V into an n × (kn – 1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. Suppose we can partition the columns of a GBTD(n, k) into k + 1 sets B1, B2,..., Bk + 1 where |Bi| = n for i = 1, 2,..., k – 2, |Bi| = n–1 for i = k – 1, k and |Bk+1| = 1 such that (1) every element of V occurs precisely once in each row and column of Bi for i = 1, 2,..., k – 2, and (2) every element of V occurs precisely once in each row and column of Bi Bk+1 for i = k – 1 and i = k. Then the GBTD(n, k) is called partitioned and we denote the design by PGBTD(n, k). The spectrum of GBTD(n, 3) has been completely determined. In this paper, we determine the spectrum of PGBTD(n,3) with, at present, a fairly small number of exceptions for n. This result is then used to establish the existence of a class of Kirkman squares in diagonal form.     

Semiframes with Block Size Three and Odd Group Size

A ‐semiframe of type is a ‐GDD of type , , in which the collection of blocks can be written as a disjoint union where is partitioned into parallel classes of and is partitioned into holey parallel classes, each holey parallel class being a partition of for some . A ‐SF is a ‐semiframe of type in which there are p parallel classes in and d holey parallel classes with respect to . In this paper, we shall show that there exists a (3, 1)‐SF for any if and only if , , , and .     

区组长为奇素数的自反MD设计

本文利用差方法对自反MD设计SCMD(4mp,p,1)的存在性给出了构造性证明,这里p为奇素数,m为正整数．     

Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

We prove the existence of a cyclic (4p, 4, 1)-BIBD—and hence, equivalently, that of a cyclic (4, 1)-GDD of type 4 ^p —for any prime such that (p–1)/6 has a prime factor q not greater than 19. This was known only for q=2, i.e., for . In this case an explicit construction was given for . Here, such an explicit construction is also realized for .We also give a strong indication about the existence of a cyclic (4p 4, 1)-BIBD for any prime , p>7. The existence is guaranteed for p>(2q ³–3q ²+1)²+3q ² where q is the least prime factor of (p–1)/6.Finally, we prove, giving explicit constructions, the existence of a cyclic (4, 1)-GDD of type 6 ^p for any prime p>5 and the existence of a cyclic (4, 1)-GDD of type 8 ^p for any prime . The result on GDD's with group size 6 was already known but our proof is new and very easy.All the above results may be translated in terms of optimal optical orthogonal codes of weight four with =1.     

Balanced Incomplete Block Designs with Block Size 7

The object of this paper is the construction of balanced incomplete block designs with k=7. This paper continues the work begun by Hanani, who solved the construction problem for designs with a block size of 7, and with =6, 7, 21 and 42. The construction problem is solved here for designs with > 2 except for v=253, = 4,5 ; also for = 2, the number of unconstructed designs is reduced to 9 (1 nonexistent, 8 unknown).     

A construction of balanced arrays of strengtht and some related incomplete block designs

Summary Saha [6] has shown the equivalence between a ‘tactical system’ (or at-design) and a 2-symbol balanced array (BA) of strengtht. The implicit method of construction of BA in that paper has been generalized herein to that of ans-symbol BA of strengtht. Some BIB and PBIB designs are also constructed from these arrays. Majindar [2], Vanstone [8] and Saha [6] have all shown that the existence of a symmetrical BIBD forv treatments implies the existence of six more BIBD's forv treatments in (v/2) blocks. An analogue of this result has been obtained for a large class of PBIB designs in this paper.     

Existence of directed GDDs with block size five

In this article, we construct directed group divisible designs (DGDDs) with block size five, group-type hⁿ, and index unity. The necessary conditions for the existence of such a DGDD are n ≥ 5, (n − 1)h ≡ 0 (mod 2) and n(n − 1)h² ≡ 0 (mod 10). It is shown that these necessary conditions are also sufficient, except possibly for n = 15 where h ≡ 1 or 5 (mod 6) and h ≢ 0 (mod 5), or (n, h) = (15, 9). © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 389–402, 1998     

Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups

We show that if G is a finite Abelian group and the block size is 3, then the necessary conditions for the existence of a (v,3,λ;G) GBRD are sufficient. These necessary conditions include the usual necessary conditions for the existence of the associated (v,3,λ) BIBD plus λ≡ 0 (mod|G|), plus some extra conditions when |G| is even, namely that the number of blocks be divisible by 4 and, if v = 3 and the Sylow 2-subgroup of G is cyclic, then also λ≡ 0 (mod2|G|).     

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.     

Old and new designs via difference multisets and strong difference families

Let X =((x_1,1,x_1,2,…,x_1,k),(x_2,1,x_2,2,…,x_2,k),…,(x_t,1,x_t,2,…,x_t,k)) be a family of t multisets of size k defined on an additive group G. We say that X is a t-(G,k,μ) strong difference family (SDF) if the list of differences (x_h,i-x_h,j∣h=1,…,t;i≠ j) covers all of G exactly μ times. If a SDF consists of a single multiset X, we simply say that X is a (G,k,μ) difference multiset. After giving some constructions for SDF's, we show that they allow us to obtain a very useful method for constructing regular group divisible designs and regular (or 1-rotational) balanced incomplete block designs. In particular cases this construction method has been implicitly used by many authors, but strangely, a systematic treatment seems to be lacking. Among the main consequences of our research, we find new series of regular BIBD's and new series of 1-rotational (in many cases resovable) BIBD's.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.     

Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m

In this paper, we continue to investigate the spectrum for {4}-GDDs of type g^u m¹ with m as small as possible. We determine, for each admissible pair (g,u), the minimum values of m for which a {4}-GDD of type g^um¹ exists with four possible exceptions.Gennian Ge-Researcher supported by NSFC Grant 10471127.Alan C. H. Ling-Researcher supported by an ARO grant 19-01-1-0406 and a DOE grant.classification Primary 05B05     

Decomposable super‐simple NRBIBDs with block size 4 and index 6

Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.     

Recursive constructions for difference matrices and relative difference families

We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n₁, n₂, …, n_t) there exists a (G, p^e, 1) difference matrix with e = Also, we prove that for any group G there exists a (G, p, 1) difference matrix where p is the smallest prime dividing |G|. Difference matrices are then used for constructing, recursively, relative difference families. We revisit some constructions by M. J. Colbourn, C. J. Colbourn, D. Jungnickel, K. T. Phelps, and R. M. Wilson. Combining them we get, in particular, the existence of a multiplier (G, k, λ)-DF for any Abelian group G of nonsquare-free order, whenever there exists a (p, k, λ)-DF for each prime p dividing |G|. Then we focus our attention on a recent construction by M. Jimbo. We improve this construction and prove, as a corollary, the existence of a (G, k, λ)-DF for any group G under the same conditions as above. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 165–182, 1998