On the singular locus of a plane projection of a complete intersection

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with given support. Moreover, we discuss the tropical counterpart of this problem.


Introduction
One of the main tools in the study of singularities of maps is the theory of Thom polynomials. They express the fundamental classes of the multisingularity strata for a generic map of arbitrary compact smooth manifolds in terms of their characteristic classes. This theory is however not applicable to a natural class of generic maps, namely the maps between varieties that are defined by generic Laurent polynomials with given Newton polytopes. Such varieties are not compact, and the maps are not proper. At the same time, their toric compactifications associated with the Newton polytopes do not satisfy the genericity conditions necessary for classical Thom polynomials to be applicable (for details see e.g. Example 1.1 and Remark 1.2 in [4]). Therefore, working with multisingularity strata of the abovementioned class of maps requires alternative methods. We will now give a short overview of developments in this direction.
The discriminant (i.e. A 1 stratum) of a projection of a generic hypersurface was described in [7]. If H is a hypersurface given by a generic polynomial f (x 1 , . . . , x d , y) and π is the projection forgetting the last coordinate, then the Newton polytope of the polynomial defining the abovementioned A 1 stratum is equal to the fiber polytope Q π ( f ) ⊂ R d of the Newton polytope N( f ).
An approach to studying the strata of higher codimension, e.g for A 2 (cusps) and 2A 1 (double points), is suggested in [4]. However, this approach only works under additional assumptions on the Newton polytopes and employs operations with tropical fans of dimension that is too high for practical applications (namely, those dimensions are of the same order as the number of monomials inside the given Newton polytopes).
For low dimensional maps or projections, the above mentioned strata are 0-dimensional, and the problem of computing their cardinalities in terms of the given Newton polytopes arises naturally. For example, this problem was solved in [6] for a mapping C 2 → C 2 whose components are generic polynomials of given degrees. See [4] for an overview of some other literature on problems of this kind.
To the best of our knowledge, our paper is the first work where such a problem is solved for polynomials with arbitrary Newton polytopes.
Let us state the main result of our paper.  2 is a reduced nodal curve, then the number of its nodes is given by formula (8) in Theorem 3.10.

Remark 1.2
The classification of the Newton polytopes for which the abovementioned projection is not a nodal curve, is a non-trivial problem (see Example 3.2) that is not addressed in this paper. Instead, we will prove a certain generalization of Theorem 1.1 which is applicable to all lattice polytopes (see Theorem 3.10).
For some support sets A ⊂ Z n+2 , it is quite easy to show that the projection of a complete intersection given by generic polynomials supported at A has only nodes as singularities. For instance, this is the case for A = dT ∩ Z 3 , where d ∈ Z >0 , and T ⊂ R 3 is the standard simplex. Example 1. 3 (Counting the nodes of the projection of a complete intersection curve defined by generic equations of given degree) Let us apply (8) to A = dT ∩ Z 3 , where d ∈ Z >0 , and T ⊂ R 3 is the standard simplex. In the notation of this formula, we then have n = 1, the area of the polygon P is equal to d 4 , the term d 2 comes from the area of the horizontal facet of dT , and the non-horizontal facets do not contribute, since for every ∈ F (dT )\H(dT ), we have ind v ( ∩ A) = 1. Thus, the answer is The problem addressed in this paper might also be of interest with regard to the study of algebraic knots, which is motivated by Viro's work [21] about the rigid isotopy invariant called encomplexed writhe, as well as the works of Mikhalkin and Orevkov (see e.g. [15][16][17]). Namely, it is quite natural to estimate the complexity of an algebraic knot/link (i.e., the minimal crossing number) in terms of the algebraic complexity of its defining equations (i.e., the size of their Newton polytopes). Theorem 1.1 gives an upper bound for the number of self-intersections of a projection of a real complete intersection curve onto a coordinate plane. In Example 1.4 below we show that this upper bound is sharp for the case of real complete intersection links given by a pair of polynomials of given degree. Much harder problems, such as obtaining a sharp upper bound for arbitrary plane projections (not only onto coordinate planes), or topological classification of complete intersection links given by polynomials with arbitrary Newton polytopes, still remain unsolved. Example 1.4 (real version of Example 1.3) Take two generic unions of d planes as the hypersurfaces. Thus, we obtain a pair of varieties given by polynomials which are just products of the corresponding linear factors. Then, their intersection consists of d 2 lines, and the projection of this union of lines has d 2 (d 2 − 1)/2 double points. These double points are of two types: those which are stable and those which are not. The latter will disappear when we perturb the hypersurfaces. Hence, to find the number of stable double points, we need to compute the number of the double points that will disappear. These are exactly the double points whose preimages are intersections of a plane contained in one of the unions with the line of intersection of two planes contained in the other union. Thus, from d 2 (d 2 − 1)/2, which is the total number of double points, we need to subtract the sum d 2 (d −1)/2+d 2 (d −1)/2 = d 2 (d − 1), and what we obtain as the result is exactly d 2 (d − 1) 2 /2 nodes. Therefore, the upper bound obtained in the complex case is sharp for the real case.
Methodology and structure of the paper. The Newton polytopes of objects such as the image or the discriminant M of the projection of a complete intersection are known (see [3,5,7]). Therefore a natural first step in the study of the singularities of M would be passing to the corresponding toric compactification M. If M did not have any additional singularities, then the problem of describing the simplest singularity strata of M, such as A 2 and 2A 1 , could be solved using classical methods. Unfortunately, the compactification M does in general have singularities at infinity. Moreover, these singularities are significantly more complicated than the ones studied. Dealing with them turns out to be the most challenging part in this class of problems. Our approach is to realize M as the base space of a certain covering, such that the covering space has significantly less complicated singularities at infinity, namely, so-called forking-path singularities.
This paper is organized as follows. Section 2 is devoted to the notions and results that will be used throughout the paper. In Sect. 3 we fix the notation and state the main result of the paper: Theorem 3.10. Section 4 is devoted to the proof of the main result. Finally, in Sect. 5 we discuss a few questions that naturally arise in the context of this article, including the tropical counterpart of the main problem.
It is easy to show that for a system of equations { f 1 (x) = · · · = f n (x) = 0} and an arbitrary covector γ = 0, the system { f γ 1 (x) = · · · = f γ n (x) = 0} can be reduced by a monomial change of variables to a system in n − 1 variables at most. Thus, for a generic tuple of polynomials . . , f n ) be a tuple of Laurent polynomials. In the same notation as above, the system { f 1 (x) = · · · = f n (x) = 0} is called Newton-nondegenerate, if for any

Definition 2.8
The volume form on R n that we use in this paper is the lattice volume form with respect to the lattice Z n ⊂ R n . It is uniquely defined by the following property: the volume of a minimal simplex with vertices in Z n is equal to 1. Similarly, we define the lattice volume form on any rational subspace U ⊂ R n (i.e., a subspace such that dim(U ∩ Z n ) = dim U ) as follows: the volume of a minimal simplex with vertices in the lattice U ∩Z n equals 1. Finally, the lattice volume form on R n /U , where U is a rational subspace, is defined in such a way that the volume of a minimal simplex with vertices in the lattice Z n (U ∩ Z n ) is equal to 1.

Definition 2.9
Let P be the semigroup of all convex polytopes in R n with respect to the Minkowski addition (see Definition 2.3). The mixed volume is the unique function MV : P × · · · × P n times → R which is symmetric, multilinear (with respect to the Minkowski addition) and such that the equality M V (P, . . . , P) = Vol(P) holds for every polytope P ∈ P. Here by Vol we denote the lattice volume form in R n with respect to the standard lattice Z n ⊂ R n .
The following theorem allows one to compute the number of roots for a non-degenerate polynomial system of equations in terms of the mixed volume of its Newton polytopes. Theorem 2.10 (Bernstein-Kouchnirenko formula [1]) The number of roots for a Newtonnondegenerate system of polynomial equations { f 1 (x) = · · · = f n (x) = 0} in (C \ {0}) n counted with multiplicities is equal to MV(N( f 1 ), . . . , N( f n )).

Fibers of resultantal sets
This subsection is devoted to one of the key results that we will use in this paper-Theorem 2.32. We refer the reader to [2] for proofs and details. The following example serves as motivation for this subsection.
17 is the unique essential subcollection of the same codimension as A. . . . , A I ) be a collection of finite subsets of Z n , and let (A i 1 , . . . , A i k ) be one of its subcollections. Suppose that the sum k j=1 A i j affinely generates a sublattice L ⊂ Z n . Consider L ⊂ Z n , the maximal sublattice of the same dimension as L such that L ⊂ L . Denote the projection Z n Z n L by ρ. Then the collection of all sets of the form ρ(

Definition 2.21 Let
is called the quotient collection.

Example 2.22 Let us come back to the collection
Definition 2.23 In the notation of Definition 2.21, let A i 1 , . . . , A i k be the essential subcollection of a weakly essential collection of finite sets A = (A 1 , . . . , A I ) ⊂ Z n that has the same codimension as A, and let B 1 , . . . , B I −k be the quotient collection. The multiplicity of the collection A is denoted by d(A) and defined by the following formula: where |L /L| stands for the index of the sublattice L ⊂ L .

Remark 2.24
If the collection A is essential, then the quotient collection is empty. In this case, we follow the convention MV(∅) = 1.

Example 2.25
Let us come back to Example 2.22. The multiplicity d(A) of the collection A is equal to 1! · Length(conv B 1 ) = 1.

Definition 2.26
For a finite set A ⊂ Z n , we denote by C A the set of all complex Laurent polynomials of the form a∈A c a t a , where a = (a 1 , . . . , a n ), t = (t 1 , . . . , t n ) and t a = t a 1 1 · . . . · t a n n . Let A 1 , . . . , A I ⊂ Z n be finite sets. We define (A 1 , . . . , A I ) to be the Zariski closure of the set of all collections ( p 1 , . . . , p I ) ∈ C A 1 ⊕ · · · ⊕ C A I such that the set is not empty.  4 are the same as in Example 2.17, is also equal to 1.

Definition 2.29
For a point f = ( f 1 , . . . , f I ) ∈ (A 1 , . . . , A I ), the f -fiber is defined to be the algebraic set The dimension of the f -fiber for a generic f ∈ (A 1 , . . . , A I ) can be computed via the following formula.

Example 2.31
For both of the collections of finite sets considered in Example 2.28, the dimension of the f -fiber is equal to 0, for generic f . At the same time, if instead of any of these two collections we consider their images under an inclusion into some lattice Z k of higher dimension, then the dimension of the corresponding f -fiber will be non-zero.
Finally we will state the main result of this subsection. First we recall that a subtorus T ⊂ (C \ {0}) n is a subgroup of (C \ {0}) n isomorphic to (C \ {0}) k for some k < n. A shifted copy of T is the set gT ⊂ (C \ {0}) n obtained by multiplying all the elements of T by some g ∈ (C \ {0}) n .

Theorem 2.32 Suppose that a collection
has exactly one root.

Example 2.34
For the essential collection considered in Example 2.11, we have that there exists a Zariski open subset S ⊂ (A 1 , A 2 ) such that for every f = ( f 1 , f 2 ) ∈ S, the system { f 1 = f 2 = 0} has exactly 2 roots.

Fiber polytopes
This subsection contains some basic facts about fiber polytopes, that we will use throughout the paper. For more details we refer the reader to [5].

Example 2.38
Denote the standard coordinate system in (C \ {0}) 2 by (x, y) and consider the complete intersection Let π : (C \ {0}) 2 → C be the projection forgetting the second coordinate. Then X = π * ( X ) is given by a univariate polynomial π f 1 , f 2 that has MV( 1 , 2 ) roots if counted with multiplicities. Thus, the Newton polytope of π f 1 , f 2 is an interval of length MV( 1 , 2 ).
By a monomial change of variables, one can reduce the problem of computing the composite body π f 1 ,..., f k+1 with respect to an arbitrary epimorphism π : (C \ {0}) n → (C \ {0}) n−k to a special case, when π is a coordinate projection. Therefore, to simplify notation, we will assume that π is the coordinate projection forgetting the first k coordinates.
Recall that the volume form used in this paper is the lattice volume form in R n with respect to the lattice Z n ⊂ R n (see Definition 2.8).
Theorem 2.41 In the same notation as above, for any collection of convex bodies 1 , . . . , k+1 ⊂ R n a composite body exists. Moreover, it is unique up to a shift.
The goal of this subsection is to describe the Newton polytope of the composite polynomial in the special case when ( f 1 , . . . , f k+1 ) is a generic tuple of polynomials with N( f 1 ) = · · · = N( f k+1 ) = . Therefore, in the same notation as above, our next step is to construct the composite body for the tuple ( 1 , . . . , k+1 ) with 1 = · · · = k+1 = .
Definition 2.42 Let L ⊂ R n be a rational codimension k plane, and let μ be the lattice volume form on R n L with respect to the lattice Z n /(Z n ∩ L). Denote by ρ the projection R n R n L . For a convex body ⊂ R n , the set of all points of the form ρ( ) sμ ∈ R n , where s : ρ( ) → is a continuous section of the projection ρ, is called the Minkowski integral of and is denoted by ρ| . (t)dt, where (t) stands for the function which maps every s ∈ R to ∩ {t = s} ⊂ R 2 (see Fig. 2 below). It is similar to the usual Riemann integral, but in this case, the function takes values in convex sets and the addition operation is the Minkowski sum. The body can be approximated by cylinders, whose Minkowski integrals were computed in Example 2.43. Therefore, the integral ρ| is then the limit of the sums m j=0 (t j+1 − t j ) (t j ) as m goes to infinity. Theorem 2.45 In the same notation as above, for arbitrary convex bodies B 1 , . . . , B n−k−1 ⊂ L the convex body B = (k + 1) ρ| is contained in a fiber of the projection ρ and satisfies the equality We have that codim(L) = 1. Let us show that the convex body 2 Length(I ) · Q is, up to a shift, the composite body of the tuple ( , ). Indeed, substituting = I × Q = I + Q into (4) and using the additivity of the mixed volume with respect to the Minkowski sum, we obtain: Let π : (C \ {0}) n → (C \ {0}) n−k a coordinate projection of complex tori and π × : Z n−k → Z n be the corresponding inclusion of character lattices. Denote by L the coordinate plane of codimension k containing the image π × (Z n−k ). Corollary 2.47 In the same notation as above, let f 1 , . . . , f k+1 be a generic tuple of Laurent polynomials with N( f j ) = , 1 ≤ j ≤ k + 1. Then the Newton polytope of the composite polynomial π f 1 ,..., f k+1 is equal, up to a shift, to (k + 1) ρ| , where ρ is the projection R n R n L .

Definition 2.48
To simplify the notation, we will denote the polytope (k +1) ρ| by π ( ) and call it the fiber polytope of with respect to the projection π.
Theorem 2.49 below provides the description of the faces of the Minkowski integral of a polytope.

Theorem 2.49
Let ⊂ R n be a convex polytope with integer vertices, L ⊂ R n be a rational subspace and γ ∈ L * be a primitive covector. We define Then the support face ρ| μ γ coincides with the Minkowski sum

Remark 2.50
For all but a finite number of covectors β ∈ I(γ ), the projection of the support face β along L is not of full dimension, thus, only a finite number of summands in the right-hand side of (5) give a non-trivial contribution.
Definition 2.42 implies that if the subspace L is a line, then the Minkowski integral ρ| is an interval of length Vol( )/n. Combining this observation with Theorem 2.49 we obtain the following result.

Lemma 2.51
Let ⊂ R n be a convex polytope with integer vertices, L ⊂ R n be a rational subspace of codimension k, and ρ be the projection R n → R n L . Suppose that the face For every β ∈ I(γ ), we denote the lattice length of β| L by u(β). Then the length of can be computed via the following formula: Indeed, the length of the segment is equal to a weighted sum of volumes of the (k + 1)dimensional faces of that are contained in an affine (k + 1)-dimensional plane, which intersects L along a line parallel to P. Finally, the lattice length of the edge P γ j , is equal to the product of the lattice length of γ j and the lattice area of the facet γ j . In our case, all the covectors γ j are primitive, Vol( 1 ) = Vol( 4 ) = 1 and Vol( 2 ) = Vol( 3 ) = 2. Thus, up to a shift, the polygon P is equal to conv({(0, 0), (2, 0), (2, 1), (0, 2)}).

The Euler characteristic of a complete intersection
Here we state one of the key results that we will use in this paper, namely, the formula, which expresses the Euler characteristic of a generic complete intersection in terms of the Newton polytopes of the polynomials defining it. This amazing result was obtained by Khovanskii in the work [9] (see Theorem 2, p.44). Before stating it, let us introduce some notation. Let of an analytic function of the k variables x 1 , . . . , x k at the point 0. We define the number F( 1 , . . . , k ) as follows: if F is a monomial of degree n, namely, x = x n 1 1 · . . . · x n k k , n 1 + · · · + n k = n, then we put For monomials F of degrees other than n, we set F( 1 , . . . , k ) = 0. Then, by linearity, this definition is extended to arbitrary linear combinations of monomials.
Theorem 2.54 [9] Let X be a variety defined in (C \ {0}) n by a nondegenerate system of equations { f l = · · · = f k = 0} with Newton polyhedra 1 , . . . , k . Then, in the same notation as above, the Euler characteristic χ(X ) can be computed via the following formula: Example 2.55 In the same notation as above, if k = 1, the variety X is a hypersurface in (C \ {0}) n given by a polynomial f 1 with the Newton polytope 1 . In this case, by Theorem 2.54, we have

Forking paths singularities
This subsection is devoted to the so-called forking paths singularities, introduced in Subsection 3.8 of [4]. Let i = (i 1 , i 2 . . .) be a sequence of integers satisfying the following properties: -the sequence i stabilizes at 1; -for every r ∈ N, the number i r +1 divides i r .
Given such a sequence i, we construct another sequence q = (q 1 , q 2 . . .) as follows: for every r ∈ N, we set q r = i r /i r +1 . This data can be encoded using a certain system of subsets of a finite set R of size i 1 via the so-called i-nested boxes construction. This construction works level by level as follows. Level 0 consists of one box-the set R itself. To construct level 1, we divide the elements in R into q 1 boxes containing i 2 elements each. Level 2 is then the result of dividing the elements of each of the level 1 boxes into q 2 boxes containing i 3 elements each. We continue this operation until we end up with i 1 boxes containing an element of R each. The latter will happen in a finite number of steps, since the sequence i stabilizes at 1.

Example 2.57
To illustrate the nested boxes construction, we consider the following special case. Let R be the set of complex roots for a polynomial z i 1 − 1. We put elements r 1 , r 2 into the same box on level k, if r Consider the sequence i = (8, 4, 2, 1, . . .), then according to the above-mentioned construction, the roots for the polynomial z 8 − 1 are placed in the following system of nested boxes: Fix an arbitrary numbering of boxes on every level. Each of the elements of R in the nestedboxes construction has its own address, i.e. a finite sequence of integers, constructed as follows. The (k + 1)-st element of the address is the number of the kth level box containing the given element. For any two elements r 1 , r 2 of R with addresses (a 1 , a 2 , . . . , a N ) and

Example 2.58
If we enumerate the boxes from top to bottom on every level in Example 2.57, the element 1 has the address (1, 1, 1, 1), while the address of e πi 2 is (1, 1, 2, 1). The depth κ(1, e πi 2 ) of their relation is equal to 3. Definition 2.59 In the same notation as above, let i = (i 1 , i 2 , . . .) be an integer sequence stabilizing at 1 and such that i k+1 divides i k for every k. With the i-nested boxes construction one can associate a plane singularity with i 1 distinct regular branches of the form ϕ r m : (C, 0) → (C 2 , 0) indexed by the elements of the set R = {r 1 , r 2 , . . . , r i 1 } and such that the intersection number of ϕ r m and ϕ r n with m = n is equal to κ(r m , r n ). We call this singularity an i-forking paths singularity.

Proposition 2.60
The Euler characteristic χ(i) of the Milnor fiber of an i-forking paths singularity can be computed using the following formula: Proof First, we independently perturb the branches of the singularity, i.e. in such a way that for every pair of branches, their multiple intersection splits into several transverse intersections. Then the union U of the perturbations has ∞ n=1 i 1 (i n − 1)/2 nodes. One can prove the statement by induction on the "depth" of the corresponding nested boxes construction.
Base. For i = (i 1 , 1, . . .), the sought number of nodes is equal to i 1 (i 1 − 1)/2, since in this case, each branch transversely intersects every other branch exactly once.
Inductive step. Let i = (i 1 , . . . , i k , 1, . . .) and i = (i 1 , . . . , i k , i k+1 , 1, . . .). Then the union of the perturbations of an i -forking paths singularity has i 1 (i k+1 − 1)/2 = (i 1 /i k+1 ) · i k+1 (i k+1 − 1)/2 more nodes than the one for an i-forking paths singularity. Indeed, we add i 1 /i k+1 boxes of i k+1 elements each, and for every such box, the corresponding branches intersect each other transversely and exactly once, which yields i k+1 (i k+1 − 1)/2 nodes for each of the boxes. The next step is to compute the Euler characteristic of the Milnor fiber of the i-forking paths singularity. Here we use a fact which follows from the additive property of Euler characteristic.

Proposition 2.61
If a perturbation U of an isolated hypersurface singularity S has a fiber with isolated singularities S 1 , . . . , S k , then we have: In our case, the smooth part of U is topologically equivalent to the union of i 1 complex planes with 2 ∞ n=1 i 1 (i n − 1)/2 points punctured. The Euler characteristic of the Milnor fiber of a node is equal to 0. Thus we obtain the desired answer:

The main result
In this section we state the main result, Theorem 3.10. We begin by introducing the notation that will be used for the remainder of this paper.

Dramatis personae
. , e n+2 }, the standard basis of the character lattice Z n+2 ; -A ⊂ Z n+2 , a finite subset of maximal dimension; -= conv(A) ⊂ R n+2 , the convex hull of the set A; -F ( ), the set of all facets of the polytope ; -X , the toric variety associated to the polytope ; 2 , the projection forgetting the first n coordinates; -P ⊂ R 2 the Newton polygon of the curve C; -S, the singular locus of the curve C.

Remark 3.1
In general, the image π( C) is a plane curve with punctured points coming from the intersection of the closure of the curve C in the toric variety X with the orbits corresponding to horizontal facets of the polytope (see Definition 3.9). Therefore, we define the curve C to be the Zariski closure of π( C).

Statement of the problem
In this subsection we give a precise formulation of the question that we address in this paper and discuss all the assumptions we make. For generic f 1 , . . . , f n+1 ∈ C A , the complete intersection C = { f 1 = · · · = f n+1 = 0} ⊂ (C \ {0}) n+2 is a smooth curve and the closure C of its image under the projection π is a plane curve in (C \ {0}) 2 whose singular locus consists of finitely many isolated singular points.
It is quite natural to expect that under certain genericity conditions, all the singular points of the curve C are nodes. However, this is the case not for all support sets. Moreover, the following example shows that when the support sets supp( f j ) = A j do not coincide, one can no longer expect the singular points of the projection of the corresponding complete intersection to be nodes even for generic polynomials f j ∈ C A j . If we take a point (y 0 , t 0 ) ∈ π(C) and substitute it into the polynomials defining C, then we obtain a system of n + 1 polynomial equations in n variables. The number of solutions for this system is equal to the number of preimages of the point (y 0 , t 0 ). Now, take n = 1 and where g i , h j are some Laurent polynomials in the variables y, t. The example below shows that in this case, if the point (y 0 , t 0 ) has more than one preimage in C, then it has 3 preimages, so it cannot be a node. If the support sets supp( f 1 ) and supp( f 2 ) are big enough, then the curve C will actually have points with 3 preimages.

Example 3.2 Consider
be polynomials supported at A 1 and A 2 respectively. Suppose that the univariate system Let us show that this system also has another root r 3 ∈ (C \ {0}). Indeed, the assumption we made implies that r 2 = α · r 1 , where α is a root of unity. Substituting these roots into the first equation, we obtain that the linear term of f 1 has to be 0. But then it is clear that the third root r 3 = α · r 2 is also a root for the first equation.
Instead of computing the number of nodes of the curve C, we address a slightly more general problem: namely, we compute the sum of the δ-invariants (for details see §10 in [18]) of the singular points of the curve C. On one hand, this problem makes sense for any collection of support sets. On the other hand, if the curve C only has nodes as singularities, then the answer is exactly the number of those nodes.

Remark 3.3
Roughly speaking, the δ-invariant of a plane curve singularity S is a non-negative integer that is equal to the number of double points concentrated at S. Let S be a singularity with b(S) branches. Perturb its branches in such a way that the union U of the perturbations has only nodes as singularities. Denote by N the number of these nodes. By Proposition 2.61, the Euler characteristic of the Milnor fiber of S is then equal to b(S) − 2N . Therefore, the Milnor number of S is given by the following formula: or, equivalently, The latter then agrees with Milnor formula 2δ(s) = μ(s) + b(S) − 1, which relates the δ-invariant of the singularity, its Milnor number and the number of its branches. Problem 3.4 In the same notation as above, express the sum D of the δ-invariants of the singular points of the curve C in terms of the set A.
Let us introduce some more notation that will be used throughout the paper.
This assumption can be made without loss of generality since multiplication by monomial does not change the zero set of the polynomial inside the algebraic torus. At the same time, the resulting support set is a shift of the initial one.

Assumption 3.7
The set A satisfies the following property: ind v (A) = 1.

Remark 3.8
We can make this assumption without loss of generality due to the following reason. The lattices A and = Z n+2 e n+1 , e n+2 admit a pair of aligned bases such that = Zw i and A = Za i w i for some a i ∈ Z. Performing a monomial change of variables to pass from the basis {e 1 , . . . , e n+2 } to (w 1 , . . . , w n , e n+1 , e n+2 ) and then another change of variables of the formx i = x a i i , we will reduce our problem to the case ind v (A) = 1.
Let Q = p( ) be the image of the polytope under the projection ρ : R n+2 R n+2 e n+1 , e n+2 . Definition 3. 9 We call a face ⊂ Δ horizontal, if its projection is contained in the boundary of Q. We denote the set of all horizontal facets of the polytope by H( ).

Statement of the main result
Denote by ( 1 , . . . , n+2 ) the coordinate system induced by the basis {e 1 , . . . , e n+2 } of R n+2 . Let ⊂ Δ be a non-horizontal facet contained in a hyperplane given by a linear equation of the form ( 1 , . . . , n+2 ) = c. The function is unique up to a scalar multiple, therefore, one can assume that the coefficients of are coprime integers and that for any α ∈ A\ , (α) < c. We now construct a sequence of integers i = (i 1 , i 2 , . . .) as follows. We set B 1 = A∩ . For every r > 1, we define Finally, for every r ≥ 1, we set It is clear that for every r , the element i r divides i r −1 . Moreover, since for the set A we have ind v (A) = 1, any such sequence stabilizes to 1.
Theorem 3.10 Let A ⊂ Z n+2 be a finite set of full dimension, satisfying Assumption 3.7, and let ⊂ R n+2 be its convex hull. In the same notation as above, for generic f 1 , . . . , f n+1 ∈ C A , the closure C of the image of the curve C = { f 1 = · · · = f n+1 = 0} under the projection π : (C \ {0}) n+2 → (C \ {0}) 2 forgetting the first n coordinates is an algebraic plane curve, whose singular locus S consists of isolated singular points. Then the number D = s∈S δ(s) can be computed via the following formula: where δ(s) is the δ-invariant of the singular point s, P = π ( ) is the fiber polytope of with respect to π, the set F ( ) is the set of all facets of the polytope and H( ) is the set of all horizontal facets of .

Proof of Theorem 3.10
This section is organized as follows: Sects. 4.1 and 4.2 are devoted to the singular points of the curve C at infinity. There we show that for generic f 1 , . . . , f n+1 ∈ C A , all the singularities of the curve C at infinity are forking path singularities (see Sect. 2.5 for details) and compute their contribution to the Euler characteristic of the curve C. In Sect. 4.3, we compare the Euler characteristic of the curves C and C to deduce the main result of this paper-Theorem 3.10.

Order of contact between branches of the curve C at infinity
We first make a very useful technical assumption that will simplify the proof of Theorem 3.10.

Assumption 4.1
For every primitive covector γ such that γ ⊂ is a non-horizontal facet, its image under the projection forgetting the first n coordinates is also primitive.   3 We make Assumption 4.1 in order to perform certain monomial changes of variables that would preserve horizontality of facets in . As we will further see, this assumption guarantees that the projection C of the complete intersection C has only forking-path singularities at infinity (see Lemma 4.18 for details).
One can always reduce the computation to the case when the polytope satisfies Assumption 4.1. Namely, Lemma 4.4 below implies that for any lattice polytope , there exists a number K ∈ N such that for any N > K , the monomial change of variableš x i = x i ,y N ! = y,ť N ! = t allows to pass from the polytope to the new polytopeˇ which satisfies the desired condition.  Proof Let ⊂ Δ be a non-horizontal facet. Choose any n + 2 vertices V 1 , V 2 , . . . V n+2 of and consider the vector subspace in R n+2 generated by differences V j − V 1 for j ≥ 2. Denote by M the (n + 1) × (n + 2)-matrix, whose row are the coordinates of the vectors V j − V 1 in the basis {e 1 , . . . , e n+1 , e n+2 }. We then can easily find a covector γ such that = Δ γ . For instance, we can take the covector whose j-th coordinate in the basis dual to {e 1 , . . . , e n+1 , e n+2 } is the maximal minor obtained by keeping all but the j-th column of the matrix M. Note that the coordinates of the covector γ = (γ 1 , . . . , γ n+2 ) are integers and its last two coordinates are non-zero, since is not horizontal. Now let us apply the map F k for an arbitrary k and use the same method as above to find an integer covectorγ supported at the facetˇ = F k ( ). The coordinates ofγ are the maximal minors of the matrixM, obtained from M by multiplying the last two columns by k. Therefore, by a straightforward computation, one obtains thatγ is equal to (k 2 γ 1 , . . . , k 2 γ n , kγ n+1 , kγ n+2 ).
Finally, note that, by the computation above, applying the map F k does not increase the number of "bad" facets, i.e. the facets whose primitive normal covectors do not satisfy the property given in Assumption 4.1. Therefore, using some finite chain of maps F k i we can get rid of all "bad" facets one by one until we obtain a polytope satisfying the desired property. The product of the numbers k i is the sought number K , which concludes the proof.
Inside the torus (C \ {0}) 2 , the projection of the new complete intersectionČ defined by polynomialsf 1 , . . . ,f n+1 with the Newton polytopeˇ can be viewed as an (N !) 2 -fold covering of the initial curve C. Therefore, to find the sum D of δ-invariants of the singularities of the curve C, one can just find this number for the projection of the curveČ and divide it by (N !) 2 .   Proof Indeed, let (ě 1 , . . . ,ě n+2 ) be the basis of (Z n+2 ) * dual to the basis {e 1 , . . . , e n+2 } of the lattice Z n+2 . Consider the primitive covector γ ∈ (Z n+2 ) * that is supported at the facet . Assumption 4.1 implies that the image of γ under the projection forgetting the first n coordinates is primitive, therefore, together with some integer covector τ = λ 1ěn+1 + λ 2ěn+2 , it forms a basis of the 2-dimensional lattice ě n+1 ,ě n+2 . We construct a new basis  Recall that by P and X P we denote the Newton polygon of the curve C and the corresponding toric surface, respectively.

.1, in a small neighborhood of p every branch of the curve C is a smooth curve that intersects O transversally.
Proof The first statement is a corollary of Theorem 17 in [5]. Moreover, this result implies that in a small neighborhood of p, each branch of the curve C is the projection of the intersection of the curve C with a small neighborhood of some limiting point q in the orbit O ⊂ X Δ , where ⊂ Δ is some facet parallel to the edge . It is well known that for generic f 1 , . . . , f n+1 ∈ C A , the complete intersection C in a small neighborhood of q is smooth and intersects O transversally.
Let us now assume that the edge ⊂ P is contained in a coordinate axis, and the facet is "vertical" and is contained in the coordinate hyperplane whose image under the projection is that coordinate axis. In this setting, the torus (C \ {0}) 2 ⊂ X P and the orbit O can be considered as dense subsets of the plane C 2 together with one of its coordinate axes respectively, while the torus (C \ {0}) n+2 ⊂ X and the orbit O can be considered as dense subsets of C n+2 together with one of its coordinate hyperplanes. Therefore, π is just the projection from C n+2 to C 2 forgetting the first n coordinates, which maps the torus (C \ {0}) n+2 to the torus (C \ {0}) 2 , the orbit O to the orbit O and the point q to the point p. Thus, under this assumption, the statement of the lemma is reduced to the following trivial statement: if a curve C ⊂ C n+2 is smooth and intersects a "vertical" coordinate hyperplane transversally at the point q, then its image π(C) is a smooth curve which transversally intersects the corresponding coordinate axis at the point p = π(q).
Finally, due to Assumption 4.1, the general statement of the lemma can be reduced to the special case considered above by applying a certain monomial change of variables preserving horizontality of the facets of . The existence of such a change of variables follows from Proposition 4.6. Then the truncation fˇ after this change of variables is the polynomial αx 2 −y 2 , whose zero set is a union of two lines { √ αx ±y} that do intersect the corresponding orbit of the toric variety Xˇ transversally.
Note that, inside the torus (C \ {0}) 2 , the curveČ defined byf is a 2-covering of the curve C defined by f .
Consider a 1-dimensional orbit O of the toric variety X P containing multiple points of the closure of the curve C. Let ⊂ P be the corresponding edge of the polygon P and γ ∈ (Z 2 ) * be the primitive covector supported at . Assumption 4.10 For any pair of facets 1 = γ 1 , 2 = γ 2 , γ 1 = γ 2 , parallel to the edge , we have Proof It is clear that this set is Zariski open. Therefore, one just has to show that it is not empty. Indeed, take a tuple of polynomials that does not satisfy the assumption. Since 1 = 2 , there exists a monomial f belonging to the set A ∩ 1 but not to the set 2 . Perturbing its coefficient in one of the polynomials f j , for instance in f 1 , we do not change any of the roots for the truncated system { f 2 1 = · · · = f 2 n+1 = 0}. At the same time, this system has only finitely many roots, and, thus, for generic ε, the projections of the roots for the system { f 1 1 + ε · f = · · · = f 1 j = · · · = f 1 n+1 = 0} do not coincide with those of the roots for { f 2 1 = · · · = f 2 n+1 = 0}, which concludes the proof. The lattice length of an edge = P γ ⊂ P equals the sum of the integer volumes of all the facets ⊂ Δ that are parallel to (see Lemma 2.51 for details). Proposition 4.11 implies that, for generic f 1 , . . . , f n+1 ∈ C A , each of these facets contributes to its own subset of multiple points in the orbit O ⊂ X P , and, for any pair of facets 1 , 2 parallel to , the corresponding subsets do not intersect. Therefore, without loss of genericity, one can consider the case when there is a unique facet ⊂ Δ, such that the projection of the primitive covector supported at it coincides with γ. In this setting, the truncation h of the polynomial h defining the curve C has Length( ) = Vol( ) roots if counted with multiplicities, and those multiplicities are equal to ind v (A ∩ ) (for details, see Theorem 5.3 in [19]).
Let us also suppose that the facet is "vertical", i.e., the restrictions f 1 , . . . , f n+1 are polynomials in x 1 , . . . , x n , y. Due to Assumption 4.1, one can always achieve that by performing a certain monomial change of variables preserving horizontality of faces of the polytope (see Proposition 4.6).
Let p be a multiple point of intersection of the closure of the curve C with the 1-dimensional orbit O of the toric variety X P corresponding to the edge . Lemma 4.8 implies that in a small neighborhood of the point p, the curve C is a union of smooth branches intersecting O transversally. We will now compute the order of contact between any two of those branches in terms of the support set A.

Example 4.12 Consider the support set
Let p = (0, . . . , 0, u, 0) be a multiple intersection point of the curve C with the 1dimensional orbit of the toric variety X P corresponding to the edge ⊂ P. Consider a pair of branches of the curve C passing through the point p. Then the preimages of these two branches of the curve C intersect the orbit corresponding to the facet ⊂ Δ at the points p 1 = (v 1 , . . . , v n , u, 0), p 2 = (v 1 , . . . , v n , u, 0) respectively. Moreover, for every 1 ≤ i ≤ n + 1, we have g i ( p 1 ) = g i ( p 2 ). Due to Assumption 3.7 the support set A satisfies ind v (A) = 1. Therefore there exists a number K ∈ N, such that for 1 ≤ i ≤ n + 1, we have g i,K −1 ( p 1 ) = g i,K −1 ( p 2 ) and g i,K ( p 1 ) = g i,K ( p 2 ). We denote this number by K ( p 1 , p 2 ) to emphasize its dependence on the points p 1 , p 2 .

Example 4.13
Consider the same simplexˇ as in Example 4.12. The projection C of a complete intersection given by generic polynomials f 1 , f 2 supported at A, has two multiple points on the 1-dimensional orbit of the toric variety X P corresponding to the edge = P (0,−1) . The polygon P is a standard simplex of size 4, and since ind v (A ∩ ) = 2, each of the multiple points has 2 preimages. Take any of them, and denote it by p. Its preimages p 1 , p 2 are not distinguished by f j while the polynomials g j,1 do distinguish them. Therefore, we have K ( p 1 , p 2 ) = 1. Lemma 4.14 In the same notation as above, for a generic tuple of polynomials f 1 . . . , f n+1 ∈ C A the order of contact between the projections of the branches of the curve C passing through the points p 1 , p 2 , such that π( p 1 ) = π( p 2 ) = p, equals to K ( p 1 , p 2 ). p 2 ), where p 1 , p 2 are as described above. Let us first compute the lower bound for the sought order of contact using the following proposition.

Proposition 4.15
The order of contact between the projections of the branches of C passing through the points p 1 , p 2 is greater or equal to K .

Proof of Proposition 4.15
Note that the points p 1 = (v 1 , . . . , v n , u, 0), p 2 = (v 1 , . . . , v n , u, 0) under consideration are related in the following way. For some integers a 1 , . . . , a n , we have v j = r j v j , where r j is some (a j )-th root of unity. Also, note that rescaling the coordinate system in the same manner, i.e. performing the change of variablesx i = r j x j , does not affect the coefficients monomials of f 1 , . . . , f n+1 that do not distinguish the points p 1 and p 2 . For 1 ≤ j ≤ n + 1, denote by F j the part of f j which is invariant under this rescaling, and by G j the part that is not. Now, let us compute the order of contact at the point p 1 between the complete intersection curves C = { f 1 = · · · = f n+1 = 0} and X = {F 1 = · · · = F n+1 = 0}. Let the curve X be locally parametrized, i.e., in a neighborhood of the point p 1 , the curve X is the image of a parametrization map s → ϕ(s) = (ϕ 1 (s), . . . , ϕ n (s), ϕ n+1 (s), ϕ n+2 (s)). Note also that since the (n + 2)-th coordinate of p 1 is 0, the Taylor series of ϕ n+2 at p 1 has no constant term, therefore it starts with the term of degree at least 1 in s.
Substituting ϕ(s) into the system { f 1 = · · · f n+1 = 0}, we obtain the following system: The way the number K = K ( p 1 , p 2 ) was defined implies that the polynomials G j are of the form G j = ∞ m=K t m g i,m (x 1 . . . , x n , y). Thus, for 1 ≤ j ≤ n + 1, the leading term in G j (ϕ(s)) is of degree ≥ K in s. Therefore, the order of contact between X and C at p 1 is at least K . The same is true for the order of contact between X and C at p 2 .
Now we note that the change of variablesx i = r j x j maps the branch of the curve X passing through p 1 to the one passing through p 2 and at the same time does not change the defining polynomials of X . Moreover, since this change of variables does not affect the last two of the n + 2 coordinates, the projections of the two above-mentioned branches of X coincide in some neighborhood of p = π( p 1 ) = π( p 2 ). Finally, the projection π does not decrease the order of contact between curves, which yields the desired inequality. Now we will state and prove the following special case of Lemma 4.14.
Proposition 4.16 In the same notation as above, suppose that K ( p 1 , p 2 ) = 1. Then for generic f 1 , . . . , f n+1 ∈ C A , the projections of the branches of C that pass through p 1 and p 2 intersect transversally.

Proof of Proposition 4.16
The idea is to compare the projections of the tangent lines to the curve C at the points p 1 and p 2 and make sure that for almost all f 1 , . . . , f n+1 ∈ C A , they do not coincide.
To find the tangent lines at p 1 and p 2 we need to compute the kernel of the differential (n + 1)-form n+1 i=1 d f i at those points. Moreover, since we need to compare the projections of the tangent lines, the only components of n+1 i=1 d f i that we have to look at are dx 1 ∧ · · · ∧ dx n ∧ dt and dx 1 ∧ · · · ∧ dx n ∧ dy. In the setting that is being considered, the corresponding coefficients will be the two maximal minors M n+1 and M n+2 obtained by keeping the first n columns of the (n + 1) × (n + 2)-matrix J evaluated at the points p 1 and p 2 , where Therefore, we need to show that for generic f 1 , . . . , f n+1 , we have The condition (9) is clearly algebraic, so, the set of tuples f 1 , . . . , f n+1 ∈ C A satisfying it is Zariski open. To make sure it is everywhere dense, we need to show that it is non-empty. Indeed, suppose that for some f 1 , . . . , f n+1 ∈ C A , we have Note that for generic f 1 , . . . , f n+1 , the curve C transversally intersects the orbit of X corresponding to the facet . Therefore, the minor M n+2 does not vanish at the points p 1 and p 2 . Thus, the second column of the matrix in (10) is non-zero and equality (10) can be rewritten as follows: for some λ ∈ C. The minors M n+1 and M n+2 are given by the following formulas: The matrices in (12) are almost identical except for the last column, let us expand their determinants along this column. Then, we obtain: where D j are the cofactors of the entries in the last columns. We have that for generic f 1 , . . . , f n+1 , the curve C transversally intersects the orbit of X corresponding to the facet . Therefore, the minor M n+2 does not vanish at the points p 1 and p 2 . Thus, at least one of the cofactors D j is not zero. Without loss of generality, let us assume that the cofactor D 1 is not zero. Substituting equations in (13) into the system (11), we obtain: Now let us note, that if K = K ( p 1 , p 2 ) = 1, then the polynomial g 1,1 has at least one monomial α ∈ supp g 1,1 such that α( p 1 ) = α( p 2 ). If we change the coefficient of this monomial in g 1,1 (i.e. add ε · α, ε = 0 to g 1,1 ), then the left-hand sides of each of the equalities in (15) will change. Moreover, the choice of the monomial α guarantees that The right-hand sides of the equalities in (15) do not depend on g 1,1 and thus remain unchanged. Therefore, the equalities (15) become no longer true, so the determinant in (10) does not vanish anymore.
Finally, the statement of Lemma 4.14 for K = K ( p 1 , p 2 ) > 1 follows from Proposition 4.16 together with Proposition 4.15 by the following genericity argument (non-trivial in the sense that it does not produce an explicit genericity condition on the coefficients of the polynomials f 1 , . . . , f n+1 for K > 1). Indeed, if there are no other monomials α ∈ supp( g i,m ), i = K , then the change of variablesť = t K reduces this case to the one considered above. Moreover, the coefficients of the monomials α ∈ supp( g i,m ), i > K , do not change the sought order of contact. Finally, we need to deal with the monomials α ∈ supp( g i,m ), i < K . Let us consider the space parametrized by all possible choices of coefficients of the monomials α ∈ supp( g i,m ), i < K . The sought order of contact can be viewed as an integer-valued function constructively depending on the choice of these coefficients (i.e. representable as a finite linear combination of the indicator functions of algebraic sets). We already know its lower bound-it is equal to K . Moreover, if all of these coefficients are all equal to 0, then the desired order of contact is exactly K . By upper semi-continuity of the intersection index the latter means that for generic choice of the coefficients of the monomials α ∈ supp( g i,m ), i < K , the order of contact does not exceed K , and thus, is equal to K .

Singular points of the curve C at infinity
Denote by ( 1 , . . . , n+2 ) the coordinate system induced by the basis {e 1 , . . . , e n+2 } of R n+2 . Let ⊂ Δ be a non-horizontal facet contained in a hyperplane given by a linear equation of the form ( 1 , . . . , n+2 ) = c. The function is unique up to a scalar multiple, therefore, one can assume that the coefficients of are coprime integers and that for any α ∈ A\ , we have (α) < c.
We now construct a sequence of integers i = (i 1 , i 2 , . . .) as follows. Set B 1 = A ∩ . For every r > 1, we define Finally, for every r ≥ 1, we set

Remark 4.17
It is clear that for every r , the element i r divides i r −1 . Moreover, since for the set A we have ind v (A) = 1, any such sequence stabilizes to 1.
In the same notation as above, we state the following result.

Lemma 4.18
For a generic tuple of polynomials f 1 , . . . , f n+1 ∈ C A , all the singularities of the curve C at infinity (i.e. on the 1-dimensional orbits of the toric variety X P associated with the Newton polygon P of the curve C) are i -forking paths singularities for non-horizontal facets ⊂ Δ.
Proof This statement is a straightforward corollary of Lemma 4.8, Lemma 4.14 and Definition 2.59.

Comparing the Euler characteristics of the complete intersection and its projection
First, let us make the following important observation.

Proposition 4.19
If A ⊂ Z n+2 satisfies Assumption 3.7, then for generic f 1 , . . . , f n+1 ∈ C A , a generic point p ∈ C has exactly one preimage. Moreover, the set of points in C that have more than 1 preimage is finite.
Proof The first of the statements follows from Assumption 3.7 together with Theorem 2.32 applied to the essential collection Indeed, in the notation of Theorem 2.32, we have I = n + 3, L = L = Z n+2 and k = 0. So, d(A) = 1, which proves the first part of the Proposition. Moreover, note that since the projection π | C is a regular morphism of varieties, the set of points having more than one preimage is a constructible set, which we denote by B. Let us show that it is finite.
Indeed, assume that B is infinite. Then it is of positive dimension, therefore, it contains an algebraic curve (possibly with finitely many punctured points). An algebraic curve in (C \ {0}) 2 has at least one branch at infinity. Lemma 4.18 implies that this branch is one of the branches of a forking paths singularity of the curve C at infinity. At the same time we note that the preimage of this branch contains a pair of branches of the curve C. However, Lemma 4.14, Lemma 4.18 and Remark 4.17 imply that the projections of any two branches of the curve C at infinity cannot coincide.

Remark 4.20
Note that it suffices to prove Theorem 3.10 for a support set A whose convex hull satisfies Assumption 4.1. Indeed, suppose does not satisfy this assumption. Then, using a monomial change of variables of the formx i = x i ,y N ! = y,ť N ! for N big enough, we obtain the polytopeˇ that satisfies the desired assumption. Moreover, as was discussed in Remark 4.3, under this change of variables, the left-hand side of (8) is multiplied by N ! 2 . Note that each of the summands in the right-hand side of (8) is also multiplied by N ! 2 . Therefore, the N ! 2 factor can be cancelled out. Hence, it is sufficient to prove Theorem 3.10 under Assumption 4.1.

Proof of Theorem 3.10
Suppose that the polytope satisfies Assumption 4.1. The number D can be deduced from the following system of equations: where b(s) is the number of branches passing through the singular point s ∈ S.
The first equation is a straightforward corollary of Theorem 2.54 (see Example 2.56 for details).
The second equation follows from the additivity property of Euler characteristic combined with the Bernstein-Kouchnirenko theorem: to obtain the Euler characteristic of C from the one of C, one just needs to count the multiple points as many times as the number of branches passing through them and subtract the number of points coming from vertical asymptotes of the curve C (and thus contained in the set C\π( C)).
Finally, the third equation can be deduced as follows. Let Y be a smooth curve having the same Newton polygon P as the curve C. Theorem 2.54 implies that its Euler characteristic is equal to − Area(P) (see Example 2.55). Now, we compare the Euler characteristic of Y with the one of C, and we have the following equality: where the third summation runs over all forking paths singularities of C at infinity. Indeed, the right-hand side of (17) can be interpreted as follows. We puncture small neighborhoods of singular points of the curve C. Then we replace those neighborhoods with their Milnor fibers. The latter are of Euler characteristic b(s) − 2δ(s), by Milnor formula (see Theorem 10.5 in [18]). Finally, we add the Milnor fibers of the forking paths singularities of C. Then, the Euler characteristic of the curve that we obtain this way equals the Euler characteristic of the smooth curve Y .
Remark 4.20 implies that the desired statement holds true without Assumption 4.1, which concludes the proof of Theorem 3.10.

On the singular points of the curve C
We begin this subsection by stating the following conjecture. Conjecture 5.1 naturally leads to the following question. Problem 5.3 In the same notation as above, compute the sum of the δ-invariants of the singularities of the curve C at the punctured points of the curve π( C).
Given a solution to Problem 5.3, one could then compute the number of nodes of the curve π( C) itself. Under the following assumption, we state a conjecture for this number.  For generic f 1 , . . . , f n+1 ∈ C A , the image of the 1-dimensional complete intersection C = { f 1 = · · · = f n+1 = 0} under the projection π : (C \ {0}) n+2 → (C \ {0}) 2 forgetting the first n coordinates, is an algebraic plane curve π( C) with punctured points. Its singular locus S (not including the punctured points) consists of isolated singular points, and the number D = s∈S δ(s) can be computed via the following formula: where δ(s) is the δ-invariant of the singular point s, the polygon P = π ( ) is the fiber polytope of with respect to the projection π, the set F ( ) is the set of all the facets of the polytope , and H( ) ⊂ F ( ) is the set of all the horizontal facets of the polytope .
We will now prove Conjecture 5.6 under an additional assumption on the support set A. We begin with a result which is a straightforward corollary of Theorem 3.10.
Theorem 5.7 Let A ⊂ Z n+2 be a finite set of full dimension, satisfying Assumption 3.7, and let ⊂ R n+2 be its convex hull. Let π : (C\{0}) n+2 → (C\{0}) 2 be the projection forgetting the first n coordinates. In the same notation as above, suppose that the set H( ) is empty.
Then for generic f 1 , . . . , f n+1 ∈ C A , the image of the curve C = { f 1 = · · · = f n+1 = 0} under the projection π is an algebraic plane curve C (with no points punctured), whose singular locus S consists of isolated singular points. The number D = s∈S δ(s) can be computed via the following formula: where δ(s) is the δ-invariant of the singular point s, P = π ( ) is the fiber polytope of with respect to π, the set F ( ) is the set of all facets of the polytope .
Theorem 5.7 applies to the case when the polytope is developed with respect to the plane of projection π. We can, in fact, prove a stronger statement, namely, Theorem 5.11, which works for a slightly more general case when the support set A satisfies an additional property (see Assumption 5.8 below).

Assumption 5.8
For every horizontal face ⊂ Δ, one of the following two possibilities is realized: -the preimage ⊂ Δ is not a facet; -⊂ Δ is a facet, and the set A\ is at lattice distance 1 from .

Remark 5.9
One can rephrase the second condition in Assumption 5.8 as follows: if ⊂ is a facet contained in a hyperplane given by the equation ( 1 , . . . , n+2 ) = c, then we have The set C\π( C) consists of the projections of the intersection points of the curve C with the orbits of the toric variety X corresponding to the horizontal facets of the polytope . As we will see further, under Assumptions 5.4 and 5.8 , for generic f 1 , . . . , f n+1 ∈ C A , the points in C\π( C) are smooth, therefore each of those points contributes exactly 1 to the Euler characteristic of the curve C. Lemma 5.10 Let A ⊂ Z n+2 be a finite set of full dimension, satisfying Assumptions 3.7, 5.4 and 5.8. Then for generic f 1 , . . . , f n+1 ∈ C A , the following statements are true:  1 are nonzero for all 1 ≤ i ≤ n + 1. Let q = (u 2 , . . . , u n , y 0 , t 0 ) be a root for the system f 1 = · · · = f n+1 = 0 and p = (0, u 2 , . . . , u n , y 0 , t 0 ) ∈ O be the corresponding limiting point of the curve C.
We need to show that there is no other point p in the closure of the curve C ⊂ X such that π( p ) = π( p) = (y 0 , t 0 ). Suppose that such a point p exists. Then Proposition 4.11 implies that the point p either belongs to the same orbit O as the point p, or is in the torus (C \ {0}) n+2 .
As we will see further, due to Assumption 5.4, the first of the two options is not the case. In other words, we will show that for any two distinct roots q and q for the truncated system f 1 = · · · = f n+1 = 0, at least one of the characters y 1 or t 1 attains distinct values on q and q .
The latter is equivalent to the following statement: if the overdetermined system is consistent, then it has a unique root. Let be the lattice in = Z n+2 e n+1 , e n+2 Z n generated by the image of ∩ A under the projection ρ : Z (n+2) Z (n+2) e n+1 , e n+2 . Note that its dimension is equal to n − 1. Assumption 5.4 implies that the lattice ⊂ is saturated, therefore the sets Moreover, these sets cannot be shifted to the same proper sublattice in L Z n+1 .
The statement that we are proving is then a special case of Theorem 2.32: we take the essential collection A consisting of n + 1 copies of the set A ∩ ⊂ Z n+2 and two more sets supp(y − y 0 ), supp(t − t 0 ) ⊂ Z n+2 . In the notation of this theorem, the formula for the number d(A) in our special case gives 1, which means that for generic f 1 , . . . , f n+1 ∈ C A , the system { f 1 = · · · = f n+1 = y − y 0 = t − t 0 = 0} has exactly one root q. Indeed, in our case L = L, because L is saturated, and k = 0, because the collection is essential.
Therefore, any other point p ∈ C such that π( p ) = π( p) should belong to (C \ {0}) n+2 , and thus any monomial of degree at least 1 in x 1 distinguishes the points p and p . Assumption 5.8 implies the existence of such a monomial. Thus we can construct a polynomial f such that f ( p) = 0, and f ( p ) = 0. Adding ε · f to one of the f i 's does not affect the point p in any way, while p does not belong to the corresponding complete intersection anymore. At the same time, the polynomial ( f i + ε · f ) | p := f i (x 1 , u 2 , . . . , u n , y 0 , t 0 ) + ε · f (x 1 , u 2 , . . . , u n , y 0 , t 0 ) is a polynomial in one variable x 1 , which has only finitely many roots r 1 , . . . , r m . Therefore, for generic f 1 , . . . , f n+1 , the restrictions f j | p , j = i do not all vanish at r 1 , . . . , r m . This concludes the proof of Part 1.
Part 2. In the same notation as above, to describe the tangent line to the point p, one needs first to compute the kernel of the differential form n+1 i=1 d f i at the point p. Since we are interested in the projection of the tangent line, the only components that we need to compute are dx 1 ∧ · · · ∧ dx n ∧ dy and dx 1 ∧ · · · ∧ dx n ∧ dt. The corresponding coefficients are the two maximal minors M n+1 and M n+2 obtained by keeping the first n columns of the (n + 1) × (n + 2)-matrix J evaluated at p, where The projection of the tangent line to the curve C at the point p is 1-dimensional if and only if at least one of M n+1 ( p) and M n+2 ( p) is not zero. This condition is algebraic, therefore, the set of all tuples f 1 , . . . , f n+1 ∈ C A , that satisfy it is Zariski open. Thus, the only thing that we still need to show is that this set is non-empty. Indeed, let M n+1 ( p) and M n+2 ( p) both vanish for some f 1 , . . . , f n+1 ∈ C A . The latter means that the following equalities hold: Let us look at the first equality. We have that the Jacobian of g 1 , . . . , g n+1 does not vanish at p. Expanding it along the second to last column, we conclude that at least one of the cofactors is not zero. Without loss of generality, assume that this is the cofactor D 1 of ∂ g 1 ∂ y . Now, let us expand the determinant M n+1 along the first column. The cofactors D j of the elements g j,1 are exactly the same as the ones of ∂ g j ∂ y in the Jacobian matrix of g 1 , . . . , g n+1 . Thus we have: or, equivalently, By Assumption 5.8, the polynomial g 1,1 is nonzero, therefore, it has at least one monomial with a nonzero coefficient. If we change this coefficient, the left-hand side of (20) changes, while the right-hand side does not. Therefore, (20) is no longer true, which concludes the proof of Part 2.
The following result is a straightforward corollary of Theorem 3.10 and Lemma 5.10.

Theorem 5.11
Let A ⊂ Z n+2 , n ≥ 1, be a finite set of full dimension containing 0 and satisfying Assumptions 3.7, 5.4 and 5.8. Let ⊂ R n+2 be its convex hull .  For generic f 1 , . . . , f n+1 ∈ C A , the image of the 1-dimensional complete intersection C = { f 1 = · · · = f n+1 = 0} under the projection π : (C \ {0}) n+2 → (C \ {0}) 2 forgetting the first n coordinates is an algebraic plane curve with punctured points. Its singular locus S (not including the punctured points) consists of isolated singular points, and the number D = s∈S δ(s) can be computed via the following formula: where δ(s) is the δ-invariant of the singular point s, the polygon P = π ( ) is the fiber polytope of with respect to the projection π, and the set F ( ) is the set of all facets of the polytope .
Proof Assumption 5.8 guarantees that for every horizontal facet ⊂ Δ, we have i = (1, 1, . . .). Therefore, in this case, we have the equality Theorem 3.10 gives the formula for the sum D of the δ-invariants of all the singularities of the closure C of the curve π( C). Lemma 5.10 implies that all the points of the complement C\π( C) are smooth, therefore those points do not contribute to the sum D, which concludes the proof of the theorem.

Vol( ).
All the other summands in (18) are the same as in (21), so these two expressions give the same answer.

Example 5.13
Let us apply Theorem 5.11 to the following two support sets (see Fig. 8): We have that conv(A 1 ) = conv(A 2 ) = , and Vol( ) = 3. In this case, the polygon P is a standard simplex of size 3, therefore, Area(P) = 9. In both cases, the horizontal facet contributes exactly 1 punctured point. Also, in both cases, we have exactly one facet ⊂ Δ (hatched orange) such that ind v (A 1 ∩ ) = 1 and ind v (A 2 ∩ ) = 1. The area of this facet is equal to 1. . Substituting all of this data into (21), we get:

The tropical counterpart
It is very natural to study the behaviour of singularities of generic objects under passing to the tropical limit. There is a number of papers in which this problem is addressed, we first give a short overview. According to Mikhalkin's correspondence theorem (see [13] and [20]), under passing to the tropical limit, the nodes of a generic nodal curve in (C \ {0}) 2 are accumulated with certain multiplicities in triple points and crossings of the corresponding tropical curve, as well as the midpoints of its multiple edges.
The main result of [10] is the classification of singular tropical curves of maximaldimensional geometric type. A singular point of such a tropical curve of this type is either a crossing of two edges, or a multiplicity 3 three-valent vertex, or a point on a midpoint of an edge of weight 2. The work [11] by the same authors addresses a similar problem for singular tropical surfaces in the 3-dimensional space.
The work [14] is devoted to the study of behaviour of log-inflection points of curves in (C \ {0}) 2 under the passage to the tropical limit. Assuming that the limiting tropical curve is smooth, the authors show that the log-inflection points accumulate by pairs at the midpoints of its bounded edges.
In [12], lifts of tropical bitangents (i.e., nodes of the dual curve) to the tropicalization of a given complex algebraic curve and their lifting multiplicities are studied. In particular, it is shown that all seven bitangents of a smooth tropical plane quartic lift in sets of four to algebraic bitangents.
Algebraic and combinatorial aspects of projections of m-dimensional tropical varieties onto (m + 1)-dimensional planes are studied in [8]. For the case of curves (which is exactly the tropical version of the problem addressed in our paper), some bounds for the number of self-intersections of projections onto the plane were given, as well as constructions with many self-intersections.
The tropical limit of C τ as τ → ∞ is a tropical curve C. By C denote its image under the projection forgetting the first n coordinates.
Problem 5.14 In the same notation as above, which points of the tropical curve C are the tropical limits of nodes of the curves C τ as τ → ∞? How many nodes does each of those points "accumulate"?
The example below illustrates the case when the tropical limit of the nodes of the curves C τ is a node of the corresponding plane tropical curve C.  (Fig. 9). The area of P is equal to 6. For each of the facets ∈ F (Δ) we have ind v (A∩ ) = 1, and the set H( ) of the horizontal facets is empty. Therefore, by Theorem 5.7, the number of nodes of the projection of a generic complete intersection defined by polynomials f , g ∈ C A , is equal to 6 − 2 · 2 2 = 1.
One can easily express the coordinates (u, v) of this unique double point in terms of the coefficients of the polynomials f , g. Indeed, suppose that we have f = a 0 + a 1 x + a 2 x 2 + a 3 t + a 4 x y and g = b 0 + b 1 x + b 2 x 2 + b 3 t + b 4 x y. If f (x, u, v) and g(x, u, v) have two common roots as polynomials in the variable x, then, the numbers u, v clearly should satisfy the following equations: Now, consider the following deformation of the polynomials f and g : g τ (x, y, t) = τ 5 + τ 5 x + τ 5 x 2 + τ 5 t + τ 6 x y; Passing to the tropical limit, we obtain a pair of tropical polynomials F(X , Y , T ) and G(X , Y , T ), where: (1, 0) Fig. 11 The tropical curve C and the corresponding subdivision of the polygon P Now, let us substitute the coefficients of the polynomials f τ (x, y, t) and g τ (x, y, t) into the expressions for the coordinates (u, v) of the node of the curve C (see (22)). We get: Therefore, the tropical limit of the nodes of the curves C τ in this case is the point (−1, 0) (marked red). Unlike the case considered in Example 5.15, this point is not a vertex of the corresponding nodal tropical curve. Moreover, the edge containing this point is of multiplicity 2.