Painlevé Property and Integrability of Polynomial Dynamical Systems

The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e property, then it admits certain class of first integrals. We also present some relationships between the Painlev′e property and the structure of the differential Galois group of the corresponding variational equations along some complex integral curve.     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

一类含三角形图的伴随多项式的根

We denote h(G,x) as the adjoint polynomial of graph G. In [5], Ma obtained the interpolation properties of the roots of adjoint polynomial of graphs containing triangles. By the properties, we prove the non-zero root of adjoint polynomial of Dn and Fn are single multiple.     

Periods of polynomials over a Galois ring

The period of a monic polynomial over an arbitrary Galois ring GR(pe,d) is theoretically determined by using its classical factorization and Galois extensions of rings. For a polynomial f(x) the modulo p remainder of which is a power of an irreducible polynomial over the residue field of the Galois ring, the period of f(x) is characterized by the periods of the irreducible polynomial and an associated polynomial of the form (x-1)m+pg(x). Further results on the periods of such associated polynomials are obtained, in particular, their periods are proved to achieve an upper bound value in most cases. As a consequence, the period of a monic polynomial over GR(pe,d) is equal to pe-1 times the period of its modulo p remainder polynomial with a probability close to 1, and an expression of this probability is given.     

A Linear System Arising from a Polynomial Problem and Its Applications

A linear system arising from a polynomial problem in the approximation theory is studied, and the necessary and sufficient conditions for existence and uniqueness of its solutions are presented. Together with a class of determinant identities, the resulting theory is used to determine the unique solution to the polynomial problem. Some homogeneous polynomial identities as well as results on the structure of related polynomial ideals are just by-products.     

LIMIT CYCLES OF QUARTIC AND QUINTIC POLYNOMIAL DIFFERENTIAL SYSTEMS VIA AVERAGING THEORY

We study the maximum number of limit cycles that can bifurcate from the period annulus surrounding the origin of a class of cubic polynomial differential systems using the averaging theory. More precisely,we prove that the perturbations of the period annulus of the center located at the origin of a cubic polynomial differential system,by arbitrary quartic and quintic polynomial differential systems,there respectively exist at least 8 and 9 limit cycles bifurcating from the periodic orbits of the period annu...     

CHARACTERIZATION OF THE CONVERGENCE DOMAINS OF POLYNOMIAL SERIES AND THE MINIMAL CONVERGENCE DOMAIN

A characterization of the convergence domains of polynomial series is disucssed. the minimalconvergence domain for a kind of polynomial series is shown.     

ON THE GENERALIZATIONS OF KALANDIA''''S LEMMA

Based on Bernstein's Theorem, Kalandia's Lemma describes the error estimate and the smoothness of the remainder under the second part of Holder norm when a Holder function is approximated by its best polynomial approximation. In this paper, Kalandia's Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Holder norm or the weighted Holder norms.     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.     

CLASSIFICATION OF THE PHASE PORTRAIT FOR PLANAR Z_8-EQUIVARIANT HAMILTONIAN SYSTEM OF DEGREE 7

The Hilbert's sixteenth problem, that is the problem on the rlurnber anddistribution of limit cycles of planar polynomial system, has not solved fOr acentury. Since the original problem is so difficuIt, in 1977, V.I.Arnold posed"weakened Hilbert's sixteenth problem"-- the possibility of the number anddistribution of limit cycles fOr polynomial HamiItonian system of degrees n -- lunder perturbation of the polynomial of degrees m 1. From l983, Prof.Li Jibin etc. began to study cubic vecto…     

基于切比雪夫节点的一类带显式系数的广义高斯求积公式(英文)

The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the（n-1）st Chebyshev polynomial of the second kind.Explicit expressions for the corresponding coefficients of the quadrature rule are also found after expansions of the divided diffierences,which was proposed in[14].     

ASYMPTOTIC REPRESENTATION FOR REMAINDER OF QUASI-HERMITE-FEJER INTERPOLATION POLYNOMIAL

Let Q_(2n+1)(f,x)be the quasi-Hermite-Fejer interpolation polynomial of functionf(x)∈C_[-1,1]based on the zeros of the Chebyshev polynomial of the second kind U_n(x)=sin((n+l)arccosx)/sin(arc cosx). In this paper, the uniform asymptotic representation for thequantity| Q_(2n+l)(f, x) -f(x) |is given. A similar result for the Hermite-Fejer interpolationpolynomial based on the zeros of the Chebyshev polynomial of the first kind is alsoestablished.     

LONG-TIME BEHAVIOR OF FINITE DIFFERENCE SOLUTIONS OF THREE-DIMENSIONAL NONLINEAR SCHRODINGER EQUATION WITH WEAKLY DAMPED

The three-dimensional nonlinear SchrSdinger equation with weakly damped that possesses a global attractor are considered. The dynamical properties of the discrete dynamical system which generate by a class of finite difference scheme are analysed. The existence of global attractor is proved for the discrete dynamical system.     

HOPF BIFURCATION ANALYSIS OF A 3D CHAOTIC SYSTEM

In this paper,a 3D chaotic system with multi-parameters is introduced. The dynamical systems of the original ADVP circuit and the modified ADVP model are regarded as special examples to the system.Some basic dynamical behaviors such as the stability of equilibria,the existence of Hopf bifurcation are investigated.We analyse the Hopf bifurcation of the system comprehensively using the first Lyapunov coefficient by precise symbolic computation.As a result,in fact we have studied the further dynamical behaviors.     

C^N中多项式自同构的动力系统

This paper is assigned to discuss the dynamics of a special class of polynomial automorphisms of C^N which was shown to be dense in the group of the polynomial automorphisms.We give some results about the analytic and geometric properties of the filled-in Julia set and the nonwandering set.We also make a characterization of the stable and unstable manifold for the filled-in Julia set.Furthermore,the number of the fixes points for such maps is studied.     

Polynomial Entropy of Amenable Group Actions for Noncompact Sets

In this paper, we define and study polynomial entropy on an arbitrary subset and local measure theoretic polynomial entropy for any Borel probability measure on a compact metric space,and investigate the relation between local measure-theoretic polynomial entropy of Borel probability measures and polynomial entropy on an arbitrary subset. Also, we establish a variational principle for polynomial entropy on compact subsets in the context of amenable group actions.     

Degree elevation from Bzier curve to C-Bzier curve with corner cutting form

The existing results of curve degree elevation mainly focus on the degree of algebraic polynomials. The paper considers the elevation of degree of the trigonometric polynomial, from a Bzier curve on the algebraic polynomial space, to a C-B′ezier curve on the algebraic and trigonometric polynomial space. The matrix of degree elevation is obtained by an operator presentation and a derivation pyramid. It possesses not a recursive presentation but a direct expression. The degree elevation process can also be represented as a corner cutting form.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.     

给定零点的最近复系数多项式计算问题

Nearest polynomial with given properties has many applications in control theory and applied mathematics. Given a complex univariate polynomial f(z) and a zero α, in this paper we explore the problem of computing a complex polynomial f(z) such that f(α) = 0 and the distance ∥f-f ∥ is minimal. Considering most of the existing works focus on either certain polynomial basis or certain vector norm, we propose a common computation framework based on both general polynomial basis and general vector norm, and summarize the computing process into a four-step algorithm. Further, to find the explicit expression of f(z), we focus on two specific norms which generalize the familiar lp-norm and mixed norm studied in the existing works, and then compute f(z) explicitly based on the proposed algorithm. We finally give a numerical example to show the effectiveness of our method.