This paper investigates the high order differential neighbourhoods of holomorphic mappings from S-1 x S-1 to a vector space and gives a new extension of the high-order Virasoro algebra.
In this article, based on the Taylor expansions of generating functions and stepwise refinement procedure, authors suggest a algorithm for finding the Lie and high (generalized) symmetries of partial differential equa...In this article, based on the Taylor expansions of generating functions and stepwise refinement procedure, authors suggest a algorithm for finding the Lie and high (generalized) symmetries of partial differential equations (PDEs). This algorithm transforms the problem having to solve over-determining PDEs commonly encountered and difficulty part in standard methods into one solving to algebraic equations to which one easy obtain solution. so, it reduces significantly the difficulties of the problem and raise computing efficiency. The whole procedure of the algorithm is carried out automatically by using any computer algebra system. In general, this algorithm can yields many more important symmetries for PDEs.展开更多
基金This work is supported in part by the Natural ScienceFoundation of Hainan
文摘This paper investigates the high order differential neighbourhoods of holomorphic mappings from S-1 x S-1 to a vector space and gives a new extension of the high-order Virasoro algebra.
基金This paper is supported by National Natural Science Foundation （No. 60871093, 60872126） and National Defense Prediction Foundation （No. 9140C80002080C80）, Guangdong Province Natural Science Foundation （No.8151806001000002）
文摘In this article, based on the Taylor expansions of generating functions and stepwise refinement procedure, authors suggest a algorithm for finding the Lie and high (generalized) symmetries of partial differential equations (PDEs). This algorithm transforms the problem having to solve over-determining PDEs commonly encountered and difficulty part in standard methods into one solving to algebraic equations to which one easy obtain solution. so, it reduces significantly the difficulties of the problem and raise computing efficiency. The whole procedure of the algorithm is carried out automatically by using any computer algebra system. In general, this algorithm can yields many more important symmetries for PDEs.
