Symbolic Algorithm For Computing Approximate Parameterizations Over Rationals

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43898293" target="_blank" >RIV/49777513:23520/11:43898293 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Symbolic Algorithm For Computing Approximate Parameterizations Over Rationals
Original language description
It is well known that an irreducible algebraic curve is rational if and only if its genus is zero. In this paper, we provide a simple symbolic algorithm to parameterize approximately affine rational plane curves by means of linear systems of adjoint curves and one chosen rational point with the guaranty that the coefficients of the obtained parameterization are rational. The designed technique is suitable especially for curves not containing rational points and for curves for which it is too difficult to find these points.
Czech name
—
Czech description
—

Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
10th International Conference Aplimat, Faculty of Mechanical Engineering, Slovak University of Technology in Bratislava February 1-4, 2011, Bratislava, Slovak Republic
ISBN
978-80-89313-51-8
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
629-638
Publisher name
Faculty of Mechanical Engineering, Slovak University of Technology in Bratislava
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 1, 2011
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)