Polar quotients of a plane curve and the Newton algorithm (Q1772513): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q502082 |
||
| Property / reviewed by | |||
| Property / reviewed by: Gregory Sankaran / rank | |||
Revision as of 00:41, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polar quotients of a plane curve and the Newton algorithm |
scientific article |
Statements
Polar quotients of a plane curve and the Newton algorithm (English)
0 references
18 April 2005
0 references
For \(f\in k[[X,Y]]\) with \(\operatorname{ord}f(0,Y)>1\), and \(k\) algebraically closed of characteristic zero, the author shows how to compute the systems of polar quotients \(\overline {\mathcal Q}(f,X)\) (and the multiplicities) inductively, using a version of the Newton algorithm. This generalises earlier work of the author and others; in particular, \(f\) is not required to be irreducible. Several examples are worked out in detail.
0 references
plane curve singularity
0 references
polar quotients
0 references
Newton polygon
0 references
Newton algorithm
0 references
