GMW序列的生成多项式

给出了两个 GMW序列具有相同生成多项式的充要条件 .并讨论了进一步的结论 .     

有限域Fp2的原根在B2序列中的应用

本文研究了p是奇素数的情况下,有限域Fp2的原根在B2序列中的应用.利用有限域Fp2的原根θ的性质,获得了B2序列A(p,θ)的元素特征,并且利用原根θ的极小多项式构造了两个特殊原根θ-p和θp2-12 p的极小多项式.     

Zpe上本原序列的元素分布

文研究了Zpe上本原序列的元素分布.利用Ga,lois环上的指数和估计和本原序列的迹表示,得到了Zpe中各元素在本原序列的一个周期中出现频率的一个估计.当n＞4e时(n为本原序列生成多项式的次数).我们的估计优于Kuzmin的结果[1].     

序列的一种无组合系数的根表示

本文在讨论了组合数C_x~k等在GF(q)上的多元多项式表示的基础上,给出了序列的一种避免组合系数的根表示法,并利用它对两个有重根的反馈多项式生成序列之积的线性复杂性进行了讨论.     

环Z/(p~e)上本原序列压缩映射的新结果

令Z/(pe)表示整数剩余类环,其中p为素数且e 2为正整数.令f(x)表示Z/(pe)上的n次本原多项式,G′(f(x),pe)表示Z/(pe)上所有由f(x)生成的本原序列构成的集合.设序列a∈G′(f(x),pe),它有唯一的p进制展开a=a0+a1p+···+ae-1pe-1.令φ(x0,x1,...,xe-1)=g(xe-1)+μ(x0,x1,...,xe-2)表示由Fe p到Fp的一个e变元多项式.那么,φ可以诱导出一个从G′(f(x),pe)到F∞p的压缩映射.在p为奇素数且f(x)为强本原多项式的条件下,人们已经证明该压缩映射是保熵的.而本文证明该压缩映射在f(x)为本原多项式的条件下仍然是保熵的.当deg(g(x))2时,我们还要求deg(g(x))为奇数,或者g(x)=xk+∑k-2i=0cixi.     

环导出序列的单一性及还原算法

在文献 ［１］中,从 Ｚ２ｎ上的某些线性递归序列到它的最高位坐标序列的映射的单一性已被证明;本文利用序列的迹表示将此结论推广到任意特征的 Ｇａｌｏｉｓ环上,并且给出一个算法,在已知特征多项式和最高位坐标序列的条件下,还原出本来的环上序列．     

可图序列偏序集的极小元

ｎ项非增非负整数序列是可图的,若是某个阶简单图的度序列．所有项和为２ｍ、迹为ｆ的ｎ项可图序列的集合Ｇ_ｎ,ｍ,ｆ在优超关系下是一个偏序集．本文刻划了偏序集Ｇ_ｎ,ｍ,ｆ的极小元,并确定各种可图序列偏序集中极小元的个数．     

环Z／（p^d）上序列的迹表示及前馈序列空间结构分析

本文利用ｐ－ａｄｉｃ数域理论，给出了乘余类环Ｚ／（ｐ＾ｄ）上线性递归序列的迹表示。并通过应用迹表示，刻划了前馈序列空间Ｇ（ｆ（ｘ））＾ｍ的结构。     

带有退化效应和序列相关运输时间的排序问题

考虑带有退化效应和序列相关运输时间的单机排序问题. 工件的加工时间是其开工时间的简单线性增加函数. 当机器单个加工工件时, 极小化最大完工时间、(加权)总完工时间和总延迟问题被证明是多项式可解的, EDD序对于极小化最大延迟问题不是最优排序, 另外, 就交货期和退化率一致情形给出了一最优算法. 当机器可分批加工工件时, 分别就极小化最大完工时间和加权总完工时间问题提出了多项式时间最优算法.     

递归序列与高阶项式

引　　言关于递归序列与Euler-Bernoulli数和多项式、递归序列与高阶Euler-Bernoulli数和多项式的关系问题的研究一直是国内外许多学者感兴趣的课题,并有了许多研究成果(见[1]～[7]).本文首先对Euler-Bernoulli数和多项式、高阶Euler-Bernoulli数和多项式进行推广,提出高阶多元Euler数和多项式、高阶多元Bernoulli数和多项式的定义,然后讨论它们与递归序列的关系,文中得出的结果是P.F.Byrd[1],R.P.Kelisky[2]和Zhangzhizheng[3]的相应结果的推广和深化.2　定义和引理定义2.1　k阶s元Euler数E(k)v1…vs和k阶s元Bernoulli数B(k)v1…v…     

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.     

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.     

渐近于Hermite多项式的双正交系统

本文利用渐近于Gauss函数的函数类?,给出渐近于Hermite正交多项式的一类Appell多项式的构造方法,使得该序列与?的n阶导数之间构成了一组双正交系统.利用此结果,本文得到多种正交多项式和组合多项式的渐近性质.特别地,由N阶B样条所生成的Appell多项式序列恰为N阶Bernoulli多项式.从而,Bernoulli多项式与B样条的导函数之间构成了一组双正交系统,且标准化之后的Bernoulli多项式的渐近形式为Hermite多项式.由二项分布所生成的Appell序列为Euler多项式,从而,Euler多项式与二项分布的导函数之间构成一组双正交系统,且标准化之后的Euler多项式渐近于Hermite多项式.本文给出Appell序列的生成函数满足的尺度方程的充要条件,给出渐近于Hermite多项式的函数列的判定定理.应用该定理,验证广义Buchholz多项式、广义Laguerre多项式和广义Ultraspherical(Gegenbauer)多项式渐近于Hermite多项式的性质,从而验证超几何多项式的Askey格式的成立.     

Jacobi polynomials and generalized Clifford algebra‐valued Appell sequences

Appell sequences in Clifford analysis are defined as polynomial families on which the Heisenberg algebra acts through a raising and a lowering operator satisfying the canonical Heisenberg relation. Recently, these sequences have gained new interest, as they are connected to the topic of special functions (such as harmonic or monogenic Gegenbauer polynomials) and branching rules for certain irreducible representations of the spin group. In this paper, we will explain how Jacobi polynomials appear quite naturally in the setting of Appell sequences related to certain branching problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Kronecker–Halton sequences in Fp((X−1))

In this paper we investigate the distribution properties of hybrid sequences which are made by combining Halton sequences in the ring of polynomials and digital Kronecker sequences. We give a full criterion for the uniform distribution and prove results on the discrepancy of such hybrid sequences.     

On Appell sequences of polynomials of Bernoulli and Euler type

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number theoretical properties. A class of Euler-type polynomials is also presented.     

二项式型自反多项式

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.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.     

Some identities involving the binomial sequences

Using the exponential generating function and the Bell polynomials, we obtain several new identities for the binomial sequences. As applications, some interesting identities are established for the Abel polynomials, exponential polynomials and factorial powers.