On computing local monodromy and the numerical local irreducible decomposition

Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a 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 actions of linear projection maps under analytic continuation thereby allowing computations to be performed beyond a local neighborhood. Using this characterization, we then present an algorithm to compute the local monodromy action following the paradigm of numerical algebraic geometry. A germ of 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 results are illustrated using several examples facilitated by an implementation in an open source software package.

Authors

Institutions

Publication Details

Journal
Transactions of the London Mathematical Society
Published
2026-01-07
DOI
https://doi.org/10.1112/tlm3.70025
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On computing local monodromy and the numerical local irreducible decomposition

Jonathan D. Hauenstein, Parker B. Edwards
Transactions of the London Mathematical Society
Polynomial and algebraic computation
article

On computing local monodromy and the numerical local irreducible decomposition

Jonathan D. Hauenstein, Parker B. Edwards
article en

Abstract

Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a 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 actions of linear projection maps under analytic continuation thereby allowing computations to be performed beyond a local neighborhood. Using this characterization, we then present an algorithm to compute the local monodromy action following the paradigm of numerical algebraic geometry. A germ of 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 results are illustrated using several examples facilitated by an implementation in an open source software package.

Transactions of the London Mathematical SocietyVol. 13(1)
University of Notre Dame (US), Florida Atlantic University (US)
Openalex Percentile: Top 95%
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.