Computing the fixing group of a rational function
Symbolic Computation
2009-04-19 v1 Commutative Algebra
Abstract
Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing group G_f of a rational function f in K(x).
Cite
@article{arxiv.0805.2331,
title = {Computing the fixing group of a rational function},
author = {Jaime Gutierrez and Rosario Rubio and David Sevilla},
journal= {arXiv preprint arXiv:0805.2331},
year = {2009}
}
Comments
8 pages