Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T06:07:56.444Z Has data issue: false hasContentIssue false
  • English
  • Français

ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS

Part of: Curves Computational number theory Algebraic number theory: global fields

Published online by Cambridge University Press:  17 February 2016

NICOLE SUTHERLAND
NICOLE SUTHERLAND*
Affiliation:
Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

function fieldscyclic Galois extensionsintegral closuresmaximal ordersGalois groups

MSC classification

Primary: 11R58: Arithmetic theory of algebraic function fields
Secondary: 11R32: Galois theory 11R37: Class field theory 11Y16: Algorithms; complexity 11Y40: Algebraic number theory computations 14H05: Algebraic functions; function fields
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 93 , Issue 3 , June 2016 , pp. 513 - 515
Copyright
© 2016 Australian Mathematical Publishing Association Inc. 

References

Cannon, J. J., Bosma, W., Fieker, C. and Steel, A. (eds.), Handbook of Magma Functions (V2.20) (Computational Algebra Group, University of Sydney, 2013), http://magma.maths.usyd.edu.au, 2013.Google Scholar
Cohen, H., Advanced Topics in Computational Number Theory (Springer, New York, 2000).Google Scholar
Ducet, V. and Fieker, C., ‘Computing equations of curves with many points’, in: ANTS X: Proceedings of the Tenth Algorithmic Number Theory Symposium, OBS (eds. Howe, E. and Kedlaya, K.) (Mathematical Sciences Publishers, Berkeley, 2012).Google Scholar
Fieker, C. and Klüners, J., ‘Computation of Galois groups of rational polynomials’, London Math. Soc. J. Comput. Math. 17(1) (2014), 141–158.Google Scholar
Fraatz, R., Computation of Maximal Orders of Cyclic Extensions of Function Fields, PhD Thesis, Technische Universität Berlin, 2005.Google Scholar
Pohst, M., ‘In memoriam: Hans Zassenhaus’, J. Number Theory 47 (1994), 1–19.Google Scholar
Stauduhar, R. P., ‘The determination of Galois groups’, Math. Comput. 27 (1973), 981–996.Google Scholar
Sutherland, N., ‘Efficient computation of maximal orders in radical (including Kummer) extensions’, J. Symbolic Comput. 47 (2012), 552–567.CrossRefGoogle Scholar
Sutherland, N., ‘Efficient computation of maximal orders in Artin–Schreier extensions’, J. Symbolic Comput. 53 (2013), 26–39.Google Scholar
Sutherland, N., ‘Efficient computation of maximal orders in Artin–Schreier–Witt extensions’, J. Symbolic Comput., in revision.Google Scholar
Sutherland, N., ‘Computing Galois groups of polynomials (especially over function fields of prime characteristic)’, J. Symbolic Comput. 71 (2015), 73–97.Google Scholar