An Asymptotic Expansion for the Distribution of Hotelling'sT-Statistic under Nonnormality

In this paper we obtain an asymptotic expansion for the distribution of Hotelling'sT²-statisticT²under nonnormality when the sample size is large. In the derivation we find an explicit Edgeworth expansion of the multivariatet-statistic. Our method is to use the Edgeworth expansion and to expand the characteristic function ofT².     

Approximations for multivariate U-statistics

Edgeworth approximations for multivariate U-statistics hold up to the order o(n^−1/2) under moment conditions and the assumption that the projection of the U-statistic to sums of i.i.d. random vectors is strongly nonlattice.     

Vector measure Maurey–Rosenthal-type factorizations and -sums of -spaces

Consider a vector measure of bounded variation m with values in a Banach space and an operator T:XL¹(m), where L¹(m) is the space of integrable functions with respect to m. We characterize when T can be factorized through the space L²(m) by means of a multiplication operator given by a function of L²(|m|), where |m| is the variation of m, extending in this way the Maurey–Rosenthal Theorem. We use this result to obtain information about the structure of the space L¹(m) when m is a sequential vector measure. In this case the space L¹(m) is an ℓ-sum of L¹-spaces.     

Generalized Hadamard Matrices

The paper studies a generalized Hadamard matrix H = (g _{i j}) of order n with entries gi j from a group G of order n. We assume that H satisfies: (i) For m k, G = {g _{m i} g k i ^-1 i = 1,...., n} (ii) g _1i = g _i1 = 1 for each i; (iii) g _ij ^-1 = g _ji for all i, j. Conditions (i) and (ii) occur whenever G is a(P, L) -transitivity for a projective plane of order n. Condition (iii) holds in the case that H affords a symmetric incidence matrix for the plane. The paper proves that G must be a 2-group and extends previous work to the case that n is a square.     

Consecutive customer losses in oscillating GIX/M//n systems with state dependent services rates

We address the probability that k or more Consecutive Customer Losses take place during a busy period of a queue, the so-called k-CCL probability, for oscillating GI ^X /M//n systems with state dependent services rates, also denoted as GI ^X /M(m)−M(m)//n systems, in which the service rates oscillate between two forms according to the evolution of the number of customers in the system. We derive an efficient algorithm to compute k-CCL probabilities in these systems starting with an arbitrary number of customers in the system that involves solving a linear system of equations. The results derived are illustrated for specific sets of parameters.     

3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity

Recently, active research has been performed on constructing t-designs from linear codes over Z ₄. In this paper, we will construct a new simple 3 – (2 ^m , 7, 14/3 (2 ^m – 8)) design from codewords of Hamming weight 7 in the Z ₄-Goethals code for odd m 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.     

Edgeworth Expansion of Densities of Order Statistics with Fixed Rank

We give an Edgeworth expansion for densities of order statistics with fixed rank k.The Edgeworth expansion for densities of extreme values is then obtained as a special case k=1.     

The p-Rank of the Incidence Matrix of Intersecting Linear Subspaces

Let V be a vector space of dimension n+1 over a field of p ^t elements. A d-dimensional subspace and an e-dimensional subspace are considered to be incident if their intersection is not the zero subspace. The rank of these incidence matrices, modulo p, are computed for all n, d, e and t. This result generalizes the well-known formula of Hamada for the incidence matrices between points and subspaces of given dimensions in a finite projective space. A generating function for these ranks as t varies, keeping n, d and e fixed, is also given. In the special case where the dimensions are complementary, i.e., d+e=n+ 1, our formula improves previous upper bounds on the size of partial m-systems (as defined by Shult and Thas).     

A finite algorithm for the continuousp-center location problem on a graph

LetG=(V,E) be an undirected graph with positive integer edge lengths. Letm be the number of edges inE, and letd be the sum of the edge lengths. We prove that the solution value to the continuousp-center location problem is a rationalp ₁/p ₂, where logp ₁=O(m ⁵ logd+m ⁶ logp),i=1,2. This result is then used to construct a finite algorithm for the continuousp-center problem.     

The Law of the Iterated Logarithm for m-Dependent Banach Space Valued Random Variables

A theorem on the law of the iterated logarithm is established for m-dependent B-valued random variables. The conditions in our theorem match their independent analogues and appear as necessary or minimal for the results. According to an example given in the paper, the situation we face is much different from the finite dimensional case and therefore, so is the way we solve the problems.     

The Estimates for Sharp Maximal Functions of Multilinear Strongly Singular Integral Operators

In this paper, the author obtains that the multilinear operators of strongly singular integral operators and their dual operators are bounded from some L^p（R^n） to L^p（R^n） when the m-th order derivatives of A belong to L^p（R^n） for r large enough. By this result, the author gets the estimates for the Sharp maximal functions of the multilinear operators with the m-th order derivatives of A being Lipschitz functions. It follows that the multilinear operators are （L^p, L^p）-type operators for 1 〈 p 〈 ∞.     

A Note on Edgeworth Expansions for <Emphasis Type="Italic">U</Emphasis>-Statistics under Minimal Conditions

A one-term Edgeworth expansion for U-statistics with kernel h(x, y) was derived by Jing and Wang [3] under optimal moment conditions. In this note, we show that one of the optimal moment conditions E| h(X ₁, X ₂|^5/3 < ∞ can be weakened to lim _t→∞ t ^5/3 P(|h(X ₁, X ₂)| > t) → 0. Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 453–440, July–September, 2005.     

A Family of Non-quasiprimitive Graphs Constructed From PSU3（q） Where q Is Odd

Let Г be a simple connected graph and let G be a group of automorphisms of Г. Г is said to be （G, 2）-arc transitive if G is transitive on the 2-arcs of Г. It has been shown that there exists a family of non-quasiprimitive （PSU3（q）, 2）-arc transitive graphs where q = 2^3m with m an odd integer. In this paper we investigate the case where q is an odd prime power.     

On -Hadamard matrices

In this paper, we use the Sylvester's approach to construct another Hadamard matrix, namely a J_m-Hadamard matrix, from a given one. Consequently, we can generate other 2^m-1 Hadamard matrices from the constructed J_m-Hadamard matrix. Finally, we also discuss the Kronecker product of an Hadamard matrix and a J_m-Hadamard matrix.     

Edgeworth expansion in censored linear regression model

For the censored simple linear regression model, we establish a oneterm Edgeworth expansion for the Koul, Susarla and Van Ryzin type estimator of the regression coefficient. Our approach is to represent the estimator of the regression coefficient as an asymptoticU-statistic plus some ignorable terms and hence apply the known results on the Edgeworth expansions for asymptoticU-statistic. The counting process and martingale techniques are used to provide the proof of the main results.     

An acceleration property of theE-algorithm for alternate sequences

We prove a convergence acceleration result by theE-algorithm for sequences whose error has an asymptotic expansion on the scale of comparison for which a determinantal relation holds. This result is generalized to the vector case. Moreover we prove a result which contains an acceleration property for columns and diagonals of theE array. This result is applied to some alternating series.     

Algorithms for shortest paths and d-cycle problems

Let G be a weighted graph with n vertices and m edges. We address the d-cycle problem, i.e., the problem of finding a subgraph of minimum weight with given cyclomatic number d. Hartvigsen [Minimum path bases, J. Algorithms 15 (1993) 125–142] presented an algorithm with running time O(n²m) and O(n^2d−1m²) for the cyclomatic numbers d=1 and d2, respectively. Using a (d+1)-shortest-paths algorithm, we develop a new more efficient algorithm for the d-cycle problem with running time O(n^2d−1+n²m+n³logn).     

Representation of finite groups and the first Betti number of branched coverings of a universal Borromean orbifold

The paper studies the first homology of finite regular branched coverings of a universal Borromean orbifold called B _4,4,4ℍ³. We investigate the irreducible components of the first homology as a representation space of the finite covering transformation group G. This gives information on the first betti number of finite coverings of general 3-manifolds by the universality of B _4,4,4. The main result of the paper is a criterion in terms of the irreducible character whether a given irreducible representation of G is an irreducible component of the first homology when G admits certain symmetries. As a special case of the motivating argument the criterion is applied to principal congruence subgroups of B _4,4,4. The group theoretic computation shows that most of the, possibly nonprincipal, congruence subgroups are of positive first Betti number. This work is partially supported by the Sonderforschungsbereich 288.     

Lp-Lq DECAY ESTIMATES FOR HYPERBOLIC EQUATIONS WITH OSCILLATIONS IN COEFFICIENTS

This work is concerned with the proof of Lp -Lq decay estimates for solutions of the Cauchy problem for utt -λ2(t)b2(t)/Δu =0. The coefficient consists of an increasing smooth function λ and an oscillating smooth and bounded function b which are uniformly separated from zero. The authors‘ main interest is devoted to the critical case where one has an interesting interplay between the growing and the oscillating part.     

Fitting hyperplanes by minimizing orthogonal deviations

Hyperplanes withm + 1 parameters are fitted by minimizing the sum of weighted orthogonal deviations to a set ofN points. There is no inverse regression incompatibility. For unweighted orthogonall ₁-fits essentially the same number of points are on either side of an optimal hyperplane. The criterion function is neither convex, nor concave, nor even differentiable. The main result is that each orthogonall _p -fit interpolates at leastm + 1 points, for 0 <p 1. This enables the combinatorial strategy of systematically trying all possible hyperplanes which interpolatem + 1 data points.