The Newton tree: geometric interpretation and applications to the motivic zeta function and the log canonical threshold

From MaRDI portal
Revision as of 00:20, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5360352

DOI10.1017/S0305004115000493zbMATH Open1371.14025arXiv1310.8260MaRDI QIDQ5360352

Author name not available (Why is that?)

Publication date: 28 September 2017

Published in: (Search for Journal in Brave)

Abstract: Let I be an arbitrary ideal in Cx,y. We use the Newton algorithm to compute by induction the motivic zeta function of the ideal, yielding only few poles, associated to the faces of the successive Newton polygons. We associate a minimal Newton tree to I, related to using good coordinates in the Newton algorithm, and show that it has a conceptual geometric interpretation in terms of the log canonical model of I. We also compute the log canonical threshold from a Newton polygon and strengthen Corti's inequalities.


Full work available at URL: https://arxiv.org/abs/1310.8260




No records found.








This page was built for publication: The Newton tree: geometric interpretation and applications to the motivic zeta function and the log canonical threshold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360352)