可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

关于带宽极值问题的一些结果

本文研究的问题是确定f(p,B）的值，也就是给定顶点数p和带宽B，求满足最大度不超过B的连通图的最小边数，本文给出了一些f(p,B）的值及相应极图。     

Submanifolds associated with graphs

In this paper we present an interesting relationship between graph theory and differential geometry by defining submanifolds of almost Hermitian manifolds associated with certain kinds of graphs. We show some results about the possibility of a graph being associated with a submanifold and we use them to characterize CR-submanifolds by means of trees. Finally, we characterize submanifolds associated with graphs in a four-dimensional almost Hermitian manifold.

     

4英寸热氧化硅衬底上磁性隧道结的微制备

就如何在4英寸热氧化硅衬底上沉积高质量的磁性隧道结纳米多层薄膜材料和如何利用光刻方法微加工制备均匀性较好的磁性隧道结方面做了初步研究，并对磁性隧 道结的磁电性质及其工作特性进行了初步测量和讨论.利用现有的光刻设备和工艺条 件在4英寸热氧化硅衬底上直接制备出的磁性隧道结，其结电阻与面积的积 矢的绝对误差在10% 以内，隧穿磁电阻的绝对误差在7% 以内，样品的磁性隧道结性质具有较好的均匀性和一致性，可以满足研制磁随机存储器存储单元演示器件的基本要求. 关键词： 磁性隧道结 隧穿磁电阻 磁随机存储器 4英寸热氧化硅衬底     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

单圈图的最大特征值序

主要讨论了单圈图按其最大特征值进行排序的问题，确定了该序的前六个图。     

最大2-正则诱导子图的长度

设G是2-连通图，c(G)是图G的最长诱导圈的长度，c′(G)是图G的最长诱导2-正则子图的长度。本文我们用图的特征值给出了c(G)和c′(G)的几个上界。     

Identifying several biased coins encountered by a hidden random walk

Suppose that attached to each site z ∈ ? is a coin with bias θ(z), and only finitely many of these coins have nonzero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}_z∈?, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of ?. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.