线性常微分方程组解的特征数的估计

复数域上线性系统ｘ＝Ａ（ｔ）ｘ，当Ａ（ｔ）＝（ａｉｊ（ｔ））ｎ×ｎ具有（ｎ，Ｎ，ｒ） 差异性质且ｒｎ时，解的特征数ｊ有估计λｊ－ｌｉｍｔ→∞１ｔ∫ｔｔ０Ｒｅａｊ（τ）ｄτｎ－１ｒ＋１－ｎｌｉｍｔ→∞１ｔ∫ｔｔ０Ａ（τ）ｄτ，ｊ＝１，２，…，ｎ，其中Ａ（ｔ）＝ｍａｘ｛｜ａｉｊ（ｔ）｜：ｉ，ｊ＝１，２，…，ｎ，ｉ≠ｊ．｝     

Poisson分布参数的渐近最优和可容许的经验Bayes估计

设Ｘ及（Ｘ１，Ｘ２…，Ｘｎ）分别为取自Ｐｏｉｓｓｏｎ分布Ｐ（θ）的当前样本和历史样本，参数θ的先验分布族Ｆ＝｛Γ（ｍ，β）：β＞０｝，其中ｍ＞０已知，Γ（ｍ，β）表示参数为（ｍ，β）的伽玛分布．对ｐ＞０，ｑ＞２的任意两个实数，记ｔｎ＝Ｘ＋∑ｎｉ＝１Ｘｉ＋ｐＸ＋∑ｎｉ＝１Ｘｉ＋ｐ＋ｑ＋（ｎ＋１）ｍ（Ｘ＋ｍ）则在平方损失函数ｌ（θ，ｄ）＝（θ－ｄ）２下，ｔｎ是θ的渐近最优和可容许的经验Ｂａｙｅｓ估计，而且收敛速度为Ｏ（１ｎ）．     

一组互相关联的不等式命题

大家知道，由ｎ元均值不等式可方便地得到如下一个不等式：设ａｉ∈Ｒ＋（ｉ＝１，２，…，ｎ，ｎ≥２），则∑ｎｉ＝１ａｉ∑ｎｉ＝１１ａｉ≥ｎ２；（１）不等式（１）相当有用，对它作适当代换，可引出一组互相关联的不等式命题；首先，对（１）作代换（Ｓ－ａ１，Ｓ－ａ２，…，Ｓ－ａｎ）→（ａ１，ａ２，…，ａｎ），其中Ｓ＝∑ｎｉ＝１ａｉ，得命题１　设ａｉ∈Ｒ＋（ｉ＝１，２，…，ｎ，ｎ≥２），∑ｎｉ＝１ａｉ＝Ｓ，则∑ｎｉ＝１１Ｓ－ａｉ≥ｎ２（ｎ－１）Ｓ　；（２）证明　由（１），∑ｎｉ＝１（Ｓ－ａｉ）∑ｎｉ＝１１Ｓ－…     

变质量高阶非Четаев型非完整约束系统动力学

本文给出了高阶非型约束加在广义虚位移上的限制条件，建立了变质量高阶非型非线性非完整系统的Ｒｏｕｔｈ方程、方程、Ｎｉｅｌｓｅｎ方程和Ａｐｐｅｌｌ方程；给出了高阶非型约束系统“ｄ”与“δ”之间的交换关系，建立了其积分变分原理；并得到了变质量高阶非型约束系统的广义Ｎｏｅｔｈｅｒ守恒律．     

多维指数族分布的参数线性容许估计的一个充分条件

本文利用唯一的Ｂａｙｅｓ估计是容许估计的原理,构造了一个先验分布π１（θ）＝Ｍβ－１（θ）ψ（θ）ｅｘｐ∑ｎｉ＝１∫θｉθｉ０ｂ－ｒｉ（ｔ）ａｉｎｄｔｉ,当它满足一定的条件时,证明了在均方损失下,多维指数族分布ｆθ（ｘ）＝β（θ）ｅｘｐθ′ｘ的参数ｒ（θ）的唯一Ｂａｙｅｓ估计为线性函数ａ′ｘ＋ｂ,因而也是容许估计     

厄米特矩阵的迹的几点性质

应用矩阵Ａ＝（ａｉｊ）∈Ｃｎ×ｎ的弗罗伯尼范数ＡＦ和谱范数ＡＳ，研究厄米特矩阵的迹的性质，得到几个结论：Ｔｒ（ＡＢ）＝∑ｎｉ＝１λｉ∑ｎｊ＝１ｔｉｊμｊ（λｉ，μｊ分别为Ａ，Ｂ的特征值，０≤ｔｉｊ≤１，且∑ｎｉ＝１ｔｉｊ＝１，ｊ＝１，２，…，ｎ）；Ｔｒ（ＡＢ）≤Ｔｒ（Ａ）ＢＳ；Ｔｒ（ＡＢ）Ｈ（ＡＢ）］≤Ｔｒ（ＡＨＡ）［ｍａｘ１≤ｉ≤ｎλｉ］２（λｉ是Ｂ的特征值）等．     

改进的R.Nevanlinna第二基本定理

设ｆ（ｚ）是超越亚纯函数，ｎ为任一非负整数，ε为任意正数，ａ＾（ｉ）ｒ＝（ｖ＝１，２，…，ｑｉ，ｉ＝０，１，…，ｎ）均为有穷非零复数，满足ｍｉｎ／１≤ｖ１＜ｖ２≤ｑｉ｜ａ＾（ｉ）ｖ１－ａ＾（ｉ）ｖ２｜≥δ＞０，ｉ＝０，１，…，ｎ。若ｆ（０）≠０，∞，П＾ｎｉ＝１ｆ（ｉ）（０）≠０，则对０＜ｒ＜＋∞有ｍ（ｒ，ｆ）＋ｍ（ｒ，１／ｆ）＋Σ＾ｕｉ＝０Σ＾ｑｉｒ＝１ｍ（ｒ，ａ＾（ｉ）ｖ，ｆ＾（ｉ）≤（２＋ε     

基于巴斯卡数据成败型元件串联系统可靠性经典精确置信限

设Ａ为由Ｋ个相互独立的成败型元件组成的串联系统，第ｉ个元件的可靠性ｐｉ，ｐｉ未知，ｉ＝１，２，…，Ｋ．设对第ｉ个元件，对于给定的ｍｉ，有ｎｉ个巴斯卡试验数据：Ｘｉ１，Ｘｉ２，…，Ｘｉｎｉ，其中Ｘｉｊ表示对第ｉ个元件进行试验，试验进行到ｍｉ次成功时所需要的试验次数ｊ＝１，２，…，ｎｉ，ｉ＝１，２，…，Ｋ．记Ｔｉ＝Ｘｉ１＋Ｘｉ２＋…＋Ｘｉｎｉ，ｉ＝１，２，…，ｋ．本文研究基于统计量（Ｔ１，Ｔ２，…，Ｔｋ）求串联系统Ａ的可靠性经典精确最优置信下限．     

Iterative Approximation of Fixed Points for Uniformly Continuous and Strongly Pseudocontractive Mappings in Smooth Banach Spaces

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎａｎｄＰｒｅｌｉｍｉｎａｒｉｅｓＬｅｔＸｂｅａｒｅａｌＢａｎａｃｈｓｐａｃｅｗｉｔｈｎｏｒｍｙ·ｙａｎｄｄｕａｌＸ．ＴｈｅｎｏｒｍａｌｉｚｅｄｄｕａｌｉｔｙｍａｐｐｉｎｇｆｒｏｍＸｉｎｔｏ２ＸｉｓｄｅｆｉｎｅｂｙＪ（ｘ）＝｛ｆ∈Ｘ：〈ｘ,ｆ〉＝ｙｘｙ２＝ｙｆｙ２｝,ｗｈｅｒｅ〈·,·〉ｄｅｎｏｔｅｓｔｈｅｇｅｎｅｒａｌｉｚｅｄｄｕａｌｉｔｙｐａｉｒｉｎｇ．Ｉｔｉｓｗｅｌｌ－ｋｎｏｗｎｔｈａｔＸｉｓｕｎｉｆｏｒｍｌｙｓｍｏｏｔｈｉｆａｎｄｏｎｌｙｉｆＪｉｓｓｉ…     

Some Properties of a Class Self—homomorphism of BCI—algebras

ＢｙａＢＣＩ－ａｌｇｅｂｒａｗｅｍｅａｎａｎａｌｇｅｂｒａ（Ｘ；，０）ｏｆｔｙｐｅ（２，０）ｓａｔｉｓｆｙｉｎｇｔｈｅａｘｉｏｍｓ：（１）（（ｘｙ）（ｘｚ））（ｚｙ）＝０；（２）（ｘ（ｘｙ））ｙ＝０；（３）ｘｘ＝０；（４）ｘｙ＝ｙｘ＝０ｘ＝ｙｆｏｒａｎｙｘ，ｙａｎｄｚｉｎＸ．ＦｏｒａｎｙＢＣＩ－ａｌｇｅｂｒａＸ，ｔｈｅｒｅｌａｔｉｏｎ≤ｄｅｆｉｎｅｄｂｙｘ≤ｙｉｆａｎｄｏｎｌｙｉｆｘｙ＝０ｉｓａｐａｒｔｉａｌｏｒｄｅｒｏｎＸ［１］．ＩｎａｎｙＢＣＩ－ａｌｇｅｂｒａＸ，…     

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.     

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.     

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

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

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

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.     

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