Efficient computation of maximal orders in Artin–Schreier–Witt extensions. (November 2016)

• Record Type: Journal Article
• Authors: Sutherland, Nicole
• Is Part Of: Journal of symbolic computation. Volume 77(2016)
• Page Start: 189
• Page End: 216
• Publication Date: 2016-11
• Subjects: 11R58 -- 11Y16 -- 14H05 -- 11R20 -- 11R37; Maximal orders -- Artin–Schreier–Witt extensions; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.01.008
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: 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.