一类融合逼近和插值的曲线细分

采用生成多项式为主的方法对一类融合逼近和插值三重细分格式的支撑区间、多项式生成、连续性、多项式再生及分形性质进行了分析,给出并证明了极限曲线C^k连续的充分条件.通过对融合型细分规则中参数变量的适当选择来实现对极限曲线的形状调整,从而衍生出具有良好性质的新格式,并将这类新格式与现有格式进行比较.数值实例表明这类新格式生成的极限曲线具有较好的保形性.     

Conical Kakeya and Nikodym sets in finite fields

A Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and hyperbolae (but not ellipses which do not have a direction). We also study so-called conical Nikodym sets where a small variation of the proof provides a lower bound on their sizes. (Here ellipses are included.)Note that the bound on conical Kakeya sets has been known before, however, without an explicitly given constant which is included in our result and close to being best possible.     

A fitting algorithm for real coefficient polynomial rooting

A new algorithm for computing all roots of polynomials with real coefficients is introduced. The principle behind the new algorithm is a fitting of the convolution of two subsequences onto a given polynomial coefficient sequence. This concept is used in the initial stage of the algorithm for a recursive slicing of a given polynomial into degree-2 subpolynomials from which initial root estimates are computed in closed form. This concept is further used in a post-fitting stage where the initial root estimates are refined to high numerical accuracy. A reduction of absolute root errors by a factor of 100 compared to the famous Companion matrix eigenvalue method based on the unsymmetric QR algorithm is not uncommon. Detailed computer experiments validate our claims.     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.     

Sharp precision in Hensel lifting for bivariate polynomial factorization

Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.

     

L~p空间中的Fejér和Hermite-Hadamard型不等式

给出了二阶导数属于Lp空间时Fejér和Hermite-Hadamard型不等式的推广,得到两个新结果.     

A geometric interpretation of the transition density of a symmetric Lévy process

We study for a class of symmetric Lévy processes with state space R n the transition density pt（x） in terms of two one-parameter families of metrics, （dt）t>0 and （δt）t>0. The first family of metrics describes the diagonal term pt（0）; it is induced by the characteristic exponent ψ of the Lévy process by dt（x, y） = ^1/2tψ（x-y）. The second and new family of metrics δt relates to ^1/2tψ through the formulawhere F denotes the Fourier transform. Thus we obtain the following "Gaussian" representation of the transition density: pt（x） = pt（0）e- δ2t （x,0） where pt（0） corresponds to a volume term related to tψ and where an "exponential" decay is governed by δ2t . This gives a complete and new geometric, intrinsic interpretation of pt（x）.     

极小化完工时间和的有界批调度问题

考虑m台并行批加工同型机上n个带有释放时间的工件的调度问题,目标是极小化完工时间和.给出了一个多项时间近似方案.     

Scheduling Problems and Mixed Graph Colorings

Some scheduling problems induce a mixed graph coloring, i.e., an assignment of positive integers (colors) to vertices of a mixed graph such that, if two vertices are joined by an edge, then their colors have to be different, and if two vertices are joined by an arc, then the color of the startvertex has to be not greater than the color of the endvertex. We discuss some algorithms for coloring the vertices of a mixed graph with a small number t of colors and present computational results for calculating the chromatic number, i.e., the minimal possible value of such a t . We also study the chromatic polynomial of a mixed graph which may be used for calculating the number of feasible schedules.