In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, E...In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.展开更多
It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 progra...It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.展开更多
We give a classification of second-order polynomial solutions for the homogeneous k-Hessian equation σ_k[u] = 0. There are only two classes of polynomial solutions: One is convex polynomial; another one must not be(k...We give a classification of second-order polynomial solutions for the homogeneous k-Hessian equation σ_k[u] = 0. There are only two classes of polynomial solutions: One is convex polynomial; another one must not be(k + 1)-convex, and in the second case, the k-Hessian equations are uniformly elliptic with respect to that solution. Based on this classification, we obtain the existence of C∞local solution for nonhomogeneous term f without sign assumptions.展开更多
Using Carleman linearization procedure, this paper investigates the problem of first integrals of polynomial autonomous systems and proposes a procedure to find the first integrals of polynomial family for the systems...Using Carleman linearization procedure, this paper investigates the problem of first integrals of polynomial autonomous systems and proposes a procedure to find the first integrals of polynomial family for the systems. A generalized eigenequation is obtained and then the problem is reduced to the solvability of the eigenequation. The result is a generalization of some known results.展开更多
文摘In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.
基金supported by National Natural Science Foundation of China (Grant Nos.70471008, 70971072)
文摘It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.
基金supported by National Natural Science Foundation of China (Grant Nos. 11171339 and 11171261)National Center for Mathematics and Interdisciplinary Sciences
文摘We give a classification of second-order polynomial solutions for the homogeneous k-Hessian equation σ_k[u] = 0. There are only two classes of polynomial solutions: One is convex polynomial; another one must not be(k + 1)-convex, and in the second case, the k-Hessian equations are uniformly elliptic with respect to that solution. Based on this classification, we obtain the existence of C∞local solution for nonhomogeneous term f without sign assumptions.
基金This research is supported by the National Natural Science Foundation(G59837270,G1998020308, G69774008) National Key Project of China.
文摘Using Carleman linearization procedure, this paper investigates the problem of first integrals of polynomial autonomous systems and proposes a procedure to find the first integrals of polynomial family for the systems. A generalized eigenequation is obtained and then the problem is reduced to the solvability of the eigenequation. The result is a generalization of some known results.
