Distribution of record statistics in a geometrically increasing population

The probability function and binomial moments of the number _Nn$N_n$ of (upper) records up to time (index) n in a geometrically increasing population are obtained in terms of the signless q-Stirling numbers of the first kind, with q   being the inverse of the proportion λ$\lambda$ of the geometric progression. Further, a strong law of large numbers and a central limit theorem for the sequence of random variables _Nn$N_n$, n=1,2,…,$n=1,2,\dots ,$ are deduced. As a corollary the probability function of the time _Tk$T_k$ of the kth record is also expressed in terms of the signless q  -Stirling numbers of the first kind. The mean of _Tk$T_k$ is obtained as a q  -series with terms of alternating sign. Finally, the probability function of the inter-record time _Wk=_Tk-_Tk-1$W_k=T_k-T_{k-1}$ is obtained as a sum of a finite number of terms of q  -numbers. The mean of _Wk$W_k$ is expressed by a q-series. As k   increases to infinity the distribution of _Wk$W_k$ converges to a geometric distribution with failure probability q. Additional properties of the q-Stirling numbers of the first kind, which facilitate the present study, are derived.     

Weight hierarchies of linear codes of dimension 3

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d₁,d₂,…,d_k), where d_r is the smallest support of an r-dimensional subcode of C. The weight hierarchies of [n,3;q] codes are studied. In particular, for q⩽5 the possible weight hierarchies of [n,3;q] codes are determined.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.     

D-optimal block designs with at most six varieties

For given positive integers v, b, and k (all of them ≥2) a block design is a k × b array of the variety labels 1,…,v with blocks as columns. For the usual one-way heterogeneity model in standard form the problem is studied of finding a D-optimal block design for estimating the variety contrasts, when no balanced block design (BBD) exists. The paper presents solutions to this problem for v≤6. The results on D-optimality are derived from a graph-theoretic context. Block designs can be considered as multigraphs, and a block design is D-optimal iff its multigraph has greatest complexity (=number of spanning trees).     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

On two random search problems

The paper is concerned with static search on a finite set. An unknown subset of cardinality k of the finite set is to be found by testing its subsets. We investigate two problems: in the first, the number of common elements of the tested and the unknown subset is given; in the second, only the information whether the tested and the unknown subset are disjoint or not is given. Both problems correspond to problems on false coins. If the unknown subset is taken from the family of k-element sets with uniform distribution, we determine the minimum of the lengths of the strategies that find the unknown element with small error probability. The strategies are constructed by probabilistic means.     

Minimax subset selection for the multinomial distribution

Let (X₁,…,X_k) be a multinomial vector with unknown cell probabilities (p₁,?,p_k). A subset of the cells is to be selected in a way so that the cell associated with the smallest cell probability is included in the selected subset with a preassigned probability, P¹. Suppose the loss is measured by the size of the selected subset, S. Using linear programming techniques, selection rules can be constructed which are minimax with respect to S in the class of rules which satisfy the P¹-condition. In some situations, the rule constructed by this method is the rule proposed by Nagel (1970). Similar techniques also work for selection in terms of the largest cell probability.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Higher-order Bartlett-type adjustment

This paper deals with Bartlett-type adjustment which makes all the terms up to order n^−k in the asymptotic expansion vanish, where k is an integer k ⩾ 1 and n depends on the sample size. Extending Cordeiro and Ferrari (1991, Biometrika, 78, 573–582) for the case of k = 1, we derive a general formula of the kth-order Bartlett-type adjustment for the test statistic whose kth-order asymptotic expansion of the distribution is given by a finite linear combination of chi-squared distribution with suitable degrees of freedom. Two examples of the second-order Bartlett-type adjustment are given. We also elucidate the connection between Bartlett-type adjustment and Cornish-Fisher expansion.     

Optimality in presence of damaged observations

In this paper we study a situation where, instead of observing $\text{y}\text{(N×1)}$, we observe $\text{y}\text{+}\text{d}$; where the random variables in the vector d are called damage components. It is shown that A- and E-optimum designs minimize the effect of d in the mean square error (m.s.e.) of estimable linear functions of parameters under the ordinary linear model.     

Parametric inference based on judgment post stratified samples

In this paper, we consider a judgment post stratified (JPS) sample of set size $H$ from a location and scale family of distributions. In a JPS sample, ranks of measured units are random variables. By conditioning on these ranks, we derive the maximum likelihood (MLEs) and best linear unbiased estimators (BLUEs) of the location and scale parameters. Since ranks are random variables, by considering the conditional distributions of ranks given the measured observations we construct Rao-Blackwellized version of MLEs and BLUEs. We show that Rao-Blackwellized estimators always have smaller mean squared errors than MLEs and BLUEs in a JPS sample. In addition, the paper provides empirical evidence for the efficiency of the proposed estimators through a series of Monte Carlo simulations.     

On multivariate variable-kernel density estimates for time series

Let X₁ be a strictly stationary multiple time series with values in R^d and with a common density f. Let X₁,.,.,X_n, be n consecutive observations of X₁. Let k = k_n, be a sequence of positive integers, and let H_ni be the distance from X_i to its kth nearest neighbour among X_j, j i. The multivariate variable-kernel estimate f_n, of f is defined by where K is a given density. The complete convergence of f_n, to f on compact sets is established for time series satisfying a dependence condition (referred to as the strong mixing condition in the locally transitive sense) weaker than the strong mixing condition. Appropriate choices of k are explicitly given. The results apply to autoregressive processes and bilinear time-series models.     

Finite set theory and its application to cryptology

The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.     

Minimax type procedures for nonparametric selection of the “best” population with partially classified data

Consider a sequence x ≡ (x₁,…, x_n) of n independent observations, in which each observation x_i is known to be a realization from either one of k_i given populations, chosen among k (≥ k_i) populations π₁, …, π_k Our main objective is to study the problem of the selection of the most reliable population π_j at a fixed time ξ, when no assumptions about the k populations are made. Some numerical examples are presented.     

Optimality of blue's in a general linear model with incorrect design matrix

We consider the Gauss-Markoff model (Y,X₀β,σ²V) and provide solutions to the following problem: What is the class of all models (Y,Xβ,σ²V) such that a specific linear representation/some linear representation/every linear representation of the BLUE of every estimable parametric functional p'β under (Y,X₀β,σ²V) is (a) an unbiased estimator, (b) a BLUE, (c) a linear minimum bias estimator and (d) best linear minimum bias estimator of p'β under (Y,Xβ,σ²V)? We also analyse the above problems, when attention is restricted to a subclass of estimable parametric functionals.     

On the equivalence of certain constant weight codes and combinatorial designs

Stinson and van Rees (Combinatorica (1984), 357–362) proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on the equivalence of a Hadamard matrix and a certain constant weight code is also proved.     

Optimal and efficient semi-Latin squares

An (n×n)/k$(n\times n)/k$semi-Latin square is an n×n square array in which nk distinct symbols (representing treatments) are placed in such a way that there are exactly k   symbols in each cell (row–column intersection) and each symbol occurs once in each row and once in each column. Semi-Latin squares form a class of row–column designs generalising Latin squares, and have applications in areas including the design of agricultural experiments, consumer testing, and via their duals, human–machine interaction. In the present paper, new theoretical and computational methods are developed to determine optimal or efficient (n×n)/k$(n\times n)/k$ semi-Latin squares for values of n and k for which such semi-Latin squares were previously unknown. The concept of subsquares of uniform semi-Latin squares is studied, new applications of the DESIGN package for GAP are developed, and exact algebraic computational techniques for comparing efficiency measures of binary equireplicate block designs are described. Applications include the complete enumeration of the (4×4)/k$(4\times 4)/k$ semi-Latin squares for k=2,…,10$k=2,\dots ,10$, and the determination of those that are A-, D-, and E-optimal, the construction of efficient (6×6)/k$(6\times 6)/k$ semi-Latin squares for k=4,5,6$k=4,5,6$, and counterexamples to a long-standing conjecture of R.A. Bailey and to a similar conjecture of D. Bedford and R.M. Whitaker.     

Symmetric designs of types V and VI

In Butler (1984a) a semi-translation block was defined and a classification given of all symmetric 2-(υ,k,λ) designs with λ>1, which contain more than one such block. In this paper we consider symmetric designs of type V and VI. We show that symmetric designs of type V are also of type VI, and in addition we show that all such designs can be obtained from a P_n,q by a construction which we give. Finally examples of proper symmetric designs of type V which are not of type VI are given.     

Embedding of orthogonal arrays of strength two and deficiency greater than two

Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array $\text{A(n, q, μ}{}^1\text{)}$ of strength 2 in n symbols with q rows and $\text{n}{}^2\text{μ}{}^1$ columns where $\text{q = q}{}^1\text{? d, q}{}^1\text{= n}{}^2\text{x + n + 1}$, $\text{μ}{}^1\text{= (n ?}\text{1}\text{)x +}\text{1}$ and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array $\text{A(n, q}{}^1\text{, μ}{}^1\text{)}$ is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)²(2d² ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.