Polar quotients of a plane curve and the Newton algorithm (Q1772513): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Sankaran / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Sankaran / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2996/kmj/1104247355 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2070982867 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:29, 19 March 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