Computation of unirational fields

Details Computation of unirational fields Computation of unirational fields

2008-04-10

arxiv.org/abs/0804.1679v1

Computation of unirational fields. J. Symbolic Comput. 41 (2006), no. 11, 1222--1244. MR2267134 (2007g:12003)

Computer Science

Symbolic Computation

28 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computation of unirational fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computation of unirational fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of unirational fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355892