Computing Euler obstruction functions using maximum likelihood degrees
From MaRDI portal
Abstract: We give a numerical algorithm computing Euler obstruction functions using maximum likelihood degrees. The maximum likelihood degree is a well-studied property of a variety in algebraic statistics and computational algebraic geometry. In this article we use this degree to give a new way to compute Euler obstruction functions. We define the maximum likelihood obstruction function and show how it coincides with the Euler obstruction function. With this insight, we are able to bring new tools of computational algebraic geometry to study Euler obstruction functions.
Recommendations
Cited in
(7)- Solving the likelihood equations to compute Euler obstruction functions
- Likelihood equations and scattering amplitudes
- An implementation of the Lê-Teissier method for computing local Euler obstructions
- Characteristic classes
- Conormal spaces and Whitney stratifications
- Local Euler obstructions of reflexive projective varieties
- Applications of singularity theory in applied algebraic geometry and algebraic statistics
This page was built for publication: Computing Euler obstruction functions using maximum likelihood degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853663)