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.     

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

一类试验次数为4p2的非对称正交表的构造

Nowadays orthogonal arrays play important roles in statistics,computer science, coding theory and cryptography.The usual difference matrices are essential for the con- struction 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 matri- ces is presented.As an application,a family of orthogonal arrays of run sizes 4p~2,such as L_(36)(6~13~42~(10)),are constructed.     

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.     

Representations for partially exchangeable arrays of random variables

Consider an array of random variables (X_i,j), 1 ≤ i,j < ∞, such that permutations of rows or of columns do not alter the distribution of the array. We show that such an array may be represented as functions f(α, ξ_i, η_j, λ_i,j) of underlying i.i.d, random variables. This result may be useful in characterizing arrays with additional structure. For example, we characterize random matrices whose distribution is invariant under orthogonal rotation, confirming a conjecture of Dawid.     

Matricially free random variables

We show that the framework developed by Voiculescu for free random variables can be extended to arrays of random variables whose multiplication imitates matricial multiplication. The associated notion of independence, called matricial freeness, can be viewed as a concept which not only leads to a natural generalization of freeness, but also underlies other fundamental types of noncommutative independence, such as monotone independence and boolean independence. At the same time, the sums of matricially free random variables, called random pseudomatrices, are closely related to random matrices. The main results presented in this paper concern the standard and tracial central limit theorems for random pseudomatrices and the corresponding limit distributions which can be viewed as matricial semicircle laws.     

Lyapunov exponents of free operators

Lyapunov exponents of a dynamical system are a useful tool to gauge the stability and complexity of the system. This paper offers a definition of Lyapunov exponents for a sequence of free linear operators. The definition is based on the concept of the extended Fuglede-Kadison determinant. We establish the existence of Lyapunov exponents, derive formulas for their calculation, and show that Lyapunov exponents of free variables are additive with respect to operator product. We illustrate these results using an example of free operators whose singular values are distributed by the Marchenko-Pastur law, and relate this example to C.M. Newman's “triangle” law for the distribution of Lyapunov exponents of large random matrices with independent Gaussian entries. As an interesting by-product of our results, we derive a relation between the extended Fuglede-Kadison determinant and Voiculescu's S-transform.     

ρ混合阵列的收敛性

该文引入了ρ～混合阵列的概念，讨论了ρ～混合阵列的完全收敛性与依概率收敛性. 所得结果，推广了行独立随机变量阵列相应的结果. 此外还得到了一般随机变量阵列的完全收敛性与依概率收敛性.     

Weak amicable T‐matrices and Plotkin arrays

We introduce the class of weak amicable T‐matrices and use it to construct a class of orthogonal designs, for p = 1 and for p a prime power ≡ 3 (mod 4), and all odd q, q ≤ 21. This class includes new Plotkin arrays of order 24, 40, 56 and for the first time, of orders 8q, q ∈ {9,11,13,15,17,19,21}. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 44–52, 2008     

Quantum invariant families of matrices in free probability

We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and hyperoctahedral groups, we obtain complete characterizations of the invariant families in terms of an operator-valued R-cyclicity condition. This is a surprising contrast with the Aldous-Hoover characterization of jointly exchangeable arrays.     

Arrays for orthogonal designs

A set of square real matrices is said to be amicable if for some permutation σ of the set . An infinite number of arrays which are suitable for any amicable set of eight circulant matrices are introduced. Applications include new classes of orthogonal designs. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 166–173, 2000     

Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full classification of such multivariate skew polynomial rings (free or not) over finite fields. To that end, we first show that all ring morphisms from the field to the ring of square matrices are diagonalizable, and that the corresponding derivations are all inner derivations. Secondly, we show that all such multivariate skew polynomial rings over finite fields are isomorphic as algebras to a multivariate skew polynomial ring whose ring morphism from the field to the ring of square matrices is diagonal, and whose derivation is the zero derivation. Furthermore, we prove that two such representations only differ in a permutation on the field automorphisms appearing in the corresponding diagonal. The algebra isomorphisms are given by affine transformations of variables and preserve evaluations and degrees. In addition, ours proofs show that the simplified form of multivariate skew polynomial rings can be found computationally and explicitly.     

行为负相依随机变量阵列加权和的完全收敛性

本文研究了行为NOD随机变量阵列加权和的完全收敛性.运用NOD随机变量列的矩不等式以及截尾的方法,得到了关于行为NOD随机变量阵列加权和的完全收敛性的充分条件.利用获得的充分条件,推广了Baek(2008)关于行为NA随机变量阵列加权和的完全收敛性的结论,得到了比吴群英(2012)更为一般的结果.     

Cumulants for Random Matrices as Convolutions on the Symmetric Group,II

In a previous paper we defined some “cumulants of matrices” which naturally converge toward the free cumulants of the limiting non commutative random variables when the size of the matrices tends to infinity. Moreover these cumulants satisfied some of the characteristic properties of cumulants whenever the matrix model was invariant under unitary conjugation. In this paper we present the fitting cumulants for random matrices whose law is invariant under orthogonal conjugation. The symplectic case could be carried out in a similar way.     

混合阵列的收敛性

该文引入了混合阵列的概念,讨论了混合阵列的完全收敛性与依概率收敛性.所得结果,推广了行独立随机变量阵列相应的结果.此外还得到了一般随机变量阵列的完全收敛性与依概率收敛性.     

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.     

Asymptotical behavior of the variance of sums of random variables with random replacements

In this paper, we introduce a scheme of summation of independent random variables with random replacements. We consider a series of double arrays of identically distributed random variables that are row-wise independent, but such that neighboring rows contain a random common part of the repeating terms. By this-scheme we bscribe a model of strongly dependent noise. To investigate the sample mean of this noise, we consider the sum of random variables over the whole double array and its conditional variance with respect to replacements. For columns of the arrays we prove a covariance inequality. As a corollary of it, we demonstrate the law of large numbers for conditional variances. Bibliography: 4 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 216, 1994, pp. 124–143. Translated by A. Sudakov.     

Free and Non-Free Subgroups of the Group UT(∞, ℤ)

We provide a method to find free groups of rank two in the group of infinite unitriangular matrices. Our groups are generated by two block-diagonal matrices, namely of the form A = diag(C, C, C…), B = diag(I _t , C, C…), where C is a matrix of finite dimension.

We give a necessary and sufficient condition for A and B defined above to generate a free group when C is a transvection. We formulate a sufficient condition to generate a free group, when C is a product of any number of commuting transvections.

We provide a classification of groups defined above, when C is of degree 3 or 4.     

NA随机变量阵列的完全矩收敛性

利用NA随机变量的矩不等式和截尾方法,研究了NA随机变量阵列的完全矩收敛性,给出了证明NA随机变量阵列完全矩收敛性的一些充分条件.所得结果推广了已有文献关于NA随机变量的相应结果.