Efficient computation of maximal orders in Artin-Schreier extensions

被引：2
|
作者：
Sutherland, Nicole [1 ]
机构：
[1] Univ Sydney, Sch Math & Stat, Computat Algebra Grp, Sydney, NSW 2006, Australia
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2013年 / 53卷
关键词：
Maximal orders; Artin-Schreier extensions; KUMMER EXTENSIONS;
D O I：
10.1016/j.jsc.2012.11.001
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We describe an algorithm, linear in the degree of the field, for computing pseudo bases for integral closures of holomorphy rings in Artin-Schreier extensions of global function fields and a similar algorithm, also linear in the degree of the field, for computing pseudo bases for S-maximal orders of Artin-Schreier extensions of global function fields. We give examples comparing the running time of our algorithm to that of Round 2 and Fraatz (2005). (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：26 / 39
页数：14
相关论文
共 50 条
12345