图的度序列

图的度序列是图论研究中一个重要的课题．至今已发表了４００余篇文章．本文概述这一课题的某些进展，其中包括了可图序列的判准、蕴含Ｐ可图序列和强迫Ｐ可图序列的一些主要结论，同时列出了一些有待进一步研究的问题．     

取整函数及其生成的数列

讨论三类整数列，这些数列的后项均是由前项与非整数乘积再取整后得到的，对应的取整函数分别为四舍五入取整函数、下取整函数、上取整函数．结果表明这三类整数列均为二阶线性递归数列．     

Combinatorics on words in symbolic dynamics: The quadratic map

This paper is contributed to the combinatorial properties of the MSS sequences, which are the periodic kneading words of quadratic maps defined on a interval. An explicit expression of adjacency relations on MSS sequences of given lengths is established.     

基于灰色关联度的区间信息指派问题研究

研究了损益矩阵为区间数的不确定型指派问题,给出了区间数关联度的计算公式,提出了一种基于区间数关联度的区间信息指派方法,最后通过实例验证了该方法的实用性和有效性.     

一类随机变量序列部分和的强大数定律

设{Xn,n≥1}是随机变量序列.文[4]在二阶矩限制下,获得了任意随机变量序列的Hajek-Renyi型不等式,并给出了随机变量序列的强大数定律.本文利用胡舒合等获得的强大数定律,给出了随机变量序列的一些几乎必然收敛性,并给出了结果在PA,NA和两两NQD序列场合下的应用.     

On the combinatorics of an origami model

We consider the problem of how the assembly process of an origami model, made up of similar pieces, can be completed given that at each step there are several choices. A result is given in the language of graphs that provides a sufficient condition under which assembly of the model will never fail.     

数列极限迫敛性定理的推广(英文)

极限论是微积分中基础和重要的概念.数列极限的迫敛性定理既能判断数列的收敛性,也给出其极限值。通过对数列极限迫敛性定理的条件加以改进,得到了它的推论,并用一个例子说明了该推论的应用。     

循环差幂积的不等式

对正数序列给出了循环差幂积的定义 ,讨论了单调序列循环差幂积的有关性质及不等式     

关于数列{n√an}的不等式

研究一类正项数列{n√an},给出其一系列不等式,改进和推广了Minc—Sathre不等式及现有的结果．     

On a conjecture of Brualdi and Shen on block transitive tournaments

The following conjecture of Brualdi and Shen is proven in this paper: let n be partitioned into natural numbers no one of which is greater than (n + 1) / 2. Then, given any sequence of wins for the players of some tournament among n players, there is a partition of the players into blocks with cardinalities given by those numbers, and a tournament with the given sequence of wins, that is transitive on the players within each block. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 215–230, 2003     

Combinatorics on words in symbolic dynamics: the antisymmetric cubic map

This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of given lengths and the parity-alternative property in some sets of such words are established.     

蕴含W_6-可图序列

对于给定的图H,如果可图序列π有一个实现包含H作为子图,则称π是蕴含H-可图的.本文给出了可图序列π蕴含W_6-可图的一个充分条件,其中W_r是r个顶点的轮图.     

蕴含W6-可图序列

摘要对于给定的图日,如果可图序列π有一个实现包含日作为子图,则称丌是蕴含H-可图的．本文给出了可图序列π蕴含W6-可图的一个充分条件,其中Wτ是τ个顶点的轮图．     

On Waiting Time for Reversed Patterns in Random Sequences

By using a combinatorial method it is shown that for every finite pattern, the distribution of the waiting time for the reversed pattern coincides with that of the waiting time for the original pattern in a multi-state dependent sequence with a certain type of exchangeability. The number of the typical sequences until the occurrence of a given pattern and that of the typical sequences until the occurrence of the reversed pattern are shown to be equal. Further, the corresponding results for the waiting time for the r-th occurrence of the pattern, and for the number of occurrences of a specified pattern in n trials are also studied. Illustrative examples based on urn models are also given.     

Strebel differentials and Hamilton sequences

Let T(S) be a Teichmüller space of a hyperbolic Riemann surface S, viewed as a set of Teichmüller equivalence classes of Beltrami differentials on S. It is shown in this paper that for any extremal Beltrami differential μ₀ at a given point τ of T(S), there is a Hamilton sequence for μ₀ formed by Strebel differentials in a natural way. Especially, such a kind of Hamilton sequence possesses some special properties. As applications, some results on point shift differentials are given.     

On the ergodicity conditions for stochastically recursive sequences

The ergodicity criterion for stochastically recursive sequences is given in terms of imbedded subsequences. Several examples are considered.     

Exact Distribution of the Distances between Any Occurrences of a Set of Words

The distribution of the distance between two (or more) successive occurrences of a specific word in a random sequence of letters is known under different models. In this paper, a more general problem is studied: the distribution of the distance between two (or more) successive occurrences of any word of a given set under a Markov model for the sequence. The generating function and a recurrence for obtaining the probabilities are given. These results are applied to study the distribution of the "CHI" motif in the genome sequence of Haemophilus influenzae.     

两个新的三角不等式及应用

给出两个新的三角不等式 ,并将其应用于讨论角成等比的三角形形状 .     

Orlicz序列空间的强暴露点

本文给出赋Orlicz范数和赋Luxemburg范数的Orlicz序列空间的单位球面上的强暴露点的充分必要条件．     

求数列极限的两个定理

本文给出关于数列极限的两个定理 .