Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Arnold's monotonicity problem (2006.11795v3)

Published 21 Jun 2020 in math.AG

Abstract: According to the Kouchnirenko formula, the Milnor number of a generic isolated singularity with given Newton polyhedron is equal to the alternating sum of certain volumes associated to the Newton polyhedron. In this paper we obtain a non-negative analogue (i.e. without negative summands) of the Kouchnirenko formula. The analogue relies on the non-negative formula for the monodromy operator from arXiv:1405.5355 and formulas for the Milnor number from arXiv:math/9901107 . As an application we give a criterion for the Arnold's monotonicity problem (1982-16) in arbitrary dimension, which leads to complete solution in dimension up to $4$ and partial solution in dimension $5$. The latter relies on the classification of thin triangulations (or vanishing local h-polynomial) in dimension $2$ and $3$ from arXiv:1909.10843 (and from the book by Gelfand, Kapranov and Zelevinsky) and contains examples which differ dramatically from the ones which arise in dimension up to $3$ in arXiv:1705.00323 (see also arXiv:2001.10316 ). Some of the $4$-dimensional examples were first described in arXiv:1309.0630 in the context of the local monodromy conjecture.

Summary

We haven't generated a summary for this paper yet.