Computation of unirational fields (extended abstract)
Symbolic Computation
2008-05-15 v1 Commutative Algebra
Abstract
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.
Keywords
Cite
@article{arxiv.0804.1707,
title = {Computation of unirational fields (extended abstract)},
author = {Jaime Gutierrez and David Sevilla},
journal= {arXiv preprint arXiv:0804.1707},
year = {2008}
}
Comments
6 pages, 2 images (pictures of authors)