The Existence of BIB Designs

Abstract Given any positive integers k≥ 3 and λ, let c(k, λ) denote the smallest integer such that v∈B(k, λ) for every integer v≥c(k, λ) that satisfies the congruences λv(v− 1) ≡ 0(mod k(k− 1)) and λ(v− 1) ≡ 0(mod k− 1). In this article we make an improvement on the bound of c(k, λ) provided by Chang in [4] and prove that . In particular, . Supported by NSFC Grant No. 19701002 and Huo Yingdong Foundation     

The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ > 1

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λ v(v − 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far from conclusive, especially for the case of λ = 1, which was given some attention in papers by Miao and Zhu [34], and subsequently by Abel et al. [1]. Here we investigate the situation for k = 6 and λ > 1. We find that the necessary conditions, namely v ≥ 6 and λ v(v − 1)≡0 (mod 6) are sufficient except for the known impossible cases v = 6 and either λ = 2 or λ odd. Researcher F.E. Bennett supported by NSERC Grant OGP 0005320.     

Two classes of optimal two-dimensional OOCs

Let Φ(u × v, k, λ _a , λ _c ) denote the largest possible size among all 2-D (u × v, k, λ _a , λ _c )-OOCs. In this paper, the exact value of Φ(u × v, k, λ _a , k − 1) for λ _a = k − 1 and k is determined. The case λ _a = k − 1 is a generalization of a result in Yang (Inform Process Lett 40:85–87, 1991) which deals with one dimensional OOCs namely, u = 1.     

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.     

The Spectrum of Tetrahedral Quadruple Systems

An ordered analogue of quadruple systems is tetrahedral quadruple systems. A tetrahedral quadruple system of order v and index λ, TQS(v, λ), is a pair (S, T){(S, \mathcal{T})} where S is a finite set of v elements and T{\mathcal{T}} is a family of oriented tetrahedrons of elements of S called blocks, such that every directed 3-cycle on S is contained in exactly λ blocks of T{\mathcal{T}} . When λ = 1, the spectrum problem of TQS(v, 1) has been completely determined. It is proved that a TQS(v, λ) exists if and only if λ(v − 1)(v − 2) ≡ 0 (mod 3), λv(v − 1)(v − 2) ≡ 0 (mod 4) and v ≥ 4.     

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|).     

On K 1,k -factorization of bipartite multigraphs

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.     

A new class of splitting 3-designs

Splitting t-designs were first formulated by Huber in recent investigation of optimal (t − 1)-fold secure splitting authentication codes. In this paper, we investigate the construction and existence of splitting t-designs t-(v, u × k, 1) splitting designs and, show that there exists a 3-(v, 3 × 2, 1) splitting design if and only if v ≡ 2 (mod 8). As its application, we obtain a new infinite class of optimal 2-fold secure splitting authentication codes.     

On vertex-coloring edge-weighting of graphs

A k-edge-weighting w of a graph G is an assignment of an integer weight, w(e) ∈ {1,…,k}, to each edge e. An edge-weighting naturally induces a vertex coloring c by defining c(u) = Σ _e∋u w(e) for every u ∈ V (G). A k-edge-weighting of a graph G is vertex-coloring if the induced coloring c is proper, i.e., c(u) ≠ c(v) for any edge uv ∈ E(G). When k ≡ 2 (mod 4) and k ⩾ 6, we prove that if G is k-colorable and 2-connected, δ(G) ⩾ k − 1, then G admits a vertex-coloring k-edge-weighting. We also obtain several sufficient conditions for graphs to be vertex-coloring k-edge-weighting.      

Further results on overlarge sets of Kirkman triple systems

In this paper, we introduce a new concept -- overlarge sets of generalized Kirkman systems （OLGKS）, research the relation between it and OLKTS, and obtain some new results for OLKTS. The main conclusion is： If there exist both an OLKF（6^k） and a 3-OLGKS（6^k-1,4） for all k ∈{6,7,...,40}／{8,17,21,22,25,26}, then there exists an OLKTS（v） for any v ≡ 3 （mod 6）, v ≠ 21. As well, we obtain the following result： There exists an OLKTS（6u ＋ 3） for u = 2^2n-1 - 1, 7^n, 31^n, 127^n, 4^r25^s, where n ≥ 1,r＋s≥ 1.     

A New Class of Optimal 3-splitting Authentication Codes

The necessary condition for the existence of a (ν, 3× 3,1)-splitting BIBD is ν ≡ 1 (mod 54). In this paper, we show that the necessary condition is also sufficient with one possible exception of ν = 55. As its application, we obtain a new infinite class of optimal 3-splitting authentication codes. AMS Classification: 05B05, 94A62 An erratum to this article is available at .     

P4k?1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k − 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k−1-factorization of λK _m,n is (1) (2k − 1)m ⩽ 2kn, (2) (2k − 1)n ⩽ 2km, (3) m + n ≡ 0 (mod 4k − 1), (4) λ(4k − 1)mn/[2(2k − 1)(m + n)] is an integer.     

On the embeddings of mendelsohn triple systems

It is proved in this paper that there exists an incomplete Mendelsohn triple system IMTS(u,v; λ) if and only ifλ(u-v)(u-2v-1)≡0(mod 3),u≥2v+1 and (u, v, λ) ≠ (6, 1, 1). As a consequence, it is proved that for any given λ≥1, a Mendelsohn triple system MTS (v, λ) can be embedded in an MTS (u, λ) if and only ifλu(u-1)≡0(mod 3) andu≥2v+1. Project supported by the National Natural Science Foundation of China.     

On the existence of nearly Kirkman triple systems with subsystems

It is proved in this paper that the necessary and sufficient conditions for the existence of an incomplete nearly Kirkman triple system INKTS(u, v) are u ≡ v ≡ 0 (mod 6), u ≥ 3v. As a consequence, we obtain a complete solution to the embedding problem for nearly Kirkman triple systems.      

Resolvable BIBDs with block size 8 and index 7

The necessary conditions for the existence of a resolvable BIBD RB(k,λ; v) are λ(v ? 1) = 0(mod k ? 1) and v = 0(mod k). In this article, it is proved that these conditions are also sufficient for k = 8 and λ = 7, with at most 36 possible exceptions. © 1994 John Wiley & Sons, Inc.     

A bound for Wilson's theorem (II)

In this article we prove the following theorem. For any k ≥ 3, let c(k, 1) = exp{exp{k^k2}}. If v(v − 1) ≡ 0 (mod k(k −1)) and v − 1 ≡ 0 (mod k−1) and v > c(k, 1), then a B(v,k, 1) exists. © 1996 John Wiley & Sons, Inc.     

-Decompositions of and D v ∪P where P is a 2-Regular Subgraph of D v

In this paper, we extend the study of C₄-decompositions of the complete graph with 2-regular leaves and paddings to directed versions. Mainly, we prove that if P is a vertex-disjoint union of directed cycles in a complete digraph D_v, then and D_v∪P can be decomposed into directed 4-cycles, respectively, if and only if v(v−1)−|E(P)|≡0(mod 4) and v(v−1)+|E(P)|≡0(mod 4) where |E(P)| denotes the number of directed edges of P, and v≥8.     

A bound for Wilson''''s general theorem

Given any set K of positive integers and positive integer λ, let c(K,λ) denote the smallest integer such that v∈B(K,λ) for every integer v≥c(K,λ) that satisfies the congruences λv(v-1)≡0 (mod β(K) and λ(v-1)≡0 (mod α(K)). Let K0 be an equivalent set of K, k and k* be the smallest and the largest integers in K0. We prove that c(K,λ)≤exp exp{Q0}Qo=max{2(2p(ko)2-k2kk)p(ko)4,(Kk242y-k-2)(y2)}, whereand y=k*+k(k-1)+1.     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

Degenerate triply nonlinear problems with nonhomogeneous boundary conditions

The paper addresses the existence and uniqueness of entropy solutions for the degenerate triply nonlinear problem: b(v) _t − div α(v, ▽g(v)) = f on Q:= (0, T) × Ω with the initial condition b(v(0, ·)) = b(v ₀) on Ω and the nonhomogeneous boundary condition “v = u” on some part of the boundary (0, T) × ∂Ω”. The function g is continuous locally Lipschitz continuous and has a flat region [A ₁, A ₂,] with A ₁ ≤ 0 ≤ A ₂ so that the problem is of parabolic-hyperbolic type.