Numerical polynomial homotopy continuation method and string vacua
From MaRDI portal
Symbolic computation and algebraic computation (68W30) Kaluza-Klein and other higher-dimensional theories (83E15) String and superstring theories in gravitational theory (83E30) Supergravity (83E50) Lamé, Mathieu, and spheroidal wave functions (33E10) Research exposition (monographs, survey articles) pertaining to relativity and gravitational theory (83-02)
Abstract: Finding vacua for the four dimensional effective theories for supergravity which descend from flux compactifications and analyzing them according to their stability is one of the central problems in string phenomenology. Except for some simple toy models, it is, however, difficult to find all the vacua analytically. Recently developed algorithmic methods based on symbolic computer algebra can be of great help in the more realistic models. However, they suffer from serious algorithmic complexities and are limited to small system sizes. In this article, we review a numerical method called the numerical polynomial homotopy continuation (NPHC) method, first used in the areas of lattice field theories, which by construction finds extit{all} of the vacua of a given potential that is known to have only isolated solutions. The NPHC method is known to suffer from no major algorithmic complexities and is extit{embarrassingly parallelizable}, and hence its applicability goes way beyond the existing symbolic methods. We first solve a simple toy model as a warm up example to demonstrate the NPHC method at work and compare the results with the available results from the symbolic methods. We then show that all the vacua of a more complicated model of M theory compactified on the coset , which has an SU(3) structure, can be obtained by the NPHC method using a desktop machine in just about one hour, a feat which was reported to be prohibitively difficult by the existing symbolic methods. Finally, we compare the various technicalities between the two methods.
Recommendations
Cites work
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 2095946 (Why is no real title available?)
- scientific article; zbMATH DE number 2109418 (Why is no real title available?)
- A simple introduction to Gröbner basis methods in string phenomenology
- Algorithm 795
- Algorithm 846
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Finding all isolated solutions to polynomial systems using HOMPACK
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- STRINGVACUA. A Mathematica package for studying vacuum configurations in string phenomenology
- Stationary point analysis of the one-dimensional lattice Landau gauge fixing functional, aka random phase \(XY\) Hamiltonian
- The Magma algebra system. I: The user language
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
Cited in
(14)- Algebraic geometrization of the Kuramoto model: Equilibria and stability analysis
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Statistics of stationary points of random finite polynomial potentials
- Mixed cell computation in HOM4ps
- Experiments on the zeros of harmonic polynomials using certified counting
- Finding all flux vacua in an explicit example
- Computational complexity of the landscape. I.
- Numerical elimination and moduli space of vacua
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- Exploring the potential energy landscape over a large parameter-space
- STRINGVACUA. A Mathematica package for studying vacuum configurations in string phenomenology
- Coulomb, Landau and maximally abelian gauge fixing in lattice QCD with multi-gpus
- Counting \(\mathcal{N} = 8\) black holes as algebraic varieties
- Parallel degree computation for binomial systems
Describes a project that uses
Uses Software
This page was built for publication: Numerical polynomial homotopy continuation method and string vacua
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765439)
