Polynomial integrability of the Hamiltonian systems with homogeneous potential of degree − 3

In this paper, we study the polynomial integrability of natural Hamiltonian systems with two degrees of freedom having a homogeneous potential of degree k given either by a polynomial, or by an inverse of a polynomial. For k=−2,−1,…,3,4, their polynomial integrability has been characterized. Here, we have two main results. First, we characterize the polynomial integrability of those Hamiltonian systems with homogeneous potential of degree −3. Second, we extend a relation between the nontrivial eigenvalues of the Hessian of the potential calculated at a Darboux point to a family of Hamiltonian systems with potentials given by an inverse of a homogeneous polynomial. This relation was known for such Hamiltonian systems with homogeneous polynomial potentials. Finally, we present three open problems related with the polynomial integrability of Hamiltonian systems with a rational potential.     

Quasi-likelihood analysis for nonsynchronously observed diffusion processes

We consider nonsynchronous sampling of parameterized stochastic regression models, which contain stochastic differential equations. Constructing a quasi-likelihood function, we prove that the quasi-maximum likelihood estimator and the Bayes type estimator are consistent and asymptotically mixed normal when the sampling frequency of the nonsynchronous data becomes large.     

A complex multi-attribute large-group PLS decision-making method in the interval-valued intuitionistic fuzzy environment

In the complex multi-attribute large-group decision-making (CMALGDM) problems in interval-valued intuitionistic fuzzy (IVIF) environment, attributes of the alternatives are often stratified and correlated. This paper proposes a decision-making method for these problems based on partial least squares (PLS) path modelling, which not only fully exploits the decision information of decision makers (DMs), but also effectively addresses the relativity problem in the decision attributes and objectively assigned weights to the primary decision attributes (i.e., “latent variables for decision making”). The method can be outlined in three steps. First, a two-stage method is proposed to transform the interval-valued intuitionistic fuzzy number (IVIFN) samples into single-valued samples. In this step, an improved C-OWA operator is first given to transform the IVIFN samples into intuitionistic fuzzy number (IFN) samples, which makes the preference information of the DMs more objectively aggregated. Then a proposed membership-based method is applied to reduce the information loss and transform the IFN samples into single-valued samples. Second, the estimated values and weights of the “latent variables for decision-making” are obtained by means of the PLS path modelling algorithm. Finally, a multi-alternative sorting method is devised in accordance with the estimated values and weights. An example is provided to illustrate the proposed technique and evaluate its feasibility and validity.     

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.