On computing local monodromy and the numerical local irreducible decomposition
Parker B. Edwards, Jonathan D. Hauenstein
TL;DR
Addressing the local structure of a holomorphic germ $oldsymbol{V}$ at a point $x^*$, the paper develops a theory of local monodromy actions for generic linear projections and uses them to recover the local irreducible decomposition via numerical witness sets. It shows that local monodromy actions arise as sub-actions of global monodromy and can be extended beyond tiny neighborhoods through analytic continuation, enabling a practical algorithm with guarantees. The authors implement the method in open-source software and demonstrate its effectiveness on cones, Whitney umbrellas, Brieskorn-type hypersurfaces, and a four-bar linkage, reporting local/global fiber and branch degrees and the corresponding monodromy groups. This work provides a robust numerical framework for local singularity analysis with broad implications for computational algebraic geometry and related fields.
Abstract
Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Following the paradigm of numerical algebraic geometry, an algebraic subvariety at a point is represented by a numerical local irreducible decomposition comprised of a local witness set for each local irreducible component. The key requirement for obtaining a numerical local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well-defined on any small enough neighborhood. We characterize some of the behavior of local monodromy action of linear projection maps under analytic continuation, allowing computations to be performed beyond a local neighborhood. With this characterization, we present an algorithm to compute the local monodromy action and corresponding numerical local irreducible decomposition for algebraic varieties. The results are illustrated using several examples facilitated by an implementation in an open source software package.
