Recognizing and parametrizing curves isomorphic to a line (Q2470058): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4097032 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3808246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial automorphisms and the Jacobian conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4406533 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial parametrization of curves without affine singularities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5818521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial automorphisms and Gröbner reductions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of polynomials under automorphisms of \(\mathbb{C}^2\) / rank | |||
Normal rank |
Latest revision as of 16:44, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recognizing and parametrizing curves isomorphic to a line |
scientific article |
Statements
Recognizing and parametrizing curves isomorphic to a line (English)
0 references
13 February 2008
0 references
In [J. Algebra 197, No. 2, 546--558 (1997; Zbl 0899.13029)], the second and third author described an algorithm to decide whether a given polynomial \(p(x,y)\in K[x,y]\) where \(K\) is a field of characteristic zero is a coordinate. In the article under review the authors calculate the complexity of the above said algorithm. They show that if \(\deg p=n\), then the algorithm requires \(O(n^2)\) operations. They also show that the above algorithm leads to an algorithm to parametrize such a coordinate and it requires \(O(n^2\log n)\) operations. These are better than the corresponding numbers for an algorithm by \textit{J. Gutierrez, R. Rubio} and \textit{J. Schicho} [Comput. Aided Geom. Des. 19, No. 3, 223--234 (2002; Zbl 0995.68154)]. In addition to the importance of recognizing lines in the plane, parametrizing curves apparently play an important role in computer aided designs.
0 references
polynomial algebras
0 references
automorphisms
0 references
parametrization of embedded lines
0 references
complexity
0 references