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

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

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.     

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.     

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 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’.     

Similarity analysis of DNA sequences based on the EMD method

DNA sequences can be translated into 2D graphs and into numerical sequences; we call the numerical sequences nonlinear signal sequences. We can use the empirical mode decomposition (EMD) method to divide nonlinear signal sequences into a group of well-behaved intrinsic mode functions (IMFs) and a residue, so that we can compare the similarities among DNA sequences conveniently and intuitively. This work tests the method’s suitability by using the mitochondria of four different species.     

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.     

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.     

二项式型自反多项式

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.     

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.     

Bent序列的相关值分布的研究

对已知的Bent序列集的构造方法作了研究,明确地给出了任一Bent序列集相关值的分配情况.同时,利用有限域上一类新的Bent函数,构造出了一类新的Bent序列集,给出了这类Bent序列的线性复杂度.     

On Almost Regular Convergence

Regular convergence of multiple sequences, introduced by G. H. Hardy and F. Móricz, can be generalized to almost convergent sequences in various ways. In the paper, classes of almost convergent double sequences with a kind of uniform regularity are studied, which make these classes similar to the class of regularly convergent sequences. Matrices, which convert sequences from these classes to bounded and convergent double sequences with limits equal to the generalized limits of the original sequences are characterized. The results extend results of F. Móricz and B. E. Rhoades on strongly regular matrices.     

Linear complexity profile of binary sequences with small correlation measure

Summary A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárk?zy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.     

Further discrepancy bounds and an Erdös–Turán–Koksma inequality for hybrid sequences

We consider hybrid sequences, that is, sequences in a multidimensional unit cube that are composed from lower-dimensional sequences of two different types. We establish nontrivial deterministic discrepancy bounds for five kinds of hybrid sequences as well as a new version of the Erdös–Turán–Koksma inequality which is suitable for hybrid sequences.     

Correlation of the two-prime Sidel��nikov sequence

Motivated by the concepts of Sidel??nikov sequences and two-prime generator (or Jacobi sequences) we introduce and analyze some new binary sequences called two-prime Sidel??nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4 we show that these sequences are balanced. In the general case, besides balancedness we also study the autocorrelation, the correlation measure of order k and the linear complexity profile of these sequences showing that they have many nice pseudorandom features.     

关于Lucas数列同余性质的研究

将二项式系数的性质应用到Lucas数列的研究中,并结合Fibonacci数列与Lucas数列的恒等式得到几个有趣的Lucas数列的同余式.     

Suballowable sequences and geometric permutations

We define suballowable sequences of permutations as a generalization of allowable sequences. We give a characterization of allowable sequences in the class of suballowable sequences, prove a Helly-type result on sets of permutations which form suballowable sequences, and show how suballowable sequences are related to problems of geometric realizability. We discuss configurations of points and geometric permutations in the plane. In particular, we find a characterization of pairwise realizability of planar geometric permutations, give two necessary conditions for realizability of planar geometric permutations, and show that these conditions are not sufficient.     

Log-convex and Stieltjes moment sequences

We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) Pólya frequency sequences are infinitely log-concave. We introduce the concept of q-Stieltjes moment sequences of polynomials and show that many well-known polynomials in combinatorics are such sequences. We provide a criterion for linear transformations and convolutions preserving Stieltjes moment sequences. Many well-known combinatorial sequences are shown to be Stieltjes moment sequences in a unified approach and therefore infinitely log-convex, which in particular settles a conjecture of Chen and Xia about the infinite log-convexity of the Schröder numbers. We also list some interesting problems and conjectures about the log-convexity and the Stieltjes moment property of the (generalized) Apéry numbers.     

扩展时间事件图的分析

本文研究了一类扩展时间事件图的分析问题，证明了系统的输出时间序列有三类．有限序列，准周期序列，近似于Dlogp q的序列．