CSpace
Algorithmic criteria for permutation orthogonal systems over finite fields
Lu, PZ
1998-08-01
Source PublicationCHINESE SCIENCE BULLETIN
ISSN1001-6538
Volume43Issue:16Pages:1326-1331
AbstractTwo 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.
Keywordpermutation polynomial orthogonal system algebraic variety Grobner basis
Language英语
WOS Research AreaScience & Technology - Other Topics
WOS SubjectMultidisciplinary Sciences
WOS IDWOS:000076275700002
PublisherSCIENCE PRESS
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/13848
Collection中国科学院数学与系统科学研究院
AffiliationChinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Lu, PZ. Algorithmic criteria for permutation orthogonal systems over finite fields[J]. CHINESE SCIENCE BULLETIN,1998,43(16):1326-1331.
APA Lu, PZ.(1998).Algorithmic criteria for permutation orthogonal systems over finite fields.CHINESE SCIENCE BULLETIN,43(16),1326-1331.
MLA Lu, PZ."Algorithmic criteria for permutation orthogonal systems over finite fields".CHINESE SCIENCE BULLETIN 43.16(1998):1326-1331.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lu, PZ]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lu, PZ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lu, PZ]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.