Title
Algorithms for Function Fields.
Abstract
Let A/Q(t) be a finite extension. We describe algorithms for computing subfields and automorphisms of K/Q(t). As an application we give an algorithm for finding decompositions of rational functions in Q(c,). We also present an algorithm which decides if an extension L/Q(t) is a subfield of K In case [K: (Q(t)] = [L: Q(t)l we obtain a Q(t)-isomorphism test. Furthermore, we describe an algorithm which computes subfields of the normal closure of K/Q(t).
Year
Venue
Keywords
2002
EXPERIMENTAL MATHEMATICS
Galois groups,subfields,decompositions,algorithms
Field
DocType
Volume
Discrete mathematics,Topology,Combinatorics,Mathematical analysis,Automorphism,Algorithm,Galois group,Rational function,Mathematics
Journal
11.0
Issue
ISSN
Citations 
2.0
1058-6458
2
PageRank 
References 
Authors
0.62
3
1
Name
Order
Citations
PageRank
JüRgen KlüNers14910.32