关于任意随机序列的强收敛性

该文的目的是要研究任意随机序列的强极限定理。作为推论，得到了一类鞅差序列的强大数定律，一类随机序列公平比的强极限定理，以及任意随机序列部分和估计定理。      

变参数非等间距GM(1,1)模型及应用

在对非等间距序列建模时,考虑到序列本身的特点,结合GM(1,1)模型的建模过程,提出了一种对非等间距序列建立变参数GM(1,1)模型的方法,并将其应用于具体实例进行分析,计算结果表明本文提出的方法具有较高的精度,从而为解决非等间距序列的拟合及预测问题提供了一种比较好的思路.     

基于混沌序列的密钥生成新方法

设计了一种从混沌序列生成密钥的新方法.其基本原理是从混沌序列依次取若干数据构成实值序列,将其按非线性规则映射成二值序列,再用实值序列和任意指定序列分别置乱这个二值序列,被置乱后的二值序列即为所生成密钥.实验表明,在混沌密码体制研究中,这种密钥较一般序列密钥更具有独立性、均匀性和不可预测性.     

全变差有界函数列的一致(R)可积性

给出了一致有界单调函数列一致可积性定理 ,由此得出全变差序列有界的收敛函数列的一致可积性 .说明了该结论可判断一些非一致收敛函数列的逐项积分性质 .     

Hilbert irreducibility sequences and nonstandard arithmetic

We give sufficient conditions for a sequence of integers to be a Hilbert irreducibility sequence and give such a sequence explicitly.     

Hilbert空间中有效序列的刻画与扰动

本文研究了Hilbert空间中的有效序列,通过引入序列的伴随序列,给出了有效序列的一个等价刻画,接着讨论了保持向量序列有效性的线性算子的性质,证明了一个线性算子将任意有效序列映射为有效序列当且仅当它是酉算子;最后,给出了正规正交基中添加一个单位向量后所得到的序列是有效序列的一个充要条件.     

弱相依随机序列的若干新结果(英文)

设{Xn,n≥1}为-混合序列. 利用随机变量的截尾方法和-混合序列的三级数定理,讨论了-混合序列的收敛性质,并且得到了-混合序列的一类强极限定理,这些结果推广了独立序列的相应结果.最后研究了-混合序列加权和的强稳定性.     

On the spectral sequence constructors of Guichardet and Stefan

The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence.     

Topological sequence entropy for maps of the interval

A result by Franzová and Smítal shows that a continuous map of the interval into itself is chaotic if and only if its topological sequence entropy relative to a suitable increasing sequence of nonnegative integers is positive. In the present paper we prove that for any increasing sequence of nonnegative integers there exists a chaotic continuous map with zero topological sequence entropy relative to this sequence.

     

任意随机变量序列泛函及其随机变换的一类极限定理

采用鞅方法研究对任意随机变量序列普遍成立的强极限定理.并作为推论得到了m阶马氏过程,鞅序列,鞅差序列,独立随机变量序列的一类强极限定理.并把赌博系统的随机变换概念推广到任意随机变量序列的情况,得到任意随机变量序列随机选择与公平比的若干极限定理.     

Positivity of linear transformations of mean-starshaped sequences

In this paper, we give the necessary and sufficient conditions for a linear transformation of a mean-starshaped sequence to be positive. Using this result, we obtain the necessary and sufficient conditions for a lower triangular matrix to preserve the mean-starshape of a sequence and we discuss some special cases of linear transformations. Our next result deals with the convergence of a sequence of mean-starshaped sequences to any given mean-starshaped sequence and the positivity of a linear operator on the set of mean-starshaped sequences.     

Graphic sequences with unique realization

A realization of an integer sequence means a graph which has this sequence as its degree sequence. This paper gives some characterizations of the sequences with unique labeled realization and also provides an effcient algorithm for testing if a sequence has a unique unlabeled realization.     

一种混沌多相伪随机序列

提出了一种混沌多相伪随机序列生成方法，推导出通过Logistic映射产生独立同分布多相序列的充分条件，即根据混沌轨迹的概率密度分布把混沌吸引子划分为2n个区域，对混沌轨迹进行采样间隔为n的采样，对照轨道点所处位置与相应的序列元素之间的映射关系，可以得到独立、均匀分布的2n相伪随机序列。数值统计分析支持以上研究结果并表明该序列具有较高的复杂度。此外文中给出了该序列生成的快速算法和一般表达式。该序列可用于信息安全、扩频通信等众多领域。      

数列x_(n_m)~r_(n_m+p)审敛原理

“数列xnm~rnm+p审敛原理”,是数列柯西审敛原理的等价命题.采用“数列xnm~rnm+p审敛原理”判别数列(或数项级数)的敛散性比采用柯西审敛原理更便捷;“数列xnm~rnm+p审敛原理”推广了已有的判别数列(或数项级数)敛散性法则,扩大了已有的判别数列(或数项级数)敛散性法则的应用范围.     

Weak and strong convergence theorems of an implicit iteration for a countable family of continuous pseudocontractive mappings

To approximate a common fixed point of a countable family of continuous pseudocontractive mappings, we introduce an implicit iteration sequence. A necessary and sufficient condition for the convergence of a sequence of such iterates for countably many continuous pseudocontractive mappings is given. We also prove the convergence theorems of an implicit iteration sequence for a countable family of strictly pseudocontractive mappings.     

Prediction properties of some extrapolation methods

Convergence acceleration methods consist in the construction of a sequence converging faster than the initial sequence. Each member of the new sequence is a guess for the limit and it is computed from a restricted number of terms of the initial sequence. It is shown herein how convergence acceleration methods can be used to predict the next (unknown) term of the initial sequence instead of its limit. Particular emphasis on Aitken's △² process and the E-algorithm is placed.     

整数偶序列为蕴含强连通的Beineke－Harary判准

一个由ｎ个非负整数有序对构造的序列是有向可图的,如果它是某个有向图的度序列．一个有向可图序列是蕴含强连通的,如果它是某个强连通有向图的度序列．Ｂｅｉｎｅｋｅ和Ｈａｒａｒｙ给出了一个有向可图序列为蕴含强连通的判准．Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性证明是“相当长”的（见［１］）．本文的目的是给出Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性的一个简短证明．     

Makespan minimization in machine dominated flowshop

In a flowshop scheduling problem, a set of jobs is processed by a set of machines. The jobs follow the same sequence in all machines. We study the flowshop scheduling problem under a new case of machine dominance that is often found in the manufacturing of computers and electronic devices. We provide a formula for makespan value for a given sequence, show that the makespan value depends only on certain jobs in the sequence, and present an algorithm that finds a sequence with minimum makespan. Numerical examples of the solution approaches are provided.     

Approximations for chromatic polynomials

A sequence of finite graphs may be constructed from a given graph by a process of repeated amalgamation. Associated with such a sequence is a transfer matrix whose minimum polynomial gives a recursion for the chromatic polynomials of the graphs in the sequence. Taking the limit, a generalised “chromatic polynomial” for infinite graphs is obtained.     

On powers of the Catalan number sequence

The Catalan number sequence is one of the most famous number sequences in combinatorics and is well studied in the literature. In this paper we further investigate its fundamental properties related to the moment problem and prove for the first time that it is an infinitely divisible Stieltjes moment sequence in the sense of S.-G.  Tyan. Besides, any positive real power of the sequence is still a Stieltjes determinate sequence. Some more cases including (a) the central binomial coefficient sequence (related to the Catalan sequence), (b) a double factorial number sequence and (c) the generalized Catalan (or Fuss–Catalan) sequence are also investigated. Finally, we pose two conjectures including the determinacy equivalence between powers of nonnegative random variables and powers of their moment sequences, which is supported by some existing results.