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.     

Minimal 2-coverings of a finite affine space based on GF(2)

Let EG(m, 2) denote the m-dimensional finite Euclidean space (or geometry) based on GF(2), the finite field with elements 0 and 1. Let T be a set of points in this space, then T is said to form a q-covering (where q is an integer satisfying 1?q?m) of EG(m, 2) if and only if T has a nonempty intersection with every (m-q)-flat of EG(m, 2). This problem first arose in the statistical context of factorial search designs where it is known to have very important and wide ranging applications. Evidently, it is also useful to study this from the purely combinatorial point of view. In this paper, certain fundamental studies have been made for the case when q=2. Let N denote the size of the set T. Given N, we study the maximal value of m.     

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

Testing normalization and overidentification of cointegrating vectors in vector autoregressive processes

This paper develops test procedures for testing the validity of general linear identifying restrictions imposed on cointegrating vectors in the context of a vector autoregressive model. In addition to overidentifying restrictions the considered restrictions may also involve normalizing restrictions. Tests for both types of restrictions are developed and their asymptotic properties are obtained. Under the null hypothesis tests for normalizing restrictions have an asymptotic "multivariate unit root distribution", similar to that obtained for the likelihood ratio test for cointegration, while tests for overidentifying restrictions have a standard chi-square limiting distribution. Since these two types of tests are asymptotically independent they are easy to cotnbine to an overall test for the spccifed identifying restrictions. An overall test of this kind can consistently reveal the failure of the identifying restrictions in a wider class of cases than previous tests which only test for overidentifying restrictions.     

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.     

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.     

Inequality Constraints in the Univariate GARCH Model

To keep the conditional variances generated by the GARCH (p, q) model nonnegative, Bollerslev imposed nonnegativity constraints on the parameters of the process. We show that these constraints can be substantially weakened and so should not be imposed in estimation. We also provide empirical examples illustrating the importance of relaxing these constraints.     

Normalized Quadratic Systems of Consumer Demand Functions

Empirically estimated demand systems frequently fail to satisfy the appropriate theoretical curvature conditions. We propose and estimate two demand systems for which these conditions can be imposed globally; the first is derived from a normalized quadratic reciprocal indirect utility function and the second is derived from a normalized quadratic expenditure function. The former is flexible if there are no restrictions on its free parameters, but loses flexibility if the curvature conditions need to be imposed. The latter is flexible, in the class of functions satisfying local money metric scaling, even if the curvature conditions need to be imposed.     

Non-nested hypothesis testing inference for GAMLSS models

Two or more regression models are said to be non-nested if neither can be obtained from the remaining models when parametric restrictions are imposed. Tests for choosing between linear non-nested regression models are found in literature, such as J and MJ tests. In this paper we propose variants of these two tests for the GAMLSS (Generalized Additive Models for Location, Scale and Shape) class of models. We report Monte Carlo evidence on finite sample behaviour of the proposed tests. Bootstrap-based testing inference is also considered. Overall, bootstrap MJ test had the best performance. An empirical application is presented and discussed.     

A likelihood ratio test of a homoscedastic normal mixture against a heteroscedastic normal mixture

It is generally assumed that the likelihood ratio statistic for testing the null hypothesis that data arise from a homoscedastic normal mixture distribution versus the alternative hypothesis that data arise from a heteroscedastic normal mixture distribution has an asymptotic χ ² reference distribution with degrees of freedom equal to the difference in the number of parameters being estimated under the alternative and null models under some regularity conditions. Simulations show that the χ ² reference distribution will give a reasonable approximation for the likelihood ratio test only when the sample size is 2000 or more and the mixture components are well separated when the restrictions suggested by Hathaway (Ann. Stat. 13:795–800, 1985) are imposed on the component variances to ensure that the likelihood is bounded under the alternative distribution. For small and medium sample sizes, parametric bootstrap tests appear to work well for determining whether data arise from a normal mixture with equal variances or a normal mixture with unequal variances.     

Isomorphism check in fractional factorial designs via letter interaction pattern matrix

Two fractional factorial designs are considered isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and/or switching the levels of factors. To identify the isomorphism of two designs is known as an NP hard problem. In this paper, we propose a three-dimensional matrix named the letter interaction pattern matrix (LIPM) to characterize the information contained in the defining contrast subgroup of a regular two-level design. We first show that an LIPM could uniquely determine a design under isomorphism and then propose a set of principles to rearrange an LIPM to a standard form. In this way, we can significantly reduce the computational complexity in isomorphism check, which could only take O(2^p)+O(3k³)+O(2^k) operations to check two 2^k−p designs in the worst case. We also find a sufficient condition for two designs being isomorphic to each other, which is very simple and easy to use. In the end, we list some designs with the maximum numbers of clear or strongly clear two-factor interactions which were not found before.     

A q-Pólya urn model and the q-Pólya and inverse q-Pólya distributions

A q-Pólya urn model is introduced by assuming that the probability of drawing a white ball at a drawing varies geometrically, with rate q, both with the number of drawings and the number of white balls drawn in the previous drawings. Then, the probability mass functions and moments of (a) the number of white balls drawn in a specific number of drawings and (b) the number of black balls drawn until a specific number of white balls are drawn are derived. These two distributions turned out to be q-analogs of the Pólya and the inverse Pólya distributions, respectively. Also, the limiting distributions of the q-Pólya and the inverse q-Pólya distributions, as the number of balls in the urn tends to infinity, are shown to be a q-binomial and a negative q-binomial distribution, respectively. In addition, the positive or negative q-hypergeometric distribution is obtained as conditional distribution of a positive or negative q-binomial distribution, given its sum with another positive or negative q-binomial distribution, independent of it.     

On Whiteman's and Storer's difference sets

In this paper, we prove that all Storer's difference sets are cyclic. We also prove that for p<1.8×10²⁵, Whiteman's difference sets exist if and only if (p,q)=(17,53) and (46817,140453).     

A generalized step-up-down multiple test procedure

A generalization of step-up and step-down multiple test procedures is proposed. This step-up-down procedure is useful when the objective is to reject a specified minimum number, q, out of a family of k hypotheses. If this basic objective is met at the first step, then it proceeds in a step-down manner to see if more than q hypotheses can be rejected. Otherwise it proceeds in a step-up manner to see if some number less than q hypotheses can be rejected. The usual step-down procedure is the special case where q = 1, and the usual step-up procedure is the special case where q = k. Analytical and numerical comparisons between the powers of the step-up-down procedures with different choices of q are made to see how these powers depend on the actual number of false hypotheses. Examples of application include comparing the efficacy of a treatment to a control for multiple endpoints and testing the sensitivity of a clinical trial for comparing the efficacy of a new treatment with a set of standard treatments.     

The q-Bernstein basis as a q-binomial distribution

The q-Bernstein basis, used in the definition of the q-Bernstein polynomials, is shown to be the probability mass function of a q-binomial distribution. This distribution is defined on a sequence of zero–one Bernoulli trials with probability of failure at any trial increasing geometrically with the number of previous failures. A modification of this model, with the probability of failure at any trial decreasing geometrically with the number of previous failures, leads to a second q-binomial distribution that is also connected to the q-Bernstein polynomials. The q-factorial moments as well as the usual factorial moments of these distributions are derived. Further, the q-Bernstein polynomial B_n(f(t),q;x) is expressed as the expected value of the function f([X_n]_q/[n]_q) of the random variable X_n obeying the q-binomial distribution. Also, using the expression of the q-moments of X_n, an explicit expression of the q-Bernstein polynomial B_n(f_r(t),q;x), for f_r(t) a polynomial, is obtained.     

Estimating and testing generalized linear models under inequality restrictions

We consider maximum likelihood estimation and likelihood ratio tests under inequality restrictions on the parameters. A special case are order restrictions, which may appear for example in connection with effects of an ordinal qualitative covariate. Our estimation approach is based on the principle of sequential quadratic programming, where the restricted estimate is computed iteratively and a quadratic optimization problem under inequality restrictions is solved in each iteration. Testing for inequality restrictions is based on the likelihood ratio principle. Under certain regularity assumptions the likelihood ratio test statistic is asymptotically distributed like a mixture of χ², where the weights are a function of the restrictions and the information matrix. A major problem in theory is that in general there is no unique least favourable point. We present some empirical findings on finite-sample behaviour of tests and apply the methods to examples from credit scoring and dentistry.     

Maximum likelihood estimation for arma models in the presence of ARMA errors

An ARMA(p, q) process observed with an ARMA(c, d) error has an ARMA (p + c, k) representation with k = max(c + q, p + d) whose parameters satisfy some nonlinear constraints. Identification of the model is discussed. We develop Newton-Raphson estimators for the ARMA(p + c, k) process which take advantage of the information contained in the nonlinear restrictions. Explicit expressions for the derivatives of the restrictions are derived.     

Consistency of Bayes estimators without the assumption that the model is correct

We examine a more general form of consistency which does not necessarily rely on the correct specification of the likelihood in the Bayesian setting, but we restrict the form of the likelihood to be in a minimal standard exponential family. First, we investigate the asymptotic behavior of the Bayes estimator of a parameter, and show that the Bayes estimator is consistent under the condition that the exponential family is full. However, we find that θ_i=θ_j and ∥θ_i−θ_j∥<ε, even for very small ε, behave differently, even in an asymptotic manner, when the model is not correct. We note that the distinction applies generally to Bayesian testing problems.     

On a multiple endpoints testing problem

In a clinical trial comparing drug with placebo, where there are multiple primary endpoints, we consider testing problems where an efficacious drug effect can be claimed only if statistical significance is demonstrated at the nominal level for all endpoints. Under the assumption that the data are multivariate normal, the multiple endpoint-testing problem is formulated. The usual testing procedure involves testing each endpoint separately at the same significance level using two-sample t-tests, and claiming drug efficacy only if each t-statistic is significant. In this paper we investigate properties of this procedure. We show that it is identical to both an intersection union test and the likelihood ratio test. A simple expression for the p-value is given. The level and power function are studied; it is shown that the test may be conservative and that it is biased. Computable bounds for the power function are established.     

Nonnegative unbiased estimability of linear combinations of two variance components

For a general mixed model with two variance components θ₁ and θ₂, a criterion for a function q₁θ₁+q₂θ₂ to admit an unbiased nonnegative definite quadratic estimator is established in a form that allows answering the question of existence of such an estimator more explicitly than with the use of the criteria known hitherto. An application of this result to the case of a random one-way model shows that for many unbalanced models the estimability criterion is expressible directly by the largest of the numbers of observations within levels, thus extending the criterion established by LaMotte (1973) for balanced models.