关于变数分离的线性偏微分方程的基本解的结构

<正> 对于相当一般的二阶线性非抛物型偏微分方程,Hadamard给出了由方程的系数构造基本解的方法.本文研究的是,当一个二阶线性偏微分算子是变数分离的两个低维的二阶线性偏微分算子之和时,它的方程的基本解与相应于分解后两个低维方程的基本解之间应有的关系.本文给出了这种关系的简明的结构式.     

大维乘积随机矩阵谱分布在因子分析中的应用

建立了一个简单实用的估计大维因子模型的因子个数方法. 特别当残差服从线性时间序列模型时, 给出了其参数的估计方法.另外也给出了这些估计量的极限理论性质.最后的模拟结果和实证分析显示本方法是有意义和有效的.     

有限维张量积空间上的强可分算子

设F是一个域,a∈F~nF~m.若存在h∈F~m,k∈F~m,使得a=hk,则称a是可分的.空间F~nF~m上的线性算子A称为是强可分的,是指x∈F~nF~m,x可分Ax可分.本文证明了F~nF~n上的线性算子A是强可分的当且仅当存在F~n上的线性双射A_1与A_2,使得A=A_1A_2或A=A_1~T A_2;证明了F~nF~m(n≠m)上线性算子A是强可分的当且仅当存在F~n与F~m上的线性双射A_1与A_2,使得A=A_1A_2.最后,给出了可分算子、强可分算子和秩1保持映射之间的关系.     

强算子值鞅型序列

在[1]中,Skorohod在可分的Hilbert空间中定义了强随机线性算子,这种强随机线性算子对研究随机积分有重要应用。[1]中还证明了强随机线性算子值鞅的收敛定理。本文在可分的Banach空间中定义了强随机线性算子和强随机线性算子值鞅型序列。证明了强随机线性算子值鞅型序列成立着和向量值鞅型序列类似的收敛定理,分解定理和选样定理,推广了[1]中的有关结果。同时这些定理也是向量值鞅型序列相应结果([2—5])的推广。     

Hilbert空间中的g-框架类展开式与g-Riesz-Fischer序列

本文考虑了Hilbert空间中一些g-框架类展开式以及g-Riesz-Fischer序列.首先讨论了Hilbert空间中一类算子序列,该类算子序列不必是g-Bessel序列.本文证明了在某些条件下g-框架类展开式存在并且这些展开式保持了通常意义下的能量最小性质.然后讨论了满足下g-框架条件的算子序列,这些算子序列不必满足上g-框架界,得到了Hilbert空间的子空间中的g-框架类展开式,并且给出了一个满足下g-框架条件的算子序列的一个刻画.最后讨论了Hilbert空间中的g-Riesz-Fischer序列,该类算子序列与满足下g-框架条件的算子序列紧密相关,得到了g-Riesz-Fischer序列的一些刻画.     

一类不精确拟牛顿型算法的局部收敛性分析

为了求解Hilbert空间中算子方程或minimax问题,构造了一类无穷维空间中的不精确拟牛顿算法,并考虑了其线性收敛性和超线性收敛性,是对有限维空间中不精确拟牛顿法的推广.当迭代算子由Broyden修正给出时,在一定的假设条件下,得到了不精确Broyden方法的线性收敛性和超线性收敛性.这为使用不精确拟牛顿法结合投影法求解算子方程做好了准备.     

广义Riesz基的双正交特征刻画

本文利用广义双正交序列研究广义Riesz基的等价刻画,得到了算子序列是广义Riesz基当且仅当该算子列是广义完备的广义Bessel序列,且它存在广义双正交序列及这个双正交序列也是广义完备的广义Bessel序列.进一步证明了等价刻画中两个广义Bessel序列的广义完备性条件可以去掉一个(或者任一个),并举例说明了广义双正交,广义完备与广义Bessel条件之间的关系.     

核局部凸空间的一个新特征

Ａ．Ｐｉｅｔｓｃｈ＾［１］在讨论核局部凸空间时给出了两类矢值序列空间ｌ１［Ｘ］和ｌ１｛Ｘ｝。本文建立了矢值序列空间ｌ１［Ｘ］及ｌ１｛Ｘ｝和连续线性算子空间Ｌ（ｃ０，Ｘ）及绝对可和算子空间ＡＳ（ｃ０，Ｘ）之间的拓扑同胚关系。通过ｃ０上的矢值算子类Ｌ（ｃ０，Ｘ）和ＡＳ（ｃ０，Ｘ）及其上的拓扑等价关系，对局部凸空间Ｘ是核空间给出了一个新的特征刻划。     

正则余弦算子函数的内插和外插定理

该文研究正则余弦算子函数的内插和外插．证明了线性算子A在Banach空间X中生成一个指数有界的C-正则余弦函数当且仅当存在Banach空间Y和线性算子B使得：［R这里是C在Y中的有界扩张，B在Y中生成一个强连续余弦算子函数且A＝B|x．     

模糊推理三Ⅰ算法的还原性

模糊推理算法的还原性是判断蕴涵算子与推理方法配合效果的一个重要标准,只有蕴涵算子与推理方法搭配适当,才能使模糊推理有一个好的效果。本文对模糊推理三I算法具备还原性的条件进行了研究。首先,当与蕴涵算子相伴随的三角模为连续三角模时,给出了FM P问题三I算法具有还原性的充要条件;其次,当蕴涵算子为连续的正则蕴涵算子时,给出了FM T问题的三I算法具有还原性的充要条件;最后,当正则蕴涵算子关于补运算满足对合律时,给出了FM T问题三I算法满足还原性的一个充分条件。     

关于第二类Bent基和线性基Bent序列的讨论

C.M.A dam s和S.E.T avares在1990年曾猜测所有长为2n的Ben t序列都是由2n-2个长为4的Ben t序列或2n-2个长为4的仿射序列级联而成,并分别称这样的Ben t序列为Ben t基的和线性基的,1991年郭宝安和蔡长年通过构造一类非Ben t基非线性基的Ben t序列否定了该猜想.文章考虑用4个长为2n-2的(1,-1)-序列级联构造Ben t序列的问题,并称之为第二类级联,给出第二类线性基Ben t序列的类型以及级联序列为第二类Ben t基Ben t序列的一个充分条件.     

三维七元线性码的重量谱与改进的遗传算法

[n,3,7]线性码的重量谱与其差序列是一一对应的。本文改进了[1]结构4的条件（iv),从而得到了不满足链条件的[n,3;7]线性码的差序列的充要条件,并应用改进的遗传算法搜索满足链条件的[n,3;7]线性码的差序列,取得了较好的结果。     

On the GF(p) Linear Complexity of Hall's Sextic Sequences and Some Cyclotomic-Set-Based

Klapper (1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over $GF(2)$, but these sequences have very low linear complexities when considered as sequences over $GF(p)(p$ is an odd prime). This linear complexity of a binary sequence when considered as a sequence over $GF(p)$ is called $GF(p)$ complexity. This indicates that the binary sequences with high $GF(2)$ linear complexities are inadequate for security in the practical application, while, their $GF(p)$ linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, {\it IEEE Transactions on Information Theory}, {\bf 15}(1), 1969, 122--127]. From this perspective, in this paper the authors study the $GF(p)$ linear complexity of Hall''s sextic residue sequences and some known cyclotomic-set-based sequences.     

A simple criterion on degree sequences of graphs

A finite sequence of nonnegative integers is called graphic if the terms in the sequence can be realized as the degrees of vertices of a finite simple graph. We present two new characterizations of graphic sequences. The first of these is similar to a result of Havel-Hakimi, and the second equivalent to a result of Erd?s & Gallai, thus providing a short proof of the latter result. We also show how some known results concerning degree sets and degree sequences follow from our results.     

取整函数及其生成的数列

讨论三类整数列，这些数列的后项均是由前项与非整数乘积再取整后得到的，对应的取整函数分别为四舍五入取整函数、下取整函数、上取整函数．结果表明这三类整数列均为二阶线性递归数列．     

Properties of locally convergent sequences with respect to median filter

In this paper, for infinite-length sequences (or sequences), we prove that a sequence is convergent with respect to the median filter with window width 2k+1 if and only if the sequence is locally convergent on a segment of length 2k−1 in the sequence. Moreover, the length 2k−1 is minimal for k≠2,3.     

On matching numbers of tree and bipartite degree sequences

We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible values. For bipartite degree sequences, we show the existence of realizations with a restricted structure, which allows to derive an analogue of the Gale–Ryser Theorem characterizing bipartite degree sequences. More precisely, we show that a bipartite degree sequence has a realization with a certain matching number if and only if a cubic number of inequalities similar to those in the Gale–Ryser Theorem are satisfied. For tree degree sequences as well as for bipartite degree sequences, the possible values of the matching number form intervals.     

单峰函数中具有指定的型的终于周期轨道的存在性

本文给出了捏制序列为ＢＣ的单峰函数具有ＢＣ＊Ｌ￣∞型周期轨道的几个充分条件。在此基础上，本文进一步讨论了一般的单峰函数ｆ中的终于周期轨道的存在性问题，证明了只要ｋ阶的终于ｎ－周期容许序列ＡＢ￣∞满足一定的要求，ｆ中就存在着ＡＢ￣∞型的ｋ阶终于ｎ－周期轨道。对广泛的一类单峰函数，本文减弱和简化了文献［１］的ＰａｒｔⅡ．３的主要定理的条件并加强了它的结论。对更一般的连续函数，本文亦充实了文献［８］的定理２的结论。     

On the boundary sequence of an automatic sequence

In this paper, we prove a conjecture of Chen and Wen that the boundary sequence of an automatic sequence is also automatic. In particular, we study the boundary sequences of the generalized Cantor sequences, and give a complete characterization of the periodic boundary sequences. As an application, for a class of automatic sequences, we prove that their abelian complexities are also automatic.     

Synthesis of cryptographic interleaved sequences by means of linear cellular automata

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular nonlinear sequence generators with cryptographic application can be linearized in terms of simple cellular automata.