vix.ing · top · new · best · stats · spec

Solving the likelihood equations to compute Euler obstruction functions

2018/04/29 by Rodriguez, Jose Israel
#Algebraic Geometry (math.AG) #FOS: Mathematics

paper · doi:10.48550/arxiv.1804.10936

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.

Related