Computing the fixing group of a rational function

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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).
8 pages

Keywords

Symbolic Computation, Commutative Algebra, I.1.1; I.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/227461

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.2331
 http://arxiv.org/abs/0805.2331
 Proceedings of the 5th International workshop on Computer Algebra in Scientific Computing (CASC), p. 159-164, Instituet fuer Informatik, Technische Universitaet Muenchen, 2002. ISBN 3-9808546-0-4

Collections

arXiv