Algorithms for Function Fields

DOI10.1080/10586458.2002.10504684zbMath1116.11325OpenAlexW2058179628MaRDI QIDQ5472015

Jürgen Klüners

Publication date: 14 June 2006

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1062621213

zbMATH Keywords

algorithmsGalois groupsdecompositionssubfields

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Separable extensions, Galois theory (12F10) Polynomials in general fields (irreducibility, etc.) (12E05) Algebraic number theory computations (11Y40)

Related Items (3)

Galois groups over rational function fields and explicit Hilbert irreducibility ⋮ The complexity of primes in computable unique factorization domains ⋮ ON THE FIELD INTERSECTION PROBLEM OF SOLVABLE QUINTIC GENERIC POLYNOMIALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental algorithms for permutation groups
• On computing subfields. A detailed description of the algorithm
• KANT V4
• On computing subfields
• A rational function decomposition algorithm by near-separated polynomials
• Computing automorphisms of abelian number fields
• Explicit Galois realization of transitive groups of degree up to 15

This page was built for publication: Algorithms for Function Fields