Perfect octagon quadrangle systems with upper C4-systems

An octagon quadrangle is the graph consisting of an 8-cycle (x₁, x₂,…, x₈) with two additional chords: the edges {x₁, x₄} and {x₅, x₈}. An octagon quadrangle system of order v and index ρ [OQS] is a pair (X,H), where X is a finite set of v vertices and H is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of ρK_v defined on X. An octagon quadrangle systemΣ=(X,H) of order v and index λ is said to be upper C₄-perfect if the collection of all of the upper4-cycles contained in the octagon quadrangles form a μ-fold 4-cycle system of order v; it is said to be upper strongly perfect, if the collection of all of the upper4-cycles contained in the octagon quadrangles form a μ-fold 4-cycle system of order v and also the collection of all of the outside8-cycles contained in the octagon quadrangles form a ?-fold 8-cycle system of order v. In this paper, the authors determine the spectrum for these systems.     

A characterization of some {3v2 + v3, 3v1 + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with B2 = 0

It is known (cf. Hill and Newton (Ars Combin., 25A (1988), 61–72; Designs Codes Cryptography, 2 (1992), 137–157) and Remark A.2 in the Appendix) that (1) there is no [14, 4, 9; 3]-code meeting the Griesmer bound and (2) if C is a [15, 4, 9; 3]-code then B₂ = 0 or 2 and (3) there is a one-to-one correspondence between the set of all nonequivalent [15, 4, 9; 3]-codes with B₂ = 0 and the set of all {3v₂ + v₃, 3v₁ + v₂: 3, 3}-minihypers, where v₁ = 1, v₂ = 4, v₃ = 13 and B₂ denotes the number of codewords of weight 2 in its dual code. Recently it has been shown by Eupen and Hill (Designs Codes Cryptography, 4 (1994) 271–282) that a [15, 4, 9; 3]-code with B₂ = 2 is unique up to equivalence. The purpose of this paper is to characterize all [15, 4, 9; 3]-codes with B₂ = 0 using the geometrical structure of the corresponding {3v₂ + v₃, 3v₁ + v₂; 3, 3}-minihypers. Those results give a complete characterization of [15, 4, 9; 3]-codes.     

A characterization of some {3v1 + v3, 3v0 + v2; 3, 3}-minihypers and its applications to error-correcting codes

Recently, Hamada et al. (Des. Codes Cryptogr. 2(1992), 225–229) showed that there exists an [87,5,57;3]-code meeting the Grismer bound. But it is unknown whether or not an [87,5,57;3]-code is unique up to equivalence. In order to characterize all [87,5,57;3]-codes, it is sufficient to characterize all {2v₂ + 2v₃,2v₁ + 2v₂; 4, 3}-minihypers and in order to characterize all {2v₂ + 2v₃,2v₁ + 2v₂;4,3}-minihypers, it is necessary to characterize all {3v₁ + v₃,3v₀ + v₂;3,3}-minihypers, where v₀ = 0, v₁ = 1, v₂ = 4 and v₃ = 13 (cf. Hamada and Helleseth, J. Statist. Plann. Inference, 56 (1996)). The purpose of this paper is to characterize all {3v₁ + v₃,3v₀ + v₂;3,3}-minihypers.     

A construction of group divisible designs

Given any affine design with parameters v, b, r, k, λ and μ = k²/v and any design with parameters v′, b′, r′, k′, λ′ where r′ = tr for some natural number `t and k′?r, we construct a group divisible design with parameters v′' = vv′, m = v′, n = v, b′' = vb′, k′' = kk′, r′'= kr′, λ₁ = tkλ and λ₂ = μλ′. This is applied to some series of designs. As a lemma, we also show that any 0-1-matrix with row sums tr and column sums ?r may be written as the sum of r 0-1-matrices with row sums t and column sums ?1.     

Orthogonal diagonal Latin squares with small subsquares

We prove that there exists a pair of orthogonal diagonal Latin squares of order v with missing subsquares of side n(ODLS(v, n)) if and only if v ⩾ 3n + 2 and v − n even, in the cases n ⩽ 6.     

E-optimal incomplete block designs with two distinct block sizes

Sufficient conditions are derived for the determination of E-optimal designs in the class D(v,b₁,b₂,k₁,k₂) of incomplete block designs for v treatments in b₁ blocks of size k₁ each and b₂ blocks of size k₂ each. Some constructions for E-optimal designs that satisfy the sufficient conditions obtained here are given. In particular, it is shown that E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by augmenting b₂ blocks, with k₂ − k₁ extra plots each, of a BIBD(v,b = b₁ + b₂,k₁,λ) and GDD(v,b = b₁ + b₂,k₁,λ₁,λ₂). It is also shown that equireplicate E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by combining disjoint blocks of BIBD(v,b,k₁,λ) and GDD(v,b,k₁,λ₁,λ₂) into larger blocks. As applications of the construction techniques, several infinite series of E-optimal designs with small block sizes differing by at most two are given. Lower bounds for the A-efficiency are derived and it is found that A-efficiency exceeds 99% for v ⩾ 10, and at least 97.5% for 5 ⩽v < 10.     

Resolvable systems of 8-tuples

Let R be a family of k-element blocks of a v-element set V such that any two elements of V are contained in λ blocks of R and R=R₁∪…∪R_v?1, R_i∩ R_j=? (i≠j) and ?{B_i∈R_j∣i=1,…,v?k}=V (B_i a block in R_j), i.e. R is a resolvable block design RB(v, k, λ). In this paper it will be shown that a sufficient condition for the existence of an RB(v, 8, 7) is that v≡0 (mod 8) and v is nondivisible by 3, 5, 7.     

Comparing more than one treatment to more than one control in incomplete blocks

The class of balanced treatment incomplete block designs is generalized to allow for comparison of v₁ test treatments and v₂ control treatments. The generalized class is equivalent to the class of balanced bipartite block designs considered by Jaggi, Gupta, and Parsad. Some results on design construction and A-optimality are given for small values of v₁ and v₂. Algorithms are developed for computing simultaneous confidence bounds for all test treatment versus control contrasts.     

On some joint distributions in fluctuation theory

For non-negative integral valued interchangeable random variables v₁, v₂,…,v_n, Takács (1967, 70) has derived the distributions of the statistics ?_n' ?¹_n' ?^(c)_n and ?^(-c)_n concerning the partial sums N_r = v₁ + v₂ + ··· + v_rr = 1,…,n. This paper deals with the joint distributions of some other statistics viz., (α^(c)_n, δ^(c)_n, Z_n), (β^(c)_n, Z_n) and (β^(-c)_n, Z_n) concerning the partial sums N_r = ε₁ + ··· + ε_rr = 1,2,…,n, of geometric random variables ε₁, ε₂,…,ε_n.     

Simultaneous confidence bands for expectile functions

Expectile regression, as a general M smoother, is used to capture the tail behaviour of a distribution. Let (X ₁,Y ₁),…,(X _n ,Y _n ) be i.i.d. rvs. Denote by v(x) the unknown τ-expectile regression curve of Y conditional on X, and by v _n (x) its kernel smoothing estimator. In this paper, we prove the strong uniform consistency rate of v _n (x) under general conditions. Moreover, using strong approximations of the empirical process and extreme value theory, we consider the asymptotic maximal deviation sup_0≤x≤1|v _n (x)?v(x)|. According to the asymptotic theory, we construct simultaneous confidence bands around the estimated expectile function. Furthermore, we apply this confidence band to temperature analysis. Taking Berlin and Taipei as an example, we investigate the temperature risk drivers to these two cities.     

A series of group divisible designs

Bose and Shrikhande C19763 proved that if D(m, k, ?) is a Baer subdesign of another SBIBD D₁ (v₁, k₁ ?), k₁>k, then it also contains a complementary subdesign D^* which is symmetric GDD, D^* (v^*, k^*; ?-1, ?; m, n). Utilising this, we give a necessary condition for a SBIBD D to be a Baer subdesign of D₁ and also give the parameters. Some GD designs are constructed.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.     

Existence of holey LSSOM of type 2n with application to G7-packings of Kv

In this paper, we show that the set of all integers n⩾4 is the spectrum of two mutually orthogonal holey Latin squares, of type 2ⁿ, in which one square is symmetric. As an application, we determine the maximum number of pairwise edge disjoint copies of G₇ in K_v for each v, and all possible graphs that arise from the unused edges.     

Serial arrays and change-over designs

Consider change-over designs for the comparison of v treatments. Each application has a direct effect and up to n?1 residual and/or interaction effects. An array is defined to be a serial array if: (1) all treatments occur equally often in each row and (2) reading down columns, all possible permutations of n consecutive treatments occur equally often in the array. A method of constructing (λv+n?1) Xv^{n ?1}, λ integral, serial arrays is given. Use of these arrays as change-over designs is discussed with emphasis on the inclusion of interaction effects.     

Sequential estimation of the mean of NEF-PVF distributions

Let F = {F₀: 0 ϵ Θ} denote the class of natural exponential family of distributions having power variance function, (NEF-PVF). We consider the problem of sequentially estimating the mean μ of F₀ ϵ F, based on i.i.d. observations from F₀. We propose an appropriate sequential estimation procedure under a combined loss of estimation error and sampling cost. We provide expansion for the regret R_a and study its asymptotic properties. We show that R_a = cv²(μ) + o(1) as a → ∞, where c > 0 is a known constant and v(μ) denotes the coefficient of variation of F₀.