Computing Arrangements of Hypersurfaces
Paul Breiding, Bernd Sturmfels, Kexin Wang
TL;DR
The paper introduces HypersurfaceRegions.jl for computing all regions of the complement of an arrangement of real algebraic hypersurfaces in $\mathbb{R}^n$, with regions organized by sign patterns $\sigma\in\{-1,+1\}^k$ and their Euler characteristics. The core method builds an exhaustive Morse function $g$ from a master function $g(x)=\dfrac{\prod|f_i|^{s_i}}{q^t}$, locates critical points via $\nabla\log g=0$ using $HomotopyContinuation.jl$, and uses the Mountain Pass Theorem to connect index-0 points through index-1 points by gradient flow, thereby identifying region boundaries and invariants. The approach also includes a projective variant and a user-friendly Julia interface, enabling applications to generic hypersurface systems and spectrahedra with experiments indicating robust scalability and accurate region counts (including noncontractible regions). This provides a practical tool to study real hypersurface arrangements, compute Euler characteristics per region, and explore discriminantal and ML-degree related topology in higher dimensions. The work demonstrates how numerical algebraic geometry, Morse theory, and path tracking yield a versatile pipeline for topological classification of real algebraic complements.
Abstract
We present a Julia package HypersurfaceRegions.jl for computing all connected components in the complement of an arrangement of real algebraic hypersurfaces in $\mathbb{R}^n$.
