We analyze and identify stationary fields with linear regressions and quadratic conditional variances. We give sufficient conditions to determine one dimensional distributions uniquely as normal, and as certain compactly-supported distributions. Our technique relies on orthogonal polynomials, which under our assumptions turn out to be a version of the so called continuous q-Hermite polynomials.

MDS codes and matrices are closely related to combinatorial objects like orthogonal arrays and multipermutations. Conventional MDS codes and matrices were defined on finite fields, but several generalizations of this concept has been done up to now. In this note, we give a criterion for verifying whether a map is MDS or not.

Let G be an adjoint algebraic group of type B, C, or D over an algebraically closed field of characteristic 2. We construct a Springer correspondence for the Lie algebra of G. In particular, for orthogonal Lie algebras in characteristic 2, the structure of component groups of nilpotent centralizers is determined and the number of nilpotent orbits over finite fields is obtained.

This report discusses the ways in which Linear Algebra is applied to the manipulation of an object in three-space. This topic has a variety of useful applications, in fields ranging from Computer Animation to Aerospace Engineering. Specifically, the “object” considered in this paper is the Space Shuttle. The linear algebra topics necessary for this analysis include orthogonal coordinate systems...

We construct an orthogonal wavelet basis for the interval using a linear combination of Legendre polynomial functions. The coefficients are taken as appropriate roots of Chebyshev polynomials of the second kind, as has been proposed in reference [1]. A multi-resolution analysis is implemented and illustrated with analytical data and real-life signals from turbulent flow fields.

An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we consider the case where the graph to be covered twice is the complete bipartite graph Kmn,mn (for any values ofm,n) and all graphs in the collection are isomorphic to certa...

Existence of fixed point in orthogonal metric spaces has been initiated recently by Eshaghi and et al. [On orthogonal sets and Banach fixed Point theorem, Fixed Point Theory, in press]. In this paper, we introduce the notion of the strongly orthogonal sets and prove a genuine generalization of Banach' fixed point theorem and Walter's theorem. Also, we give an example showing that our main theor...

When an orthogonal array is projected on a small number of factors, as is done in screening experiments, the question of interest is the structure of the projected design, by which we mean its decomposition in terms of smaller arrays of the same strength. In this paper we investigate the decomposition of arrays of strength t having t + 1 factors. The decomposition problem is well-understood for...