Algorithmic Algebraic Geometry and Flux Vacua
James Gray, Yang-Hui He, André Lukas
TL;DR
This paper reframes the problem of finding vacua in flux-compactified 4D supergravities as an algorithmic algebraic-geometry task. By formulating the extrema of the scalar potential $V$ as a polynomial ideal problem, it enables primary (and saturation) decompositions and real-root analysis to enumerate all isolated vacua and extract their physical properties, including SUSY status, stability, and effective-theory validity. The authors develop practical tools for generating flux-constraint conditions and for systematically solving for vacua, demonstrated through toy models and concrete heterotic and M-theory examples. The approach leverages complex and real algebraic geometry, GTZ primary decomposition, and Sturm-query real root counting to yield results that are difficult or impossible with traditional methods, with clear path toward fully automated flux-vacua phenomenology. The work illustrates that perturbative flux vacua can be exhaustively analyzed and paves the way for broader incorporation of non-perturbative effects and automated scanning of string-phenomenology landscapes.
Abstract
We develop a new and efficient method to systematically analyse four dimensional effective supergravities which descend from flux compactifications. The issue of finding vacua of such systems, both supersymmetric and non-supersymmetric, is mapped into a problem in computational algebraic geometry. Using recent developments in computer algebra, the problem can then be rapidly dealt with in a completely algorithmic fashion. Two main results are (1) a procedure for calculating constraints which the flux parameters must satisfy in these models if any given type of vacuum is to exist; (2) a stepwise process for finding all of the isolated vacua of such systems and their physical properties. We illustrate our discussion with several concrete examples, some of which have eluded conventional methods so far.
