Efficient computation of maximal orders in Artin-Schreier-Witt extensions

详细信息    查看全文

• 作者：Nicole Sutherland ^{nicole.sutherland@sydney.edu.au" class="auth_mail" title="E-mail the corresponding author}
• 关键词：11R58 ; 11Y16 ; 14H05 ; 11R20 ; 11R37
• 刊名：Journal of Symbolic Computation
• 出版年：2016
• 出版时间：November-December 2016
• 年：2016
• 卷：77
• 期：Complete
• 页码：189-216
• 全文大小：602 K

文摘

An efficient algorithm for computing S-maximal orders and maximal orders in Artin–Schreier–Witt extensions of global function fields from pseudo bases is described. The running time of our algorithm is compared to that of Round 2 and Fraatz (2005). This completes our work on efficiently computing maximal orders in cyclic extensions of global function fields.