Plucker Formulas for Plane Algebraic Curves with a Given Newton Polygon
Aliaksandr Yuran

TL;DR
This paper computes the number of inflection points and bitangents of generic plane algebraic curves with a specified Newton polygon, and shows the dual curve's singularities are limited to nodes and cusps for large polygons.
Contribution
It introduces explicit formulas for inflection points and bitangents based on the Newton polygon and proves the dual curve's singularity structure for large polygons.
Findings
Number of inflection points and bitangents computed
Dual curve has only nodes and cusps for large polygons
Provides a link between Newton polygons and curve singularities
Abstract
Let be a generic complex plane plane curve with a given Newton polygon . We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve ). We also prove that has no singularities other than nodes and cusps for large enough polygons .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
