Plane curves with minimal discriminant (Q1711552)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Plane curves with minimal discriminant |
scientific article |
Statements
Plane curves with minimal discriminant (English)
0 references
18 January 2019
0 references
Let $f\in\Bbbk[x,y]$ be a primitive irreducible polynomial where $\Bbbk$ is algebraically closed of characteristic zero. The discriminant of $f$ with respect to $y$, $\Delta_y(f)\in\Bbbk[x]$, can be expressed in terms of the resultant $\mathrm{Res}_y(f,\theta_yf)$. In this paper, the authors give lower bounds of the degree of the discriminant $\deg_x\Delta_y(f)$. With $g$ the geometric genus of the algebraic curve defined by $f$ they show that $2g+d_y-1\leq\deg_x\Delta_y(f)\leq 2d_x(d_y-1)$, where $d_x$ and $d_y$ are the partial degrees of $f$ with respect to $x$ and $y$. Their proof uses the relations between the valuation of the discriminant and the Milnor numbers of the curve along the corresponding critical fiber. They also prove, using the embedding line theorem of \textit{S. S. Abhyankar} and \textit{T.-t. Moh} [J. Reine Angew. Math. 276, 148--166 (1975; Zbl 0332.14004)], that in the case where $f$ is a primitive squarefree polynomial with $r$ irreducible factors then $\deg_x\Delta_y(f)\geq d_y-r$. They show that a monic irreducible polynomial with minimal discriminant with respect to $y$ is also monic with minimal discriminant with respect to $x$. Furthermore, they show that irreducible monic polynomials with minimal discriminant coincide with coordinate polynomials.
0 references
algebraic plane curve
0 references
genus
0 references
unicuspidal curve
0 references
bivariate polynomials
0 references
discriminant
0 references
Newton polygon
0 references
Abhyankar-Moh's embedding line theorem
0 references