2012
DOI: 10.1007/jhep07(2012)018
|View full text |Cite
|
Sign up to set email alerts
|

Numerical algebraic geometry: a new perspective on gauge and string theories

Abstract: The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gröbner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these shortcomings. Its so-called 'embarrassing parallelizability' allows us to solve many prob… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
48
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
8
2

Relationship

4
6

Authors

Journals

citations
Cited by 43 publications
(49 citation statements)
references
References 55 publications
(78 reference statements)
1
48
0
Order By: Relevance
“…(8), the so-called numerical polynomial homotopy continuation (NPHC) method [12] is particularly suitable. This method has the virtue of being able to find all the solutions of a given system of polynomial equations, and has been applied in the past to a variety of problems in particle theory and statistical mechanics [13][14][15][16][17][18][19][20][21][22][23][24]. A drawback of the NPHC method is that it is restricted to fairly small system sizes.…”
Section: Numerical Polynomial Homotopy Continuation Methodsmentioning
confidence: 99%
“…(8), the so-called numerical polynomial homotopy continuation (NPHC) method [12] is particularly suitable. This method has the virtue of being able to find all the solutions of a given system of polynomial equations, and has been applied in the past to a variety of problems in particle theory and statistical mechanics [13][14][15][16][17][18][19][20][21][22][23][24]. A drawback of the NPHC method is that it is restricted to fairly small system sizes.…”
Section: Numerical Polynomial Homotopy Continuation Methodsmentioning
confidence: 99%
“…The Gröbner basis method can be used to find all the minima of a polynomial function, as has recently seen some discussion in the literature [80,81]. A less well-known method is that of homotopy continuation [82,83], which has found use in several areas of physics [84][85][86], in particular finding string theory vacua [87,88] and extrema of extended Higgs sectors [89], where the authors investigated a system of two Higgs doublets with up to five singlet scalars in a general tree-level potential. In contrast, the Gröbner basis method is deemed prohibitively computationally expensive for systems involving more than five or six degrees of freedom [80], while for our purposes eight to ten degrees of freedom are necessary, and the solutions for thousands of parameter points needed to be calculated.…”
Section: B Finding All the Tree-level Extremamentioning
confidence: 99%
“…5 Polynomial equations are more amenable to numerical techniques such as the polynomial homotopy continuation method, 16 a method that has been applied to compute the stationary points of a variety of models in statistical mechanics and particle physics. [17][18][19][20][21][22][23][24][25] By applying this method to the polynomial form of the XY model, numerical results for the stationary points of the two-dimensional XY model were reported in Refs. 26 and 27 for small lattices of 3 × 3 sites.…”
Section: Previous Resultsmentioning
confidence: 99%