Algorithms for Determining Birationality of Parametrization of Affine Curves

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Latex2e file, 12 pages. Some proofs are improved. A misuse of terminology is corrected

Scientific paper

Let $k$ be an arbitrary field, and C be a curve in A^n defined parametrically by x_1=f_1(t),...,x_n=f_n(t), where f_1,...,f_n\in k[t]. A necessary and sufficient condition for the two function fields k(t) and k(f_1,...,f_n) to be same is developed in terms of zero-dimensionality of a derived ideal in the bivariate polynomial ring k[s,t]. Since zero-dimensionality of such an ideal can be readily determined by a Groebner basis computation, this gives an algorithm that determines if the parametrization \psi=(f_1,...,f_n): A --> C is a birational equivalence. We also develop an algorithm that determines if k[t] and k[f_1,...,f_n] are same, by which we get an algorithm that determines if the parametrization \psi=(f_1,...,f_n): A --> C is an isomorphism. We include some computational examples showing the application of these algorithms.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algorithms for Determining Birationality of Parametrization of Affine Curves 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 Algorithms for Determining Birationality of Parametrization of Affine Curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Determining Birationality of Parametrization of Affine Curves will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-635874

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.