The number of solutions to the alternate matrix equation over a finite field and a q-identity

Let F_q be a finite field with q elements, where q is a power of a prime. In this paper, we first correct a counting error for the formula N(K_2ν,0^(m)) occurring in Carlitz (1954. Arch. Math. V, 19–31). Next, using the geometry of symplectic group over F_q, we have given the numbers of solutions X of rank k and solutions X to equation XAX′=B over F_q, where A and B are alternate matrices of order n, rank 2ν and order m, rank 2s, respectively. Finally, an elementary q-identity is obtained from N(K_2ν,0⁽⁰⁾), and the explicit results for N(K_n,2ν,K_m,2s) is represented by terminating q-hypergeometric series.     

Theory of factorial designs of the parallel flats type. I: the coefficient matrix

Let GF(s) be the finite field with s elements.(Thus, when s=3, the elements of GF(s) are 0, 1 and 2.)Let A(r×n), of rank r, and c_i(i=1,…,f), (r×1), be matrices over GF(s). (Thus, for n=4, r=2, f=2, we could have A=[¹¹¹⁰₀₁₂₁], c₁=[¹₀], c₂=[⁰₂].) Let T_i (i=1,…,f) be the flat in EG(n, s) consisting of the set of all the s^n?r solutions of the equations At=c_i, wheret′=(t₁,…,t_n) is a vector of variables.(Thus, EG(4, 3) consists of the 3⁴=81 points of the form (t₁,t₂,t₃,t₄), where t's take the values 0,1,2 (in GF(3)). The number of solutions of the equations At=c_i is s^n?r, where r=Rank(A), and the set of such solutions is said to form an (n?r)-flat, i.e. a flat of (n?r) dimensions. In our example, both T₁ and T₂ are 2-flats consisting of 3^4?2=9 points each. The flats T₁,T₂,…,T_f are said to be parallel since, clearly, no two of them can have a common point. In the example, the points of T₁ are (1000), (0011), (2022), (0102), (2110), (1121), (2201), (1212) and (0220). Also, T₂ consists of (0002), (2010), (1021), (2101), (1112), (0120), (1200), (0211) and (2222).) Let T be the fractional design for a sⁿ symmetric factorial experiment obtained by taking T₁,T₂,…,T_f together. (Thus, in the example, 3⁴=81 treatments of the 3⁴ factorial experiment correspond one-one with the points of EG(4,3), and T will be the design (i.e. a subset of the 81 treatments) consisting of the 18 points of T₁ and T₂ enumerated above.)In this paper, we lay the foundation of the general theory of such ‘parallel’ types of designs. We define certain functions of A called the alias component matrices, and use these to partition the coefficient matrix X (n×v), occuring in the corresponding linear model, into components X._j(j=0,1,…,g), such that the information matrix X is the direct sum of the X′._jX._j. Here, v is the total number of parameters, which consist of (possibly μ), and a (general) set of (geometric) factorial effects (each carrying (s?1) degrees of freedom as usual). For j≠0, we show that the spectrum of X′._jX._j does not change if we change (in a certain important way) the usual definition of the effects. Assuming that such change has been adopted, we consider the partition of the X._j into the X_ij (i=1,…,f). Furthermore, the X_ij are in turn partitioned into smaller matrices (which we shall here call the) X_ijh. We show that each X_ijh can be factored into a product of 3 matrices J, ζ (not depending on i,j, and h) and Q(j,h,i)where both the Kronecker and ordinary product are used. We introduce a ring R using the additive groups of the rational field and GF(s), and show that the Q(j,h,i) belong to a ring isomorphic to R. When s is a prime number, we show that R is the cyclotomic field. Finally, we show that the study of the X._j and X′._jX._j can be done in a much simpler manner, in terms of certain relatively small sized matrices over R.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

Existence of certain class of duadic group algebra codes

Duadic codes are defined in terms of idempotents of a group algebra GF(q)G, where G is a finite group and gcd(q,|G|)=1. Under the conditions of (1) q=2^m, and (2) the idempotents are taken to be central and (3) the splitting is μ₋₁, we show that such duadic codes exist if and only if q has odd-order modulo |G|.     

Implications of survey design for generalized regression estimation of linear functions

The paper presents a general randomization theory approach to point and interval estimation of Q linear functions T_q = Σ^N₁c_kqY_k(q = 1,…,Q), where Y₁,…,Y_N are values of a variable of interest Y in a finite population. Such linear functions include population and domain means and totals, population regression coefficients, etc. We assume that some auxiliary information can be exploited. This suggests the generalized regression technique based on the fit of a linear model, whereby is created approximately design unbiased estimators T?_q. The paper focuses on estimation of the variance-covariance matrix of the T?_q for single stage and two stage designs. Two techniques based on Taylor expansions are compared. Results of Monte-Carlo experiments (not reported here) show that the coverage properties are good of normal-theory confidence intervals flowing from one or the other variance estimate.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

Concerning the vector v(m,t)

Let q = mt + 1 be a prime power, and let v(m, t) be the (m + 1)-vector (b₁, b₂, …, b_{m + 1}) of elements of GF(q) such that for each k, 1 ⩽ k ⩽ m + 1, the set {b_i−b_j:i∈{1,2,…m+1} − {m + 2 − k}, j  i + k(mod m + 2) and 1⩽j⩽m+1} forms a system of representatives for the cyclotomic classes of index m in GF(q). In this paper, we investigate the existence of such vectors. An upper bound on t for the existence of a v(m, t) is given for each fixed m unless both m and t are even, in which case there is no such a vector. Some special cases are also considered.     

On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

A note on the construction of optimal linear codes

Let us denote by (n,k,d)-code, a binary linear code with code length nk information symbols and the minimum distance d. It is well known that the problem of obtaining a binary linear code whose code length n is minimum among (n,k,d)-codes for given integers k and d, is equivalent to solve a linear programming whose solutions correspond to a minimum redundancy error-correcting code. In this paper it will be shown that for some given integers d, there exists no solution of the linear programming except a solution which is obtained using a flat in a finite projective geometry.     

Allocating observations between two normal populations to maximize the half slope of the F-test

Consider two independent normal populations. Let R denote the ratio of the variances. The usual procedure for testing H₀: R = 1 vs. H₁: R = r, where r≠1, is the F-test. Let θ denote the proportion of observations to be allocated to the first population. Here we find the value of θ that maximizes the rate at which the observed significance level of the F-test converges to zero under H₁, as measured by the half slope.     

Second order asymptotic relations of M-estimators and R-estimators in two-sample location model

Let T_M be an M-estimator (maximum likelihood type estimator) and T_R be an R-estimator (Hodges-Lehmann's estimator) of the shift parameter Δ in the two-sample location model. The asymptotic representation of √N(T_M-T_R) up to a term of the order O_p(N^{-$\text{1}\text{4}$}) is derived which is valid if the functions Ψ and ? generating T_M and T_R, respectively, decompose into an absolutely continuous and a step-function components; the order O_p(N^{-$\text{1}\text{4}$}) cannot be improved unless the discontinuous components vanish. As a consequence, the conditions under which √N(T_M-T_R)=O_p(N^{-$\text{1}\text{4}$}) are obtained. The main tool for obtaining the results is the second order asymptotic linearity of the pertaining linear rank statistics which is proved here under the assumption that the score-generating function ? has some jump-discontinuities.     

On cone representations of translation planes

Let F be a field of order q. It is known that an orthogonal array of the same order q has rank n over F if and only if it is represented as a cone cut by hyperplanes in n-dimensional space over F. Here we show that translation planes have a cone representation in (n + 1)-dimensional space over F, where n is the dimension of the plane over its kernel. If the plane is a semifield plane then the representation takes a particularly nice form. Rank 3 representations of Moulton planes are also briefly discussed.     

Nonparametric location-scale models for censored successive survival times

Let (T₁,T₂) be gap times corresponding to two consecutive events, which are observed subject to (univariate) random right-censoring. The censoring variable corresponding to the second gap time T₂ will in general depend on this gap time. Suppose the vector (T₁,T₂) satisfies the nonparametric location-scale regression model T₂=m(T₁)+σ(T₁)?, where the functions m and σ are ‘smooth’, and ? is independent of T₁. The aim of this paper is twofold. First, we propose a nonparametric estimator of the distribution of the error variable under this model. This problem differs from others considered in the recent related literature in that the censoring acts not only on the response but also on the covariate, having no obvious solution. On the basis of the idea of transfer of tail information (Van Keilegom and Akritas, 1999), we then use the proposed estimator of the error distribution to introduce nonparametric estimators for important targets such as: (a) the conditional distribution of T₂ given T₁; (b) the bivariate distribution of the gap times; and (c) the so-called transition probabilities. The asymptotic properties of these estimators are obtained. We also illustrate through simulations, that the new estimators based on the location-scale model may behave much better than existing ones.     

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.     

Flocks and partial flocks of quadrics: a survey

If O is an ovoid of PG(3,q), then a partition of all but two points of O into q−1 disjoint ovals is called a flock of O. A partition of a nonsingular hyperbolic quadric Q⁺(3,q) into q+1 disjoint irreducible conics is called a flock of Q⁺(3,q). Further, if O is either an oval or a hyperoval of PG(2,q) and if K is the cone with vertex a point x of PG(3,q)⧹PG(2,q) and base O, then a partition of K⧹{x} into q disjoint ovals or hyperovals in the respective cases is called a flock of K. The theory of flocks has applications to projective planes, generalized quadrangles, hyperovals, inversive planes; using flocks new translation planes, hyperovals and generalized quadrangles were discovered. Let Q be an elliptic quadric, a hyperbolic quadric or a quadratic cone of PG(3,q). A partial flock of Q is a set P consisting of β disjoint irreducible conics of Q. Partial flocks which are no flocks, have applications to k-arcs of PG(2,q), to translation planes and to partial line spreads of PG(3,q). Recently, the definition and many properties of flocks of quadratic cones in PG(3,q) were generalized to partial flocks of quadratic cones with vertex a point in PG(n,q), for n⩾3 odd.     

Pseudo confidence regions for the solution of a multivariate linear functional relationship

The problem of finding confidence regions (CR) for a q-variate vector γ given as the solution of a linear functional relationship (LFR) Λγ = μ is investigated. Here an m-variate vector μ and an m × q matrix Λ = (Λ₁, Λ₂,…, Λ_q) are unknown population means of an m(q+1)-variate normal distribution $\text{N}{}_{\mathrm{m(q+1)}}\text{(ζΩ?Σ)}$, where ζ′ = (μ′, Λ₁′, Λ₂′,…, Λ_q′Σ is an unknown, symmetric and positive definite m × m matrix and Ω is a known, symmetric and positive definite (q+1) × (q+1) matrix and ? denotes the Kronecker product. This problem is a generalization of the univariate special case for the ratio of normal means.A CR for γ with level of confidence 1 ? α, is given by a quadratic inequality, which yields the so-called ‘pseudo’ confidence regions (PCR) valid conditionally in subsets of the parameter space. Our discussion is focused on the ‘bounded pseudo’ confidence region (BPCR) given by the interior of a hyperellipsoid. The two conditions necessary for a BPCR to exist are shown to be the consistency conditions concerning the multivariate LFR. The probability that these conditions hold approaches one under ‘reasonable circumstances’ in many practical situations. Hence, we may have a BPCR with confidence approximately 1 ? α. Some simulation results are presented.     

A construction for generalized hadamard matrices GH(4q, EA(q))

We give a construction for a generalized Hadamard matrix GH(4q, EA(q)) as a 4 × 4 matrix of q × q blocks, for q an odd prime power other than 3 or 5. Each block is a GH(q, EA(q)) and certain combinations of 4 blocks form GH(2q, EA(q)) matrices. Hence a GH(4q, EA(q)) matrix exists for every prime power q.     

Projective (2n,n,λ,1)-designs

A projective (2n,n,λ,1)-design is a set $\text{D}$ of n element subsets (called blocks) of a 2n-element set V having the properties that each element of V is a member of λ blocks and every two blocks have a non-empty intersection. This paper establishes existence and non-existence results for various projective (2n,n,λ,1)-designs and their subdesigns.     

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.