一类强极限定理与矩母函数方法

本文利用似然比的概念，研究离散随机变量序列的极限性质，得到了一类用不等式表示的强极限定理．证明中结合区间剖分法，提出了将矩母函数的工具应用于强极限定理的研究的一种途径．     

The Existence of the Complete and Completely Distributive Lattices

ＴｈｅＥｘｉｓｔｅｎｃｅｏｆｔｈｅＣｏｍｐｌｅｔｅａｎｄＣｏｍｐｌｅｔｅｌｙＤｉｓｔｒｉｂｕｔｉｖｅＬａｔｔｉｃｅｓＢａｔＲｕｉｐｕ（白瑞蒲）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＨｅｂｅｉＵｎｉｖｅｒｓｉｔｙ，Ｂａｏｄｉｎｇ，０７１００...     

带有中止检查规则（n－i）的CSP－1方案

本文引人转移概率母函数及幂级数等方法讨论带有中止规则（ｎ＊－ｉ）的连续抽样方案ＣＳＰ－１的中止概率Ｐ＊得到了Ｐ＊作为ＣＳＰ－１方案的度量的理论特性，证明了Ｄｏｄｇｅ型ＣＳＰ－１方案与带有中止规则（ｎ＊－ｉ）的ＣＳＰ－１方案具有相同的ＡＯＱ，ＡＦＩ，ＯＣ函数．文末还给出了一些数值结果．     

su(1,1)代数在群参数空间的实现

本文提出了研究谱生成代数的一条新途径。构造了su(1,1)代数在su(1,1)群的参数空间的实现的各种可能类型。它们可以是三个变量的亦可以是两个变量的。     

Invariant record processes and applications to best choice modelling

Let X₁, X₂,…be identically distributed random variables from an unknown continuous distribution. Further let I_r(1), I_r(2),…be a sequence of indicator functions defined on X₁, X₂,…by I_r(k) = 0 if k < r, I_r(k) = 1 if X_k is a r-record AND = 0 otherwise. Suppose that we observe X₁, X₂,… at times T₁ < T₂ <… where the T_k's are realisations of some regular counting process (N(τ)) defined on the positive half-line. Having observed [0, τ], say, the problem is to predict the future behaviour of the counting processes (R_r(τ, s))_sτ = # r-records in [τ, s]. More specifically the objective of this paper is to show that these processes can be (inhomogeneous) Poisson processes even if (N(τ))_τ0 has dependent increments.

The strong link between optimal selection and optimal stopping of record sequences or record processes, perhaps not fully recognized so far, is pointed out in this paper. It is shown to lead to a unification of the treatment of problems which, at first sight, are rather different. Moreover the stopping of record processes in continuous time can lead to rigorous and elegant solutions in cases where dynamic programming is bound to fail. Several examples will be given to facilitate a comparison with other methods.     

The Leading Ideal of a Complete Intersection of Height Two,Part III

Let (S, 𝔫) be an s-dimensional regular local ring with s > 2, and let I = (f, g) be an ideal in S generated by a regular sequence f, g of length two. As in [2 Goto , S. , Heinzer , W. , Kim , M.-K. ( 2006 ). The leading ideal of a complete intersection of height two . J. Algebra 298 : 238 – 247 . [Google Scholar], 3 Goto , S. , Heinzer , W. , Kim , M.-K. ( 2007 ). The leading ideal of a complete intersection of height two, II . J. Algebra 312 : 709 – 732 . [Google Scholar]], we examine the leading form ideal I* of I in the associated graded ring G: = gr_𝔫(S). Let μ _G (I*) = n ≥ 3, and let {ξ₁, ξ₂,…, ξ _n } be a minimal homogeneous system of generators of I* such that ξ₁ = f* and ξ₂ = g*, and c _i : = deg ξ _i  ≤ deg ξ _i+1: = c _i+1 for each i ≤ n ? 1. For m ≤ n, we say that K _m : = (ξ₁,…, ξ _m )G is an ideal generated by part of a minimal homogeneous generating set of I*. Let D _i : = GCD(ξ₁,…, ξ _i ) and d _i  = deg D _i for i with 1 ≤ i ≤ m. Let K _m be perfect with ht _G K _m  = 2. We prove that the following are equivalent: 1. deg ξ _i+1 = deg ξ _i  + (d _i?1 ? d _i ) +1, for all i with 3 ≤ i ≤ m ? 1;

2. deg ξ _i+1 ≤ deg ξ _i  + (d _i?1 ? d _i ) +1, for all i with 3 ≤ i ≤ m ? 1.

Furthermore, if these equivalent conditions hold, then K _m  = I*. Moreover, if e(G/K _m ) = e(G/I*), we prove that K _m  = I*. We illustrate with several examples in the cases where K _m is or is not perfect.     

m阶马氏链关于广义随机选择系统的极限定理

主要研究广义随机选择系统中的m阶非齐次马氏链随机转移概率调和平均的a.s.收敛的强极限定理.在证明中采用了一种把网微分法与条件矩母函数相结合应用于马氏链强极限定理研究的新途径.作为推论,得到m阶非齐次马氏链随机条件概率一个公平比的强极限定理,并将已有的结果加以推广.     

Pattern avoidance in binary trees

This paper considers the enumeration of trees avoiding a contiguous pattern. We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous. We investigate the equivalence classes combinatorially. Toward establishing bijective proofs of tree pattern equivalence, we develop a general method of restructuring trees that conjecturally succeeds to produce an explicit bijection for each pair of equivalent tree patterns.     

Using Cumulant Functions in Queueing Theory

A new approach for obtaining the transient solution for the first and second moments of the system size in a finite capacity M/M/1 queueing systems is developed. The approach uses the cumulant generating function which has previously been used in the analysis of compartmental models but has not been used to analyze queueing systems.