A Family of Asymmetrical Orthogonal Arrays with Run Sizes 4p^2

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction of many mixed orthogonal arrays. But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices, so-called generalized difference matrices, were discovered by Zhang（1989, 1990, 1993） by the orthogonal decompositions of projective matrices. In this article, an interesting equivalent relationship between the orthogonal arrays and the generalized difference matrices is presented. As an application, a family of orthogonal arrays of run sizes 4p2, such as L36（6^13^42^10）, are constructed.     

构造正交表的一种替换模式

A method of constructing orthogonal arrays is presented by Zhang, Lu and Pang in 1999. In this paper,the method is developed by introducing a replacement scheme on the construction of orthogonal arrays ,and some new mixed-level orthogonal arrays of run size 36 are constructed.     

Construction of Orthogonal Arrays without Interaction Columns

In this paper a new class of orthogonal arrays(OAs), i.e., OAs without interaction columns, are proposed which are applicable in factor screening, interaction detection and other cases. With the tools of difference matrices, we present some general recursive methods for constructing OAs of such type. Several families of OAs with high percent saturation are constructed. In particular, for any integer λ≥ 3, such a two-level OA of run 4λ can always be obtained if the corresponding Hadamard matrix e...     

An approach of constructing mixed-level orthogonal arrays of strength ⩾ 3

Orthogonal arrays (OAs), mixed level or fixed level (asymmetric or symmetric), are useful in the design of various experiments. They are also a fundamental tool in the construction of various combinatorial configurations. In this paper, we establish a general "expansive replacement method" for constructing mixedlevel OAs of an arbitrary strength. As a consequence, a positive answer to the question about orthogonal arrays posed by Hedayat, Sloane and Stufken is given. Some series of mixed level OAs of strength ≥3 are produced.     

Generalized Inverses of Matrices over Rings

Let R be a ring, * be an involutory function of the set of all finite matrices over R. In this paper, necessary and sufficient conditions are given for a matrix to have a (1,3)-inverse, (1,4)-inverse, or Moore-P enrose inverse, relative to *. Some results about generalized inverses of matrices over division rings are generalized and improved.     

An orthogonal basis for non-uniform algebraic-trigonometric spline space

Non-uniform algebraic-trigonometric B-splines shares most of the properties as those of the usual polynomial B-splines. But they are not orthogonal. We construct an orthogonal basis for the n-order(n ≥ 3) algebraic-trigonometric spline space in order to resolve the theoretical problem that there is not an explicit orthogonal basis in the space by now. Motivated by the Legendre polynomials, we present a novel approach to define a set of auxiliary functions,which have simple and explicit expressions. Then the proposed orthogonal splines are given as the derivatives of these auxiliary functions.     

A Construction of Variable Strength Covering Arrays

Covering arrays(CA)of strength t,mixed level or fixed level,have been applied to software testing to aim for a minimum coverage of all t-way interactions among components.The size of CA increases with the increase of strength interaction t,which increase the cost of software testing.However,it is quite often that some certain components have strong interactions,while others may have fewer or none.Hence,a better way to test software system is to identify the subsets of components which are involved in stronger interactions and apply high strength interaction testing only on these subsets.For this,in 2003,the notion of variable strength covering arrays was proposed by Cohen et al.to satisfy the need to vary the size of t in an individual test suite.In this paper,an effective deterministic construction of variable strength covering arrays is presented.Based on the construction,some series of variable strength covering arrays are then obtained,which are all optimal in the sense of their sizes.In the procedure,two classes of new difference matrices of strength 3 are also mentioned.     

Generalized Einstein tensor for a Weyl manifold and its applications

It is well known that the Einstein tensor G for a Riemannian manifold defined by G βα = R βα 1/2 Rδβα , R βα = g βγ R γα where R γα and R are respectively the Ricci tensor and the scalar curvature of the manifold, plays an important part in Einstein's theory of gravitation as well as in proving some theorems in Riemannian geometry. In this work, we first obtain the generalized Einstein tensor for a Weyl manifold. Then, after studying some properties of generalized Einstein tensor, we prove that the conformal invariance of the generalized Einstein tensor implies the conformal invariance of the curvature tensor of the Weyl manifold and conversely. Moreover, we show that such Weyl manifolds admit a one-parameter family of hypersurfaces the orthogonal trajectories of which are geodesics. Finally, a necessary and sufficient condition in order that the generalized circles of a Weyl manifold be preserved by a conformal mapping is stated in terms of generalized Einstein tensors at corresponding points.     

On the maximin distance properties of orthogonal designs via the rotation

Space-filling designs are widely used in computer experiments. They are frequently evaluated by the orthogonality and distance-related criteria. Rotating orthogonal arrays is an appealing approach to constructing orthogonal space-filling designs. An important issue that has been rarely addressed in the literature is the design selection for the initial orthogonal arrays. This paper studies the maximin L₂-distance properties of orthogonal designs generated by rotating two-level orthogo...     

Perturbations of Moore–Penrose Metric Generalized Inverses of Linear Operators in Banach Spaces

In this paper,the perturbations of the Moore–Penrose metric generalized inverses of linear operators in Banach spaces are described.The Moore–Penrose metric generalized inverse is homogeneous and nonlinear in general,and the proofs of our results are different from linear generalized inverses.By using the quasi-additivity of Moore–Penrose metric generalized inverse and the theorem of generalized orthogonal decomposition,we show some error estimates of perturbations for the singlevalued Moore–Penrose metric generalized inverses of bounded linear operators.Furthermore,by means of the continuity of the metric projection operator and the quasi-additivity of Moore–Penrose metric generalized inverse,an expression for Moore–Penrose metric generalized inverse is given.     

Orthogonal arrays obtained by generalized difference matrices with g levels

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2...     

Orthogonal arrays constructed by generalized Kronecker product

In this paper, we propose a new general approach to construct asymmetrical orthogonal arrays, namely generalized Kronecker product. The operation is not usual Kronecker product in the theory of matrices, but it is interesting since the interaction of two columns of asymmetrical orthogonal arrays can be often written out by the generalized Kronecker product. As an application of the method, some new mixed-level orthogonal arrays of run sizes 72 and 96 are constructed.     

Orthogonal arrays obtained by repeating-column difference matrices

In this paper, by using the repeating-column difference matrices and orthogonal decompositions of projection matrices, we propose a new general approach to construct asymmetrical orthogonal arrays. As an application of the method, some new orthogonal arrays with run sizes 72 and 96 are constructed.     

Generalized latin matrix and construction of orthogonal arrays

In this paper, generalized Latin matrix and orthogonal generalized Latin matrices are proposed. By using the property of orthogonal array, some methods for checking orthogonal generalized Latin matrices are presented. We study the relation between orthogonal array and orthogonal generalized Latin matrices and obtain some useful theorems for their construction. An example is given to illustrate applications of main theorems and a new class of mixed orthogonal arrays are obtained.     

正交平衡区组设计统计模型中的方差分析

正交平衡区组设计(或广义正交表)的数据分析类似于正交拉丁方(或正交表)的数据分析.利用类似于正交表数据分析中的投影矩阵的正交分解技术,研究正交平衡区组设计的统计分析模型,给出了方差分析中的二次型以及各因子的二次型的分布性质,从而给出正交平衡区组设计统计模型中的方差分析方法.     

Sequences and arrays involving free variables

Abstact: Sequences in free variables are introduced and used to construct arrays in free variables which are suitable for circulant matrices. Most of the arrays found are maximal in the number of free variables. Applications include many new Goethals‐Seidel type arrays and complex orthogonal designs. © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 17–27, 2001     

Second order freeness and fluctuations of random matrices: I. Gaussian and Wishart matrices and cyclic Fock spaces

We extend the relation between random matrices and free probability theory from the level of expectations to the level of fluctuations. We introduce the concept of “second order freeness” and interpret the global fluctuations of Gaussian and Wishart random matrices by a general limit theorem for second order freeness. By introducing cyclic Fock space, we also give an operator algebraic model for the fluctuations of our random matrices in terms of the usual creation, annihilation, and preservation operators. We show that orthogonal families of Gaussian and Wishart random matrices are asymptotically free of second order.     

Generalized Riordan arrays

In this paper, we generalize the concept of Riordan array. A generalized Riordan array with respect to c_n is an infinite, lower triangular array determined by the pair (g(t),f(t)) and has the generic element d_n,k=[tⁿ/c_n]g(t)(f(t))^k/c_k, where c_n is a fixed sequence of non-zero constants with c₀=1.We demonstrate that the generalized Riordan arrays have similar properties to those of the classical Riordan arrays. Based on the definition, the iteration matrices related to the Bell polynomials are special cases of the generalized Riordan arrays and the set of iteration matrices is a subgroup of the Riordan group. We also study the relationships between the generalized Riordan arrays and the Sheffer sequences and show that the Riordan group and the group of Sheffer sequences are isomorphic. From the Sheffer sequences, many special Riordan arrays are obtained. Additionally, we investigate the recurrence relations satisfied by the elements of the Riordan arrays. Based on one of the recurrences, some matrix factorizations satisfied by the Riordan arrays are presented. Finally, we give two applications of the Riordan arrays, including the inverse relations problem and the connection constants problem.     

数量对合矩阵的线性组合的秩的不变性

若矩阵A、B满足A2=λ2I、B2=μ2I（λμ≠0）,称A、B都是数量对合矩阵．当非零复数a、b、u、v满足μλ＋bμ≠0、uλ＋vμ≠0时,我们证明了数量对合矩阵A、B与单位矩阵,的线性组合的秩总是相等,并且是一个与a、b、札、u选择都无关的常数．应用所得到数量对合矩阵的线性组合的秩的不变性,可推广已有文献的关于对合矩阵的相应结果．