Algorithmic criteria for permutation orthogonal systems over finite fields  

作　　者：LU Peizhong 

机构地区：[1]Institute of Systems Science,Chinese Academy of Sciences,Beijing 100080,China

出　　处：《Chinese Science Bulletin》1998年第16期1326-1331,共6页

摘　　要：Two criteria for orthogonal systems over finite fields are presented. The first one is an algorithm by use of Gr*ibner bases. The second one is a formula of the numbers of adjoint morphisms.Two criteria for orthogonal systems over finite fields are presented. The first one is an algorithm by use of Grobner bases. The second one is a formula of the numbers of adjoint morphisms.

关 键 词：permutation polynomld orthogonal system algebraic variety Grobner basis 

分 类 号：O241[理学—计算数学]