独立随机序列加权和的强收敛性

本文研究独立随机变量序列加权和的强收敛性,利用截尾法和Borel-Cantelli引理,证明了加权系数ank为列阵情形的强收敛性,在一般双下标加权系数的加权部分和的强收敛性,并对Jamison型加权部分和情形证明了其强收敛的充要条件,推广了Chow与Teicher(1971)[3]的相应结果.     

ψ-混合序列加权和的完全收敛性

研究Ψ-混合序列加权和的完全收敛性,证明了一般双下标加权系数的加权部分和的完全收敛性,改进了杨善朝的结果.     

两两NQD列加权和的安全收敛性

本文研究两两NQD系加权和的完全收敛性，证明了一般双下标加权系数的加权部分和的完全收敛性，改进了吴群英（2002）的结果。     

两两NQD阵列加权和的完全收敛性

本文研究行两两NQD阵列加权和的完全收敛性,证明了一般双下标加权系数的加权部分和的完全收敛性,推广了文献[8]的结果.     

算子稳定随机向量序列的一些极限结果

对于独立同分布的没有Gauss分量的指数为可逆线性算子A的算子稳定的R~d值随机向量序列,本文通过积分检验讨论了其部分和及加权和(包括一些经典的加权和,如Cesàro加权和,后置和方式,Euler可和方式,Borel可和方式,几何加权和等)的极限结果.由此得到了部分和及加权和在相对于A的谱分解下的Chover型重对数律,这是与A的特征值的实部有关的结果.     

两两NQD列的Lp收敛性和完全收敛性

在较宽泛的条件下研究了不同分布两两NQD列加权和的收敛性质,利用矩不等式和截尾方法,获得了一般双下标加权系数的加权部分和的LP收敛性和完全收敛性定理,推广了前人的相应结果.     

关于两两PQD列的Jamison型加权乘积和的强稳定性及乘积和的Marcinkiewicz型强大数律

本文讨论了不同分布两两PQD列的Jamison型加权部分和加权乘积和的强稳定性，讨论了它们的部分和与乘积和的Marcinkiewicz型强大数律，改进、推广了Jamison等（1965），Etemadi(1983），Birkel(1989）的相应结果。     

变系数部分线性模型的加权随机约束s-K估计

研究随机约束条件下半参数变系数部分线性模型的参数估计问题,当回归模型线性部分变量存在多重共线性时,基于Profile最小二乘方法、s-K估计和加权混合估计构造参数向量的加权随机约束s-K估计,并在均方误差矩阵准则下给出新估计量优于s-K估计和加权混合估计的充要条件,最后通过蒙特卡洛数值模拟验证所提出估计量的有限样本性质.     

ρ-混合序列加权和的完全收敛性

本文讨论了不同分布ρ-混合序列部分和的完全收敛性,建立了一个定理.然后通过此非加权和的完全收敛性定理来研究加权和的完全收敛性定理,从而改进了前人所获得的已有的一些结果.     

对算术-几何不等式的两种推广与改进

将关于一组正数的加权算术-几何不等式推广为关于两组正数的改进型加权算术-几何不等式,其思路可为部分已有结论提供新的证明方法.突破关于自然对数的加权算术-几何不等式对具体函数的依赖,给出并证明了关于对数凸函数的加权算术-几何不等式.     

Identities on Bell polynomials and Sheffer sequences

In this paper, we study exponential partial Bell polynomials and Sheffer sequences. Two new characterizations of Sheffer sequences are presented, which indicate the relations between Sheffer sequences and Riordan arrays. Several general identities involving Bell polynomials and Sheffer sequences are established, which reduce to some elegant identities for associated sequences and cross sequences.     

最佳跳频序列族的设计与分析

本文提出了基于ｐ元广义ＧＭＷ序列和ｐ元Ｋａｓａｍｉ序列构造跳频序列族的方法,证明了基于广义ＧＭＷ序列所构造的跳频序列族具有最佳Ｈａｍｍｉｎｇ相关特性,而基于Ｋａｓａｍｉ序列所构造的跳频序列族不具有最佳Ｈａｍｍｉｎｇ相关特性。     

Ordering sequences by permutation transducers

To extend a natural concept of equivalence of sequences to two-sided infinite sequences, the notion of permutation transducer is introduced. Requiring the underlying automaton to be deterministic in two directions, it provides the means to rewrite bi-infinite sequences. The first steps in studying the ensuing hierarchy of equivalence classes of bi-infinite sequences are taken, by describing the classes of ultimately periodic two-sided infinite sequences. It is important to make a distinction between unpointed and pointed sequences, that is, whether or not sequences are considered equivalent up to shifts. While one-sided ultimately periodic sequences form a single equivalence class under ordinary transductions, which is shown to split into two under permutation transductions, in the two-sided case there are three unpointed and seven pointed equivalence classes under permutation transduction.     

Multivariate Sequences of Binomial Type

Using the notion of convolution of binomial sequences it is possible to show that Sheffer sequences, cross sequences, and Steffensen sequences are only mild generalizations of ordinary sequences of binomial type.     

Catalan-like number sequences and Hausdorff moment sequences

Many well-known Catalan-like sequences turn out to be Stieltjes moment sequences (Liang et al. (2016)). However, a Stieltjes moment sequence is in general not determinate; Liang et al. suggested a further analysis about whether these moment sequences are determinate and how to obtain the associated measures. In this paper we find necessary conditions for a Catalan-like sequence to be a Hausdorff moment sequence. As a consequence, we will see that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers, are Hausdorff moment sequences. We can also identify the smallest interval including the support of the unique representing measure. Since Hausdorff moment sequences are determinate and a representing measure for above mentioned sequences are already known, we could almost complete the analysis raised by Liang et al. In addition, subsequences of Catalan-like number sequences are also considered; we will see a necessary and sufficient condition for subsequences of Stieltjes Catalan-like number sequences to be Stieltjes Catalan-like number sequences. We will also study a representing measure for a linear combination of consecutive terms in Catalan-like number sequences.     

二项式型自反多项式

In this paper, we define the self-inverse sequences related to sequences of polynomials of binomial type, and give some interesting results of these sequences. Moreover, we study the self-inverse sequences related to the Laguerre polynomials.     

A NEW FAMILY OF BINARY SEQUENCES WITH OPTIMAL AUTOCORRELATION VALUES AND NICE PSEUDO-RANDOM PROPERTIES

In this paper we present a series of binary sequences which is a generalization of GMW sequences constructed by Scholtz and Welch. Our sequences have optimal autocorrelation values as m -sequences, and nice pseudo-random property. The number of such sequences is counted and the linear span of such sequences is evaluated.     

On Discrete Limits of Sequences of Approximately Continuous Functions and tae-Continuous Functions

We show that the classes of all discrete limits of sequences of ap- proximately continuous functions, of all discrete limits of sequences of derivatives and of all discrete limits of sequences of Baire 1 functions are the same. We describe also the discrete limits of sequences of quasicontinuous functions, and of sequences of almost everywhere continuous functions, and we present anec- essary condition which must be satisfied by the discrete limits of sequences of T_ae -continuous functions.     

On the pseudorandomness of binary and quaternary sequences linked by the gray mapping

Binary and quaternary sequences are the most important sequences in view of many practical applications. Any quaternary sequence can be decomposed into two binary sequences and any two binary sequences can be combined into a quaternary sequence using the Gray mapping. We analyze the relation between the measures of pseudorandomness for the two binary sequences and the measures for the corresponding quaternary sequences, which were both introduced by Mauduit and Sárközy. Our results show that each ‘pseudorandom’ quaternary sequence corresponds to two ‘pseudorandom’ binary sequences which are ‘uncorrelated’.