Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Rank, term rank, and chromatic number

Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound and we show that this bound is sharp.     

An example of a two-sided Wilcoxon signed rank test which is not unbiased

Although the theory of rank tests is rather complete in the one-sided case, it was not even known in 1959, whether the Wilcoxon two-sample test and other similar tests are unbiased against the two-sided alternatives (Lehmann (1959,Testing Statistical Hypotheses, p. 240, Wiley, New York)). A partial answer to this question was given by Sugiura in 1965, who found, that the test named above may be biased (Sugiura (1965,Ann. Inst. Statist. Math.,17, 261–263)). According to Lehmann (1986,Testing Statistical Hypotheses, 2nd ed., pp. 322–324, Wiley, New York) it seems to be still open, whether the same is true for the WILCOXON one-sample test, which is also known as WILCOXON signed rank test. This will be shown in the present paper.     

A new class of Ornstein transformations with singular spectrum

It is shown that for any family of probability measures in Ornstein type constructions, the corresponding transformation has almost surely a singular spectrum. This is a new generalization of Bourgain's theorem [J. Bourgain, On the spectral type of Ornstein class one transformations, Israel J. Math. 84 (1993) 53–63], same result is proved for Rudolph's construction [D. Rudolph, An example of a measure-preserving map with minimal self-joining and applications, J. Anal. Math. 35 (1979) 97–122].     

动力学体系二维数据的秩分析及其应用

详细论证了动力学体系中存在的多种共线性情况,以及在此情况下二维数据阵的秩与独立反应数及组分数的关系.分析了通过增秩这一方式来判断体系组分数的条件.讨论了反应间存在物质交换对数据阵秩的影响.建立起一套通过秩分析判断未知动力学体系中存在的反应组分数、独立反应数以及可能反应机理的方法.将秩分析技术应用到聚苯胺与质子酸反应,初步分析了该体系存在的多种吸光性结构及结构变化.确定了[H＋]=0.01～0.1 mol•L－1范围内,聚苯胺与质子酸反应存在一个三结构两步互变过程.     

Carlsson's rank conjecture and a conjecture on square-zero upper triangular matrices

Let k be an algebraically closed field and A the polynomial algebra in r variables with coefficients in k. In case the characteristic of k is 2, Carlsson [9] conjectured that for any DG-A-module M of dimension N as a free A-module, if the homology of M is nontrivial and finite dimensional as a k-vector space, then $2^r\le N$. Here we state a stronger conjecture about varieties of square-zero upper triangular $N\times N$ matrices with entries in A. Using stratifications of these varieties via Borel orbits, we show that the stronger conjecture holds when $N<8$ or $r<3$ without any restriction on the characteristic of k. As a consequence, we obtain a new proof for many of the known cases of Carlsson's conjecture and give new results when $N>4$ and $r=2$.     

A NUMERICALLY STABLE BLOCK MODIFIED GRAM-SCHMIDT ALGORITHM FOR SOLVING STIFF WEIGHTED LEAST SQUARES PROBLEMS

Recently, Wei in proved that perturbed stiff weighted pseudoinverses and stiff weighted least squares problems are stable, if and only if the original and perturbed coefficient matrices A and A^- satisfy several row rank preservation conditions. According to these conditions, in this paper we show that in general, ordinary modified Gram-Schmidt with column pivoting is not numerically stable for solving the stiff weighted least squares problem. We then propose a row block modified Gram-Schmidt algorithm with column pivoting, and show that with appropriately chosen tolerance, this algorithm can correctly determine the numerical ranks of these row partitioned sub-matrices, and the computed QR factor R^- contains small roundoff error which is row stable. Several numerical experiments are also provided to compare the results of the ordinary Modified Gram-Schmidt algorithm with column pivoting and the row block Modified Gram-Schmidt algorithm with column pivoting.