Algorithms for Function Fields

DOI10.1080/10586458.2002.10504684MaRDI QIDQ5472015zbMATH OpenOpenAlexFDO

Authors 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, https://eudml.org/doc/53229

zbMATH Keywords

algorithmsGalois groupsdecompositionssubfields

Mathematics Subject Classification ID

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

Recommendations

• Basic algorithms for rational function fields
• scientific article; zbMATH DE number 1273634
• A rational function decomposition algorithm by near-separated polynomials
• Functional decomposition using principal subfields
• scientific article; zbMATH DE number 1075588

Cites work

• scientific article; zbMATH DE number 3687544 (Why is no real title available?)
• scientific article; zbMATH DE number 1341901 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• 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
• Fundamental algorithms for permutation groups
• KANT V4
• Modern computer algebra
• On computing subfields
• On computing subfields. A detailed description of the algorithm

Cited in

(14)

• scientific article; zbMATH DE number 1075588 (Why is no real title available?)
• Algebraic Feedback Shift Registers Based on Function Fields
• scientific article; zbMATH DE number 1380820 (Why is no real title available?)
• scientific article; zbMATH DE number 6308159 (Why is no real title available?)
• Algorithms for polynomial GCD computation over algebraic function fields
• Algorithmic Number Theory
• On the field intersection problem of solvable quintic generic polynomials
• Galois groups over rational function fields and explicit Hilbert irreducibility
• Functional decomposition using principal subfields
• Computing conjugating sets and automorphism groups of rational functions
• Basic algorithms for rational function fields
• Algebraic closure of a rational function
• Algorithms for quadratic forms over global function fields of odd characteristic
• The complexity of primes in computable unique factorization domains

This page was built for publication: Algorithms for Function Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472015)