Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

Post李超代数结构的性质

通过post李超代数的定义, 讨论post李超代数结构的基本性质, 给出post李超代数的一些存在性结果, 并利用post李超代数可构造LR超代数和左对称超代数, 给出交换post李超代数结构的相关结果.     

Cycloparaphenylene (CPP) series are molecular models for graphene armchair edges: trends in their aromaticity and cyclic conjugation are evaluated

Cycloparaphenylene ([r]CPP) and cyclacene ([r]CA) series are models for short carbon nanotubes. It is shown that armchair edges in model cycloparaphenylenes possess greater aromaticity and cyclic conjugation than do zigzag edges in model cyclacenes. According to Aihara’s bond resonance energy (BRE) and Bosanac and Gutman energy effect (ef) measurements, cycloparaphenylenes are twice as aromatic as cyclacenes. The general solution of all eigenvalues of all members of the cycloparaphenylene series is given. The origin of the recurrence of some eigenvalues are determined.     

正规矩阵特征值扰动的新估计

设A,B均为正规矩阵,关于正规矩阵的特征值扰动,有结论 (n∑i=1︱μτ(i)-λi︱2)(1/2)≤n(1/2)‖E‖F,其中λi,μi分别为A,B的特征值.通过新的方法证明给出特征值扰动上界的新估计,并改进了以上结论.     

化学方程式配平的矩阵解法

基于矩阵解方程的理论，定义出了一个化学元素矩阵，从而找到了一种配平化学方程式的新方法，称之为矩阵解法。     

Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

广义正定矩阵的分析与应用

分析了广义正定矩阵,导出了矩阵广义正定的若干新判定准则,并以应用实例研究了其在神经网络中的应用.