The Newton polygon of a rational plane curve

We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex representation of its implicit polygon, i.e. of the implicit equation's Newton polygon. In particular, we consider mixed subdivisions of the input Newton polygons and regular triangulations of point sets defined by Cayley's trick. We distinguish p...

We consider the problem of estimating the multiplicity of a polynomial when restricted to the smooth analytic trajectory of a (possibly singular) polynomial vector field at a given point or points, under an assumption known as the D-property. Nesterenko has developed an elimination theoretic approach to this problem which has been widely used in transcendental number theory. We propose an alternative approach to this problem based on more local analytic considerations. In p...

Consider an algebraic equation $P(x,y)=0$ where $P\in \mathbb C[x,y] $ (or $\mathbb F[x,y]$ with $\mathbb F\subset \mathbb C$ a subfield) is a bivariate polynomial, it defines a plane algebraic curve. We provide an efficient method for computing integrals of the type $ \int_\gamma R(x,y)dx $ where $R(x,y)\in \mathbb C(x,y) $ is any rational fraction, and $y$ is solution of $P(x,y)=0$, and $\gamma$ any Jordan arc open or closed on the plane algebraic curve. The method uses onl...

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the system at the singular points. A method for computing the algebraic multiplicity using Newton polygon is also presented.

Let $C$ be a smooth projective curve in $\mathbb{P}^1\times \mathbb{P}^1$ of genus $g\neq 4$, and assume that it is birationally equivalent to a curve defined by a Laurent polynomial that is non-degenerate with respect to its Newton polygon $\Delta$. Then we show that the convex hull $\Delta^{(1)}$ of the interior lattice points of $\Delta$ is a standard rectangle, up to a unimodular transformation. Our main auxiliary result, which we believe to be interesting in its own righ...

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the Newton polygon of the latter. We prove in various cases that this bound is sharp as soon as the polynomial is sufficiently generic with respect to its Newton polygon.

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combinatorial statement.

Let a planar algebraic curve $C$ be defined over a valuation field by an equation $F(x,y)=0$. Valuations of the coefficients of $F$ define a subdivision of the Newton polygon $\Delta$ of the curve $C$. If a given point $p$ is of multiplicity $m$ for $C$, then the coefficients of $F$ are subject to certain linear constraints. These constraints can be visualized on the above subdivision of $\Delta$. Namely, we find a distinguished collection of faces of the above subdivision,...

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which completes works of Kushnirenko (Invent. Math., 1976) and Wall (J. Reine Angew. Math., 1999). Given a fixed collection of n convex integral polytopes in R^n, we also give an explicit characterization of systems of n polynomials supported at these p...

In this paper we characterize, in two different ways, the Newton polygons which are jacobian Newton polygons of a branch. These characterizations give in particular combinatorial criteria of irreducibility for complex series in two variables and necessary conditions which a complex curve has to satisfy in order to be the discriminant of a complex plane branch.