summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJaron Kent-Dobias <jaron@kent-dobias.com>2021-03-23 13:21:34 +0100
committerJaron Kent-Dobias <jaron@kent-dobias.com>2021-03-23 13:21:34 +0100
commit0ab881e04d8cf6d83917f99d21b9d8bda922b440 (patch)
tree9b9f0af0d4dbb3b08390508a044cd8fa43d0db9f
parent5a903b3dca614142434a51054157e1f6642a63ae (diff)
downloadPRR_3_023064-0ab881e04d8cf6d83917f99d21b9d8bda922b440.tar.gz
PRR_3_023064-0ab881e04d8cf6d83917f99d21b9d8bda922b440.tar.bz2
PRR_3_023064-0ab881e04d8cf6d83917f99d21b9d8bda922b440.zip
Expanded on Stokes reasoning.
-rw-r--r--bezout.tex19
1 files changed, 14 insertions, 5 deletions
diff --git a/bezout.tex b/bezout.tex
index 902818c..ca0475c 100644
--- a/bezout.tex
+++ b/bezout.tex
@@ -85,11 +85,20 @@ $2N$-dimensional complex space has turned out to be necessary for correctly
defining and analyzing path integrals with complex action (see
\cite{Witten_2010_A, Witten_2011_Analytic}), and as a useful palliative for the
sign problem \cite{Cristoforetti_2012_New, Tanizaki_2017_Gradient,
-Scorzato_2016_The}. In order to do this correctly, features of landscape
-of the action in complex space---such as the relative position of saddles and the existence of Stokes lines joining them---must be understood. Such landscapes are in general not random: here
-we follow the standard strategy of computer science by understanding the
-generic features of random instances, expecting that this sheds light on
-practical, nonrandom problems.
+Scorzato_2016_The}. In order to do this correctly, features of landscape of
+the action in complex space---such as the relative position of saddles and the
+existence of Stokes lines joining them---must be understood. This is typically
+done for simple actions with few critical points, or with a target
+phenomenology that possesses symmetries that restrict the set of critical
+points to few candidates. Given the recent proliferation of `glassiness' in
+condensed matter and high energy physics, it is inevitable that someone will
+study a complex landscape with these methods, and will find old heuristic
+approaches unsuitable. Such landscapes may in general not be random: here we
+follow the standard strategy of computer science by understanding the generic
+features of random instances of a simple case, expecting that this sheds light
+on practical, nonrandom problems. While in this paper we do not address
+analytic continuation of configuration space integrals, understanding the
+distribution and spectra of critical points is an essential first step.
Returning to our problem, the spherical constraint is enforced using the method
of Lagrange multipliers: introducing $\epsilon\in\mathbb C$, our constrained