Universal Overconvergence of Polynomial Expansions of Harmonic Functions

For each compact subset K of ^N let (K) denote the space of functions that are harmonic on some neighbourhood of K. The space (K) is equipped with the topology of uniform convergence on K. Let Ω be an open subset of ^N such that 0Ω and ^N\Ω is connected. It is shown that there exists a series ∑H_n, where H_n is a homogeneous harmonic polynomial of degree n on ^N, such that (i) ∑H_n converges on some ball of centre 0 to a function that is continuous on Ω and harmonic on Ω, (ii) the partial sums of ∑H_n are dense in (K) for every compact subset K of ^N\Ω with connected complement. Some refinements are given and our results are compared with an analogous theorem concerning overconvergence of power series.     

C~k连续的保形分段2k次多项式插值

1．引言在每个子区间上，通过插入至多一个内结点，Brodlie和Butt［1］给出了分段三次多项式保形插值算法，Randal［2］等讨论了分段五次多项式插值，作者［31讨论了一般分段奇次多项式的保形插值，并且给1了内结点的位置范围公式．这种插值方法完全解决了一般的分段奇次多项式的保形插值问题．关于分段偶次多项式的保形插值，大多数文献只讨论分段二次保形插值，这里要特别指出的是Shumake［4j导出了二次样条保凸的充要条件，并且给出了一个二次样条保形插值的方法．在每一个子区间上至多插入一个内结点，则一个二次插值样条就可得到．作…     

Applications of interval arithmetic in solving polynomial equations by Wu''''s elimination method

Wu's elimination method is an important method for solving multivariate poly- nomial equations.In this paper,we apply interval arithmetic to Wu's method and convert the problem of solving polynomial equations into that of solving interval polynomial equa- tions.Parallel results such as zero-decomposition theorem are obtained for interval poly- nomial equations.The advantages of the new approach are two-folds:First,the problem of the numerical instability arisen from floating-point arithmetic is largely overcome.Second, the low efficiency of the algorithm caused by large intermediate coefficients introduced by exact compaction is dramatically improved.Some examples are provided to illustrate the effectiveness of the proposed algorithm.     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).     

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.     

The interlace polynomial of a graph

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.     

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     

A Turán type inequality for rational functions with prescribed poles

Summary By employing a novel idea and simple techniques, we substantially generalize the Turán type inequality for rational functions with real zeros and prescribed poles established by Min [5] to include L^pspaces for 1≤p≤∞<span style='font-size:10.0pt'>while loosing the restriction ρ > 2 at the same time.     

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.