On the complexity of project scheduling to minimize exposed time

We consider project scheduling where the project manager’s objective is to minimize the time from when an adversary discovers the project until the completion of the project. We analyze the complexity of the problem identifying both polynomially solvable and NP-hard versions of the problem. The complexity of the problem is seen to be dependent on the nature of renewable resource constraints, precedence constraints, and the ability to crash activities in the project.     

Polynomial cases of the economic lot sizing problem with cost discounts

In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX.     

交换环上多项式结式的性质

本文主要讨论交换环上多项式结式的一些性质.首先,我们证明了交换环上一种乘积的结式等于结式的乘积的性质,然后,我们证明了交换环上一种和的结式具有的性质,并且给出了交换环上结式为零的一个充分条件.     

On Some Inequalities Concerning Rate of Growth of Polynomials

In this paper we consider a class of polynomials P(z) = a0+∑n v=t a v z v, t ≥ 1not vanishing in |z|k, k≥1 and investigate the dependence of max|z|=1|P(Rz)-P(rz)on max|z|=1|P(z)|, where 1 ≤ r R. Our result generalizes and refines some know polynomial inequalities.     

Persistent centers of complex systems

On the basis of some works on persistent centers and weakly persistent centers, in this paper we discuss a generalized version of persistent center and weakly persistent center for complex planar differential systems, in which conjugacy of variables may not be required. We give some complex systems which have a persistent center or weakly persistent center at the origin. Then, we find all conditions of persistent center for cubic systems and all conditions of weakly persistent center for complex cubic Lotka–Volterra system. Relations between complex systems and real ones are given concerning persistent centers and weakly persistent centers.     

重分数布朗运动的列维连续模

重分数布朗运动是布朗运动的一种推广，有较强的实用背景.该过程的增量既不是独立的，也不是平稳的. 本文研究了它的列维连续模.     

On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

Norm Bounds for Ehrhart Polynomial Roots

M. Beck et al. found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and applies to a larger family of polynomials.     

Chaotic polynomials on Banach spaces

We show the existence of chaotic (in the sense of Devaney) polynomials on Banach spaces of q-summable sequences. Such polynomials P consist of composition of the backward shift with a certain fixed polynomial p of one complex variable on each coordinate. In general we also prove that P is chaotic in the sense of Auslander and Yorke if and only if 0 belongs to the Julia set of p.