高阶复线性微分方程解的角域增长性

本文研究了高阶复线性微分方程解在角域上的增长性问题.利用Nevanlinna理论和共形变换的方法,获得了一些使得方程非平凡解在角域上有快速增长的系数条件,这些结果丰富了复方程解在角域上增长性的研究.     

二阶微分方程解的零点分布

应用角域Nevanlinna理论和Ahlfors覆盖曲面理论, 研究了二阶微分方程f’’+A(z)f=0的解的零点分布. 证明了在复平面上至少存在一条半直线, 使得二阶微分方程解在该直线上的零点的径向收敛指数为无穷. 用新的方法证明了伍胜健在文献[5]中的一个定理.     

二阶亚纯系数微分方程解的零点分布

应用角域Nevanlinna理论,研究了二阶亚纯系数微分方程f′′+A(z)f=0的解的零点聚值线和Borel方向之间的关系.推广了文献[5]中的一个定理.     

亚纯函数系数高阶复域微分方程解的不动点

研究了一类亚纯函数系数的高阶线性微分方程的解的不动点问题,应用值分布的理论和方法,得到了复域微分方程亚纯解的不动点性质.     

测度值分枝扩散过程在球域上负荷的概率估计

本文通过对一类非线性微分方程解的性质研究，给出了测度值分枝扩散过程在球域上负荷概率的精确估计     

Gauss积分的应用

本文应用Gauss积分建立了R~n空间中有界域上实调和函数的积分表示式,第二Green公式和波动微分方程的解。     

高阶线性微分方程的解及其解的导数的不动点

研究了复域齐次和非齐次线性微分方程的解及其解的导数的不动点与超级问题,得到了整函数系数的齐次和非齐次线性微分方程的解及其解的导数的不动点的两个结果,所得结果推广了一些相关结果.     

二阶复域微分方程亚纯解的不动点与超级

研究了亚纯函数系数的二阶线性微分方程解的不动点及超级问题,得到了有关复域微分方程亚纯解的不动点性质,并且由于受到微分方程的制约,其性质与一般亚纯函数的不动点性质相比,显得十分有趣.     

有限迭代级整系数线性微分方程解的性质

研究了有限迭代级整系数的复线性微分方程,应用Nevalinna和Ahlfors的角域理论,得到了有关解的迭代级,零点迭代收敛指数以及角域中的零点分布的结果．     

微分方程解刻画的实系数对称微分算子的自共轭域

通过把两个奇异端点的边界条件加以分离,利用微分方程的解(实参数解或复参数解)给出了实系数对称微分算子最大算子域的一种新的分解.进而应用这些解统一对其自共轭域进行描述,给出了自共轭域的完全刻画.     

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.     

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.     

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.     

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)]².