Computation of unirational fields (extended abstract)

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner bases theory. Our algorithm also requires computing computing primitive elements and factoring over algebraic extensions. Moreover, the method can be extended to finitely generated K-algebras.
6 pages, 2 images (pictures of authors)

Keywords

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

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.1707
 http://arxiv.org/abs/0804.1707
 Proceedings of the 2005 Algorithmic Algebra and Logic (A3L), p. 129--134, BOD Norderstedt, Germany, 2005. ISBN 3-8334-2669-1

Collections

arXiv