In this paper, by using symbolic and algebra computation, Chen and Wang＇s multiple R/ccati equations rational expansion method was further extended. Many double soliton-like and other novel combined forms of exact so...In this paper, by using symbolic and algebra computation, Chen and Wang＇s multiple R/ccati equations rational expansion method was further extended. Many double soliton-like and other novel combined forms of exact solutions of the （2＋1）-dimensional Breaking soliton equation are derived by using the extended multiple Riccatl equations expansion method.展开更多
This paper investigates complex brackets and balanced complex 1st-order difference (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential...This paper investigates complex brackets and balanced complex 1st-order difference (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.展开更多
基金The project partially supported by National Natural Science Foundation of China under Grant No. 10471143 and the State 973 Project under Grant No. 2004CB318001 The authors are very grateful to Prof. Hong-Bo Li, Yong Chen, Zhen-Ya Yan, and Zhuo-Sheng Lii for their kind help and valuable suggestions. They also thank Prof. En-Gui Fan and Prof. Chun-Ping Liu for their constructive suggestions about the solutions of Riccati equation.
文摘In this paper, by using symbolic and algebra computation, Chen and Wang＇s multiple R/ccati equations rational expansion method was further extended. Many double soliton-like and other novel combined forms of exact solutions of the （2＋1）-dimensional Breaking soliton equation are derived by using the extended multiple Riccatl equations expansion method.
基金supported by the National Key Basic Research Project of China (Grant No. 2004CB318001)
文摘This paper investigates complex brackets and balanced complex 1st-order difference (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.
