2016
DOI: 10.48550/arxiv.1607.04860
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Intersection multiplicity, Milnor number and Bernstein's theorem

Abstract: We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which completes works of Kushnirenko [Kus76] and Wall [Wal99]. 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 polytopes which have the maximum number (counted with multiplicity) of i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…Our formulas for the multiplicity of the origin can be seen as a generalization of those in [12], in the sense that the only hypotheses on the supports we make are the necessary ones, proved in [10, Proposition 6], so that the origin is an isolated zero of a generic system with the given supports. An earlier approach from [18] to compute the multiplicity of the origin under no further assumptions on the supports leads to a formula which, unlike ours, is not symmetric in the input polynomials, as already stated by the author. Furthermore, in this paper we give formulas for the multiplicity of arbitrary isolated affine zeroes of a generic sparse system.…”
Section: Introductionmentioning
confidence: 72%
See 2 more Smart Citations
“…Our formulas for the multiplicity of the origin can be seen as a generalization of those in [12], in the sense that the only hypotheses on the supports we make are the necessary ones, proved in [10, Proposition 6], so that the origin is an isolated zero of a generic system with the given supports. An earlier approach from [18] to compute the multiplicity of the origin under no further assumptions on the supports leads to a formula which, unlike ours, is not symmetric in the input polynomials, as already stated by the author. Furthermore, in this paper we give formulas for the multiplicity of arbitrary isolated affine zeroes of a generic sparse system.…”
Section: Introductionmentioning
confidence: 72%
“…In this sense, we may speak of µ A as the multiplicity of 0 as an isolated root of a generic sparse system supported on A. Explicit conditions on the coefficients satisfying mult A (c) = µ A are given in [18,Theorem 4.12]. Therefore, in this section, we will focus on the computation of the multiplicity of the origin as a common zero of a generic polynomial system supported on A = (A 1 , .…”
Section: Multiplicity Of the Originmentioning
confidence: 99%
See 1 more Smart Citation