Solving the likelihood equations to compute Euler obstruction functions
From MaRDI portal
Publication:1662283
DOI10.1007/978-3-319-96418-8_48zbMATH Open1395.14003arXiv1804.10936OpenAlexW2964074565MaRDI QIDQ1662283FDOQ1662283
Publication date: 17 August 2018
Abstract: Macpherson defined Chern-Schwartz-Macpherson (CSM) classes by introducing the (local) Euler obstruction function, which is an integer valued function on the variety that is constant on each stratum of a Whitney stratification of an algebraic variety. By understanding the Euler obstruction function, one gains insights about a singular algebraic variety. It was recently shown by the author and B. Wang, how to compute these functions using maximum likelihood degrees. This paper discusses a symbolic and a numerical implementation of algorithms to compute the Euler obstruction at a point. Macaulay2 and Bertini are used in the implementations.
Full work available at URL: https://arxiv.org/abs/1804.10936
Intersection theory, characteristic classes, intersection multiplicities in algebraic geometry (14C17) Computational aspects of higher-dimensional varieties (14Q15)
Cited In (1)
Uses Software
This page was built for publication: Solving the likelihood equations to compute Euler obstruction functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662283)
