This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating se...This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary 5-polynomials that are processed. We also show that the computational complexity of our new algorithm is O（N^2）, where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.展开更多
Both original and twisted Schrdinger-Virasoro algebras, and also their deformations were introduced and investigated in a series of papers by Henkel, Roger and Unterberger. In the present paper we aim at determining t...Both original and twisted Schrdinger-Virasoro algebras, and also their deformations were introduced and investigated in a series of papers by Henkel, Roger and Unterberger. In the present paper we aim at determining the 2-cocycles of original deformative Schrdinger-Virasoro algebras.展开更多
基金the National Natural Science Foundation of China (Grant No. 60673082)Special Funds of Authors of Excellent Doctoral Dissertation in China (Grant No. 200084)
文摘This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary 5-polynomials that are processed. We also show that the computational complexity of our new algorithm is O（N^2）, where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.
基金the National Natural Science Foundation of China (Grant Nos. 10471091, 10671027)Foundation of Shanghai Education Committee (Grant No. 06FZ029)"One Hundred Talents Program" from University of Science and Technology of China
文摘Both original and twisted Schrdinger-Virasoro algebras, and also their deformations were introduced and investigated in a series of papers by Henkel, Roger and Unterberger. In the present paper we aim at determining the 2-cocycles of original deformative Schrdinger-Virasoro algebras.
