带有无限到达源的Re-entrant Line的稳定性

用Foster判别准则,Weiss[13]给出了带有无限到达源的两站三步re-entrant line的稳定性的充分条件．本文用两种不同的方法得到了其稳定性的充分必要条件,即: 二维随机游动方法和Foster判别准则．同时,我们又用流体模型方法得到了系统稳定的充分条件,大大地简化了Weiss[13]的证明．     

A CLASS OF r-POINT (r+1)ST-ORDER A-STABLE ONE-BLOCK METHODS WITH DAMPING AT THE INFINITE POINT

1　ＩｎｔｒｏｄｕｃｔｉｏｎＦｏｒｓｏｌｖｉｎｇｓｔｉｆｆｉｎｉｔｉａｌｖａｌｕｅｐｒｏｂｌｅｍｓｆｏｒｓｙｓｔｅｍｓｏｆＯＤＥｓｙ′=ｆ(ｙ) ,ｙ(ｔ0 ) =ｙ0 ,ｔ0 <ｔ≤Ｔ ,ｙ0 ,ｙ∈Ｒｍ,ｆ :Ω Ｒｍ →Ｒｍ (1 .1 )ｍａｎｙｐａｒｔｉｃｕｌａｒｏｎｅ ｂｌｏｃｋｍｅｔｈｏｄｓｏｆｔｈｅｆｏｒｍＹｎ+1= ＡＹｎ+ｈ( Ｂ0 Ｆ(Ｙｎ) + Ｂ1Ｆ(Ｙｎ+1) ) , Ａ =Ａ Ｉｍ, Ｂｉ=Ｂｉ Ｉｍ,Ａ ,Ｂｉ∈Ｒｒ×ｒ,Ｙｎ =(ＹＴｎｒ,… ,ｙＴ(ｎ+1)ｒ- 1) Ｔ,Ｆ(Ｙｎ) =(ｆＴ(ｙｎｒ) ,… ,ｆＴ(ｙ(ｎ+1)ｒ- 1) ) Ｔ,ｙｊ≈ ｙ(ｔｊ) ,…     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

无限维s空间内无条件发散级数的Dvoretzky—Hanani定理

本文推广了Ｄｖｏｒｅｔｚｋｙ－Ｈａｎａｎｉ定理于无限维Ｓ空间。     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．     

The Computable Dimension of I-Trees of Infinite Height

We study computable trees with distinguished initial subtree (briefly, I-trees). It is proved that all I-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.     

Discrete semi-stable distributions

The purpose of this paper is to introduce and study the concepts of discrete semi-stability and geometric semi-stability for distributions with support inZ ₊. We offer several properties, including characterizations, of discrete semi-stable distributions. We establish that these distributions posses the property of infinite divisibility and that their probability generating functions admit canonical representations that are analogous to those of their continuous counterparts. Properties of discrete geometric semi-stable distributions are deduced from the results obtained for discrete semi-stability. Several limit theorems are established and some examples are constructed.     

Large families of mutually embeddable vertex‐transitive graphs

For each infinite cardinal κ, we give examples of 2^κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003     

无穷矩阵环上的导子

讨论无穷矩阵环上的导子,证明了环R上有限个元素不为零的无穷矩阵坏的每个导子均可表示为两个特殊导子之和。