Computation of unirational fields
One of the main contributions which Volker Weispfenning made to mathematics is related to Grobner 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 Grobner bases theory. Our algorithm also requires computing primitive elements and factoring over alaebraic extensions. Moreover, the method can be extended to finitely generated K-algebras. (c) 2006 Elsevier Ltd. All rights reserved.
unirational fields grobner basis polynomial and rational function decomposition computational galois theory luroth's theorem