The Hopf dual H~? of any Poisson Hopf algebra H is proved to be a co-Poisson Hopf algebra provided H is noetherian. Without noetherian assumption, unlike it is claimed in literature, the statement does not hold. It is...The Hopf dual H~? of any Poisson Hopf algebra H is proved to be a co-Poisson Hopf algebra provided H is noetherian. Without noetherian assumption, unlike it is claimed in literature, the statement does not hold. It is proved that there is no nontrivial Poisson Hopf structure on the universal enveloping algebra of a non-abelian Lie algebra. So the polynomial Hopf algebra, viewed as the universal enveloping algebra of a finite-dimensional abelian Lie algebra, is considered. The Poisson Hopf structures on polynomial Hopf algebras are exactly linear Poisson structures. The co-Poisson structures on polynomial Hopf algebras are characterized.Some correspondences between co-Poisson and Poisson structures are also established.展开更多
The purpose of this paper is to solve the problem of determining the limits of multivariate rational functions.It is essential to decide whether or not limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with...The purpose of this paper is to solve the problem of determining the limits of multivariate rational functions.It is essential to decide whether or not limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with f(0,...,0)=g(0,...,0)=0.For two such polynomials f and g,we establish two necessary and sufcient conditions for the rational functionf g to have its limit 0 at the origin.Based on these theoretic results,we present an algorithm for deciding whether or not lim(x1,...,xn)→(0,...,0)f g=0,where f,g∈R[x1,...,xn]are two non-zero polynomials.The design of our algorithm involves two existing algorithms:one for computing the rational univariate representations of a complete chain of polynomials,another for catching strictly critical points in a real algebraic variety.The two algorithms are based on the well-known Wu’s method.With the aid of the computer algebraic system Maple,our algorithm has been made into a general program.In the final section of this paper,several examples are given to illustrate the efectiveness of our algorithm.展开更多
基金supported by National Natural Science Foundation of China (Grant Nos. 11331006 and 11171067)
文摘The Hopf dual H~? of any Poisson Hopf algebra H is proved to be a co-Poisson Hopf algebra provided H is noetherian. Without noetherian assumption, unlike it is claimed in literature, the statement does not hold. It is proved that there is no nontrivial Poisson Hopf structure on the universal enveloping algebra of a non-abelian Lie algebra. So the polynomial Hopf algebra, viewed as the universal enveloping algebra of a finite-dimensional abelian Lie algebra, is considered. The Poisson Hopf structures on polynomial Hopf algebras are exactly linear Poisson structures. The co-Poisson structures on polynomial Hopf algebras are characterized.Some correspondences between co-Poisson and Poisson structures are also established.
基金supported by National Natural Science Foundation of China(Grant No.11161034)the Science Foundation of the Eduction Department of Jiangxi Province(Grant No.Gjj12012)
文摘The purpose of this paper is to solve the problem of determining the limits of multivariate rational functions.It is essential to decide whether or not limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with f(0,...,0)=g(0,...,0)=0.For two such polynomials f and g,we establish two necessary and sufcient conditions for the rational functionf g to have its limit 0 at the origin.Based on these theoretic results,we present an algorithm for deciding whether or not lim(x1,...,xn)→(0,...,0)f g=0,where f,g∈R[x1,...,xn]are two non-zero polynomials.The design of our algorithm involves two existing algorithms:one for computing the rational univariate representations of a complete chain of polynomials,another for catching strictly critical points in a real algebraic variety.The two algorithms are based on the well-known Wu’s method.With the aid of the computer algebraic system Maple,our algorithm has been made into a general program.In the final section of this paper,several examples are given to illustrate the efectiveness of our algorithm.
