1次+3次平面多项式系统的代数分类

采用代数不变式和空间直和的理论,对1次 3次平面多项式系统在保证轨线走向不变的前提下进行代数分类,共分成40个等价类.     

Polynomial Stability to Three-Dimensional Magnetoelastic Waves

In this work we show that the energy associated to the linear three-dimensional magneto-elastic system decays polynomially to zero as time goes to infinity, provided the initial data is smooth enough.     

Specht modules and chromatic polynomials

An explicit formula for the chromatic polynomials of certain families of graphs, called bracelets', is obtained. The terms correspond to irreducible representations of symmetric groups. The theory is developed using the standard bases for the Specht modules of representation theory, and leads to an effective means of calculation.     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

“解方程器”软件包(EQNS-SOLVER)

作者提出了对于任意多项式方程组的一种带有普遍性的求解方法。多项式方程组可能没有解,或者有无穷多个解,或者有有限个解,解是实数也可以是复数。在有限个解的情况下,所创建的方法能够求出所有的解。作者完成了一个软料包,称为《解方程器》,曾在微型计算机上用FORTRAN语言完成计算过程。本文是《解方程器》软料包的说明,内容包括基本原理、方法、程序结构、应用举例以及使用的步骤。     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.     

随机参数Duffing系统中的随机混沌及其延迟反馈控制

研究了谐和激励下含有界随机参数Duffing系统(简称随机Duffing系统)中的随机混沌及其延迟反馈控制问题.借助Gegenbauer多项式逼近理论，将随机Duffing系统转化为与其等效的确定性非线性系统.这样，随机Duffing系统在谐和激励下的混沌响应及其控制问题就可借等效的确定性非线性系统来研究.分析阐明了随机混沌的主要特点，并采用Wolf算法计算等效确定性非线性系统的最大Lyapunov指数，以判别随机Duffing系统的动力学行为.数值计算表明，恰当选取不同的反馈强度和延迟时间，可分别达到抑制或诱发系统混沌的目的，说明延迟反馈技术对随机混沌控制也是十分有效的. 关键词： 随机Duffing系统 延迟反馈控制 随机混沌 Gegenbauer多项式     

基于多项式的函数序列一致收敛的性质

针对文中一个关于多项式函数序列一致收效性质的命题，提出了若改变区间条件或对多项式作一定的限制，则谊命题不成立．并得出在一定条件下，多项式序列必定一致收敛于多项式。     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.