Computing zeta functions of Artin-Schreier curves over finite fields II
文献类型：期刊论文
| 作者 | Lauder, AGB; Wan, DQ |
| 刊名 | JOURNAL OF COMPLEXITY
 |
| 出版日期 | 2004-04-01 |
| 卷号 | 20期号:2-3页码:331-349 |
| 关键词 | Artin-Schreier curve hyperelliptic curve finite field zeta function algorithm |
| ISSN号 | 0885-064X |
| DOI | 10.1016/j.jco.2003.08.009 |
| 英文摘要 | We describe a method which may be used to compute the zeta function of an arbitrary Artin-Schreier cover of the projective line over a finite field. Specifically, for covers defined by equations of the form Z(P) - Z = f (X) we present, and give the complexity analysis of, an algorithm for the case in which f (X) is a rational function whose poles all have order 1. However, we only prove the correctness of this algorithm when the field characteristic is at least 5. The algorithm is based upon a cohomological formula for the L-function of an additive character sum. One consequence is a practical method of finding the order of the group of rational points on the Jacobian of a hyperelliptic curve in characteristic 2. (C) 2003 Elsevier Inc. All rights reserved. |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000220751700014 |
| 出版者 | ACADEMIC PRESS INC ELSEVIER SCIENCE |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/836]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Lauder, AGB |
| 作者单位 | 1.Univ Oxford, Inst Math, Oxford OX1 3LB, England 2.Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA 3.Chinese Acad Sci, Inst Math, Beijing, Peoples R China |
| 推荐引用方式 GB/T 7714 | Lauder, AGB,Wan, DQ. Computing zeta functions of Artin-Schreier curves over finite fields II[J]. JOURNAL OF COMPLEXITY,2004,20(2-3):331-349. |
| APA | Lauder, AGB,&Wan, DQ.(2004).Computing zeta functions of Artin-Schreier curves over finite fields II.JOURNAL OF COMPLEXITY,20(2-3),331-349. |
| MLA | Lauder, AGB,et al."Computing zeta functions of Artin-Schreier curves over finite fields II".JOURNAL OF COMPLEXITY 20.2-3(2004):331-349. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。