发表机构
Indian Institute of Technology - Kanpur; Beijing Institute of Mathematical Sciences and Applications（坎普尔印度理工学院; 北京应用数学与物理研究所）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究在Polyakov自举框架中建立截断数值方法，结合梯度下降优化求解PB求和规则，可确定与GFF光滑连接的一般交叉方程解，经多类例子验证其有效性。
AI 中文摘要
我们在Polyakov自举（PB）框架中建立了一种截断的数值方法，采用梯度下降优化数值求解PB求和规则，从微扰解出发迭代求解广义自由场（GFF）谱的任意形变的交叉方程。对于幺正形变，所得解与极值CFT谱一致；更重要的是，研究结果表明，一般的交叉方程解（不一定是幺正的，即不满足正性条件）可通过与GFF的光滑连接被唯一确定。我们通过单关联函数和混合关联函数两种情形的多个例子验证了该截断Polyakov自举方法的有效性。
英文摘要
We set up a truncated numerical approach in the Polyakov bootstrap (PB) framework. We employ a gradient descent optimization to solve PB sum rules numerically, and hence solve crossing for arbitrary deformations of the generalized free field (GFF) spectrum in an iterative way starting from a perturbative solution. For unitary deformations the solutions coincide with extremal CFT spectra. But more interestingly, our findings indicate that a general crossing solution, not necessarily unitary (i.e. without positivity), can be uniquely identified by a smooth connection to GFF. The truncated Polyakov bootstrap approach is established through a number of examples in both single and mixed correlator settings.
Comments41 pages, 10 figures
