It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterat...It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterative roots of order less than or equal to the number of forts? An answer was given recently in the case of "equal to". Since many theories of resultant and algebraic varieties can be applied to computation of polynomials, a special class of strictly piecewise monotone functions, in this paper we investigate the question in the case of "less than" for polynomials. For this purpose we extend the question from a compact interval to the whole real line and give a procedure of computation for real polynomial iterative roots. Applying the procedure together with the theory of discriminants, we find all real quartic polynomials of non-monotonicity height 2 which have quadratic polynomial iterative roots of order 2 and answer the question.展开更多
In 1999, Christopher gave a necessary and sufficient condition for polynomial Li′enard centers, which requires coupled functional equations, where the primitive functions of the damping function and the restoring fun...In 1999, Christopher gave a necessary and sufficient condition for polynomial Li′enard centers, which requires coupled functional equations, where the primitive functions of the damping function and the restoring function are involved, to have polynomial solutions. In order to judge whether the coupled functional equations are solvable, in this paper we give an algorithm to compute a Gr¨obner basis for irreducible decomposition of algebraic varieties so as to find algebraic relations among coefficients of the damping function and the restoring function. We demonstrate the algorithm for polynomial Li′enard systems of degree 5, which are divided into 25 cases. We find all conditions of those coefficients for the polynomial Li′enard center in 13 cases and prove that the origin is not a center in the other 12 cases.展开更多
基金supported by the National Basic Research Program of China (Grant No. 2011CB302402)National Natural Science Foundation of China (Grant Nos. 61021004 and 10825104)Shanghai Leading Academic Discipline Project (Grant No. B412)
文摘It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterative roots of order less than or equal to the number of forts? An answer was given recently in the case of "equal to". Since many theories of resultant and algebraic varieties can be applied to computation of polynomials, a special class of strictly piecewise monotone functions, in this paper we investigate the question in the case of "less than" for polynomials. For this purpose we extend the question from a compact interval to the whole real line and give a procedure of computation for real polynomial iterative roots. Applying the procedure together with the theory of discriminants, we find all real quartic polynomials of non-monotonicity height 2 which have quadratic polynomial iterative roots of order 2 and answer the question.
基金National Natural Science Foundation of China(Grant No.11371264)Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20120181110062)Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme(Grant No.FP7-PEOPLE-2012-IRSES-316338)
文摘In 1999, Christopher gave a necessary and sufficient condition for polynomial Li′enard centers, which requires coupled functional equations, where the primitive functions of the damping function and the restoring function are involved, to have polynomial solutions. In order to judge whether the coupled functional equations are solvable, in this paper we give an algorithm to compute a Gr¨obner basis for irreducible decomposition of algebraic varieties so as to find algebraic relations among coefficients of the damping function and the restoring function. We demonstrate the algorithm for polynomial Li′enard systems of degree 5, which are divided into 25 cases. We find all conditions of those coefficients for the polynomial Li′enard center in 13 cases and prove that the origin is not a center in the other 12 cases.