You are currently browsing the tag archive for the ‘Newton polygon’ tag.

Let be a polynomial in two variables; i.e. where each is non-negative, and the coefficients are complex numbers which are nonzero for only finitely many pairs . For a generic choice of coefficients, the equation determines a smooth complex curve in (i.e. a Riemann surface). How can one see the geometry of the curve directly in the expression for ? It turns out that there are several ways to do it, some very old, and some more recent.

The most important geometric invariant of the curve is the *genus*. To a topologist, this is the number of “handles”; to an algebraic geometer, this is the dimension of the space of holomorphic -forms. One well-known way to calculate the genus is by means of the Newton polygon. In the (real) plane , consider the finite set consisting of the points with integer coordinates for which the coefficient of is nonzero. The convex hull of this finite set is a convex integral polygon, called the *Newton polygon* of . It turns out that the genus of is the number of integer lattice points in the interior of the Newton polygon. In fact, one can find a basis for the space of holomorphic -forms directly from this formulation. Let denote the partial derivative of with respect to . Then for each lattice point in the interior of the Newton polygon, the -form is a holomorphic -form on , and the set of all such forms is a basis for the space of all holomorphic -forms.

This is direct but a bit unsatisfying to a topologist, since the connection between the dimension of the space of -forms and the topological idea of handles is somewhat indirect. In some special cases, it is a bit easier to see things. Two important examples are:

- Hyperelliptic surfaces, i.e equations of the form for some polynomial of degree . The Newton polygon in this case is the triangle with vertices and it has interior lattice points. Geometrically one can “see” the surface by projecting to the plane. For each generic value of , the complex number has two distinct square roots, so the map is 2 to 1. However, at the roots of , there is only 1 preimage. So the map is a double cover, branched over points, and one can “see” the topology of the surface by cutting open two copies of the complex line along slits joining pairs of points, and gluing.
- A generic surface of degree . The Newton polygon in this case is the triangle with vertices and it has interior lattice points. One way to “see” the surface in this case is to first imagine lines in general position (a quite special degree curve). Each pair of lines intersect in a point, so there are points of intersection. After deforming the curve, these points of intersection are resolved into tubes, so one obtains complex lines joined by tubes. The first tubes are needed to tube the lines together into a (multiply)-punctured plane, and the remaining tubes each add one to the genus.

It turns out that there is a nice way to directly see the topology of in the Newton polygon, via tropical geometry. I recently learned about this idea from Mohammed Abouzaid in one of his Clay lectures; this point of view was pioneered by Grisha Mikhalkin. The idea is as follows. First consider the restriction of to the product ; i.e. remove the intersection with the coordinate axes. For generic , this amounts to removing a finite number of points from , which will not change the genus. Then on this punctured curve , consider the real valued function . The image is a subset of , called an *amoeba*. If one varies the (nonzero) coefficients of generically, the complex geometry of the curve will change, but its topology will not. Hence to see the topology of one should deform the coefficients in such a way that the topology of the amoeba can be read off from combinatorial information, encoded in the Newton polygon. The terms in corresponding to lattice points in a boundary edge of the Newton polygon sum to a polynomial which is *homogeneous* after a suitable change of coordinates. In the region in which these terms dominate, looks more and more like a collection of cylinders, each asymptotic to a cone on some points at infinity. The image in the amoeba is a collection of asymptotically straight rays. If the polynomial were genuinely homogeneous, the preimage of each point in the amoeba would be a circle, parameterized by a choice of argument of (a certain root of) either or . So the amoeba looks like a compact blob with a collection of spikes coming off. As one deforms the coefficients in a suitable way, the compact blob degenerates into a piecewise linear graph which can be read off from purely combinatorial data, and the topology of can be recovered by taking the boundary of a thickened tubular neighborhood of this graph.

More explicitly, one chooses a certain triangulation of the Newton polygon into triangles of area and with vertices at integer lattice points (by Pick’s theorem this is equivalent to the condition that each triangle and each edge has no lattice points in the interior). This triangulation must satisfy an additional combinatorial condition, namely that there must exist a *convex* piecewise linear function on the Newton polygon whose domains of linearity are precisely the triangles. This convex function is used to deform the coefficients of ; roughly, if is the function, choose the coefficient and take the limit as gets very big. The convexity of guarantees that in the preimage of each triangle of the Newton polygon, the terms of that contribute the most are those corresponding to the vertices of the triangle. In particular, as goes to infinity, the amoeba degenerates to the dual spine of the triangle (i.e. a tripod). The preimage of this tripod is a pair of pants; after a change of coordinates, any given triangle can be taken to have vertices corresponding to a linear equation whose solution set in (for generic ) is a line minus two points — i.e. a pair of pants.

One therefore has a concrete combinatorial description of the degenerate amoeba: pick a triangulation of the Newton polygon satisfying the combinatorial conditions above. Let be the graph dual to the triangulation, with edges dual to boundary edges of the triangulation extended indefinitely. The surface is obtained by taking the boundary of a thickened neighborhood of . The genus of is equal to the rank of the first homology of the graph ; this is evidently equal to the number of lattice points in the interior of the polygon.

As a really concrete example, consider a polynomial like

(the exact coefficients are irrelevant; the only issue is to choose them generically enough that the resulting curve is smooth (actually I did not check in this case – please pretend that I did!)). The Newton polygon is a rectangle with vertices . This can be subdivided into twelve triangles of area as in the following figure:

The dual spine is then the following:

which evidently has rank of equal to , equal on the one hand to the number of interior points in the Newton polygon, and on the other hand to the genus of .

## Recent Comments