Computation of unirational fields (extended abstract)

Details Computation of unirational fields (extended abstract) Computation of unirational fields (extended abstract)

2008-04-10

arxiv.org/abs/0804.1707v1

Proceedings of the 2005 Algorithmic Algebra and Logic (A3L), p. 129--134, BOD Norderstedt, Germany, 2005. ISBN 3-8334-2669-1

Computer Science

Symbolic Computation

6 pages, 2 images (pictures of authors)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computation of unirational fields (extended abstract) 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 (extended abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of unirational fields (extended abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-356207