Computation of unirational fields

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. 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 primitive elements and factoring over algebraic extensions. Moreover, the method can be extended to finitely generated K-algebras.
28 pages

Keywords

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

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.1679
 http://arxiv.org/abs/0804.1679
 Computation of unirational fields. J. Symbolic Comput. 41 (2006), no. 11, 1222--1244. MR2267134 (2007g:12003)

Collections

arXiv