φ－满射环上GLｎ（R）中元素的三角分解

本文结果是：设Ａ是φ－满射环Ｒ上的非拟纯量可逆ｎ×ｎ矩阵，β_j，γ_j（1≤ｊ≤ｎ）是Ｒ中任意元素，它们满足Π_j=1^{nβ_jγ_j＝ｄｅｔＡ，则存在ｎ阶阵Ｂ和Ｃ满足ＰＡＰ－１＝ＢＣ，其中Ｂ是下三角阵，Ｃ是上三角阵，Ｐ∈ＧＬ_ｎ（Ｒ）．进一步，可以取Ｂ使β_j（１≤ｊ≤ｎ）位于Ｂ的主对角线上，同时可以取Ｃ使γ_j（１≤ｊ≤ｎ）位于Ｃ的主对角线上．}     

体上右线性方程组的反问题

设Ｆ，Ｋ，Ω分别表示一个任意的体、一个具有对合反自同构的体和一个实四元数体，Ｆ^ｎ表示Ｆ上的ｎ维右向量空间．本文推广和改进了实线性方程组的反问题及一系列结果，解决了Ｆ上右线性方程组更具一般性的反问题（简称ＩＰＳ）：给定ｂ∈Ｆ^s和α_ｉ∈Ｆ^ｎ（ｉ＝１，…，ｍ≤ｎ）满足ｒａｎｋ［α₁，…，α_m］＝ｍ，求所有的ｓ×ｎ矩阵Ａ使Ａα_ｉ＝ｂ（ｉ＝１，…，ｍ）．当ｓ＝ｎ时     

Am×n矩阵的加边矩阵的奇异性问题

给定m×n阶矩阵A,我们给出了它的加边矩阵M=[A B C O] (1)为非奇的充分必要条件。其中O为r₁×r₂阶零矩阵。把M的逆矩阵记为分块形式M^-1=[A₁ B₂ C₃ O₄]其中C₁为n×m、C₂为n×r₁、C₃为r₂×m、C₄为r₂×r₁阶矩阵。在一定条件下,我们证明了其中的C₁为A的广义逆矩阵A⁺。     

关于图Kn-H2n+i(i=1,2)的升分解

Ｙｏｕｓｅｆ．Ａｌａｖｉ等人在文献［１］中定义了一种新分解（Ａｓｃｅｎｄｉｎｇ Ｓｕｂｇｒａｐｈ Ｄｅｃｏｍｐｏｓｉ－ ｔｉｏｎ），即“升分解”，并且猜想：任意有正整数条边的图都可以升分解．本文证明了下面两个结 论： １．Ｋ_n-H_2n+1可以升分解，其中Ｈ_2n+1为含有２ｎ＋１条边的Ｋ_n的子图； ２．Ｋ_n-H_2n+2可以升分解，其中Ｈ_2n+2为含有２ｎ＋     

GAOR迭代法和Jacobi迭代法的敛散关系

本文将文［１］中ＡＯＲ法和Ｊａｃｏｂｉ法同时敛散的结论推广到ＧＡＯＲ法．证明了当Ｊａｃｏｂｉ矩阵Ｂ非负时，解线性方程组Ａｘ＝ｂ（Ａ为不可约矩阵）的ＧＡＯＲ法（０≤γ_ｉ＜ω_ｉ≤１，ｉ＝１，２，…，ｎ）和Ｊａｃｏｂｉ法同时敛散，给出了其谱半径ρ（Ｌ_Ｒ，Ω）和ρ（Ｂ）之间的关系．     

关于广义Calderon－Zygmund算子

本文讨论了θ（ｔ）型和（ｌｏｇ，θ）型Ｃａｌｄｅｒóｎ－Ｚｙｇｍｕｎｄ算子在加权Ｈａｒｄｙ型空间ＨＡ_w^p上的有界性，θ（ｔ）型Ｃａｌｄｅｒóｎ－Ｚｙｇｍｕｎｄ算子在Ｈａｒｄｙ型加权块空间上的有界性，以及广义的ｗ－Ｃａｌｄｅｒóｎ－Ｚｙｇｍｕｎｄ算子是Ｈ^Ap_w到ＨＡ^p上的有界算子．     

半正定分块矩阵和一个线性矩阵方程及其反问题

一个实的（未必对称）ｎ×ｎ矩阵Ａ称为半正定的，如果对任意非零的ｎ维行向量ｘ，均有ｘＭｘ^t≥０．本文给出了一个分块ｎ×ｎ矩阵为半正定的充要条件．另外，我们讨论了线性矩阵方程ＡＸ＝Ｂ对解附加种种条件下的解．我们应用矩阵在相抵下的标准形给出了这一方程的相容性的充要条件．还给出这个方程的反问题在对解附加各种条件下的解．     

矩阵方程AX=B的实部正定解

本文主要讨论了矩阵方程ＡＸ＝Ｂ（其中Ａ，Ｂ∈Ｃ^ｍ×ｎ）的实部正定解的存在性，并在矩阵方程ＡＸ＝Ｂ有实部正定解时，给出了通解的表达式．     

Dirac定理的局部化与Hamilton图

设Ｇ为一个ｎ阶２－连通图，ｎ≥３．若｜Ｄ_ｎ／２（Ｋ_１，３）｜≥２且满足下述条件之一：ｉ）｜Ｄ_ｎ／２（Ｋ_１，３＋ｅ）｜≥２，ii）若Ｋ_１，３＋ｅ→Ｇ，ｘｙ(?)Ｅ（Ｋ_１，３＋ｅ），则ｍａｘ｛ｄＧ（ｘ），ｄＧ（ｙ）｝≥ｎ／２，则Ｇ是一个Ｈａｍｉｌｔｏｎｉａｎ图或其闭包为ｓＰ|⊕Ｈ，这里ｓＰ⊕Ｈ是一类极小２－边连通图．     

关于广义特征值估计的一个Gerschgorin型定理

关于广义特征值估计的一个Ｇｅｒｓｃｈｇｏｒｉｎ型定理刘裔宏（中南工业大学）设Ｃｎ这复ｎ维向量空间，Ｃ（ｎ×ｎ）为ｎ×ｎ复矩阵空间。对于普通特征值问题Ａｘ＝λｘ，Ｇｅｒｓｃｈｇｏｒｉｎ在１９３７年得到著名的Ｇｅｒｓｃｈｇｏｒｉｎ定理［１］：设Ａ＝（ａ（...     

Extreme values of the sum of squares of degrees of bipartite graphs

In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Radius of convexity of certain classes of analytic functions

We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。