变系数一阶线性时滞微分方程的一个可积判据

首先引入广义周期函数的概念．然后给出了变系数一阶线性时滞微分方程的一个实用的可积充分判据，从而扩大了常微分方程的封闭求积范围．     

整系数多项式不可约判别法

多项式在有理数域上可约的问题可以归结到整系数多项式能否分解成次数较低的整系数多项式的乘积的问题．Kronecker和Eisenstein分别给出了整系数多项式在有理数域上是否可约的判别方法，本文给出了另外一个判别整系数多项式不可约的判别法，对Eisenstein判别法予以补充．     

线性方程组求解及应用

文章首先介绍了用克拉默法则求解一类线性方程组(方程的个数与未知量个数相同且系数行列式不为零),由此提出对于一般的线性方程组如何求解问题.从而引出用矩阵的秩来判定线性方程组的解的结构以及用初等变换来求线性方程组的通解.最后应用线性方程组的求解问题对矩阵方程和向量组的线性相关性进行分析.     

二阶变系数线性齐次方程的三个可积充分条件

利用变量代换和凑项的方法,给出了二阶变系数线性齐次方程的三个可积充分条件,并得出求解方程的通解公式.     

Simple groups with orders 2^a3^b5^cp^d, 2^a3^b7^cp^d and 2^a3^b5^c7^d

This work deals with the power exponent r1 and r2 respectively of the maximal and second-maximal prime factors ofthe order of simple K4-group, and the classification for simple {5,7}′-K4-group G (i.e. ｜G｜ can not be divided by 5 nor by 7 or ｜π(G)｜ = 4 ), simple 5′ -K4-group G (i.e. ｜G｜ can not divided by 5 and ｜π(G)｜ =4) and simple 7′-Ea-group G (i.e. ｜G｜ can notdivided by 7 and ｜π(G)｜ =4). It is derived that r1 =1, 2 and 4, and r2 is not greater than 4. All the simple K4-groups with order 2^a3^b5^cp^d, 2^a3^b7^cp^d and 2^a3^b5^c7^d are obtained.     

一维粘弹性问题的广义差分法

讨论了一维粘弹性问题的广义差分法．对这类问题的有限元方法的研究已有部分工作．本文将应用广义差分法离散一堆粘弹性问题，得到最优的W^1,p和L^p(2≤P≤∞)模误差估计及广义差分解uk与广义的Ritz-Volterra投影Vku之间的超收敛的W^1,P(2≤p≤∞)模估计。     

一类KOLMOGOROV系统的极限环

本文研究了一类kolmogorov生态系统，证明了有关它的极限环的存在性与唯一性的若干定理．     

高阶奇异对称微分算子亏指数与一类方程适定性的关系

建立了偶数阶奇异对称正则微分算子亏指数与一类带边值条件方程解的适定性之间的等价关系，从方程适定性的角度解决了一类微分算子亏指数的判定问题，并将原有的关于极限点型亏指数的判定作为一种特例包含在内。     

具有"积分小"等数的中立型方程的振动性

对于P∈C(犤to,∞),R),Q∈C(犤t0,∞),R ),给出了中立型方程犤x(t)-P(t)x(t-τ)犦(n) Q(t)x(t-σ)=0,的充分条件,改进了已知的结果。     

丁广义割圆序列的线性复杂度

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.