Underdetermined Dyson-Schwinger equations

• URL: http://arxiv.org/abs/2211.13026v2
• Date: Mon, 28 Nov 2022 10:36:43 GMT
• Title: Underdetermined Dyson-Schwinger equations
• Authors: Carl M. Bender, Christos Karapoulitidis and S.P. Klevansky
• Abstract summary: The paper examines the effectiveness of the Dyson-Schwinger equations as a calculational tool in quantum field theory. The truncated DS equations give a sequence of approximants that converge slowly to a limiting value. More sophisticated truncation schemes based on mean-field-like approximations do not fix this formidable calculational problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper examines the effectiveness of the Dyson-Schwinger (DS) equations as a calculational tool in quantum field theory. The DS equations are an infinite sequence of coupled equations that are satisfied exactly by the connected Green's functions $G_n$ of the field theory. These equations link lower to higher Green's functions and, if they are truncated, the resulting finite system of equations is underdetermined. The simplest way to solve the underdetermined system is to set all higher Green's function(s) to zero and then to solve the resulting determined system for the first few Green's functions. The $G_1$ or $G_2$ so obtained can be compared with exact results in solvable models to see if the accuracy improves for high-order truncations. Five $D=0$ models are studied: Hermitian $\phi^4$ and $\phi^6$ and non-Hermitian $i\phi^3$, $-\phi^4$, and $i\phi^5$ theories. The truncated DS equations give a sequence of approximants that converge slowly to a limiting value but this limiting value always {\it differs} from the exact value by a few percent. More sophisticated truncation schemes based on mean-field-like approximations do not fix this formidable calculational problem.

Related papers

• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Principle of minimal singularity for Green's functions [1.8855270809505869]
  We consider a new kind of analytic continuation of correlation functions, inspired by two approaches to underdetermined Dyson-Schwinger equations in $D$-dimensional spacetime. We derive rapidly convergent results for the Hermitian quartic and non-Hermitian cubic theories.
  arXiv  Detail & Related papers  (2023-09-05T13:06:57Z)
• Dyson-Schwinger equations in zero dimensions and polynomial approximations [0.0]
  The sequence of equations is underdetermined because if the infinite sequence of equations is truncated to a finite sequence, there are always more Green's functions than equations. An approach to this problem is to close the finite system by setting the highest Green's function(s)$ to zero. In all cases the sequences of roots converge to limits that differ by a few percent from the exact answers.
  arXiv  Detail & Related papers  (2023-07-03T13:41:11Z)
• Efficient Sampling of Stochastic Differential Equations with Positive Semi-Definite Models [91.22420505636006]
  This paper deals with the problem of efficient sampling from a differential equation, given the drift function and the diffusion matrix. It is possible to obtain independent and identically distributed (i.i.d.) samples at precision $varepsilon$ with a cost that is $m2 d log (1/varepsilon)$ Our results suggest that as the true solution gets smoother, we can circumvent the curse of dimensionality without requiring any sort of convexity.
  arXiv  Detail & Related papers  (2023-03-30T02:50:49Z)
• Taming Dyson-Schwinger equations with null states [0.913755431537592]
  In quantum field theory, the Dyson-Schwinger equations are an infinite set of equations relating $n$-point Green's functions in a self-consistent manner. One of the main problems is that a finite truncation of the infinite system is underdetermined. In this paper, we propose another avenue in light of the null bootstrap.
  arXiv  Detail & Related papers  (2023-03-20T10:04:43Z)
• ReSQueing Parallel and Private Stochastic Convex Optimization [59.53297063174519]
  We introduce a new tool for BFG convex optimization (SCO): a Reweighted Query (ReSQue) estimator for the gradient of a function convolved with a (Gaussian) probability density. We develop algorithms achieving state-of-the-art complexities for SCO in parallel and private settings.
  arXiv  Detail & Related papers  (2023-01-01T18:51:29Z)
• Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity [121.83085611327654]
  We structured convex optimization problems with additive objective $r:=p + q$, where $r$ is $mu$-strong convex similarity. We proposed a method to solve problems master to agents' communication and local calls. The proposed method is much sharper than the $mathcalO(sqrtL_q/mu)$ method.
  arXiv  Detail & Related papers  (2022-05-30T14:28:02Z)
• Learning Green's functions associated with parabolic partial differential equations [1.5293427903448025]
  We derive the first theoretically rigorous scheme for learning the associated Green's function $G$. We extend the low-rank theory of Bebendorf and Hackbusch from elliptic PDEs in dimension $1leq nleq 3$ to parabolic PDEs in any dimensions.
  arXiv  Detail & Related papers  (2022-04-27T09:23:39Z)
• Learning elliptic partial differential equations with randomized linear algebra [2.538209532048867]
  We show that one can construct an approximant to $G$ that converges almost surely. The quantity $0Gamma_epsilonleq 1$ characterizes the quality of the training dataset.
  arXiv  Detail & Related papers  (2021-01-31T16:57:59Z)
• Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity [94.37110094442136]
  We study the problem of agnostic $Q$-learning with function approximation in deterministic systems. We show that if $delta = Oleft(rho/sqrtdim_Eright)$, then one can find the optimal policy using $Oleft(dim_Eright)$.
  arXiv  Detail & Related papers  (2020-02-17T18:41:49Z)
• Differentially Quantized Gradient Methods [53.3186247068836]
  We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$. No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
  arXiv  Detail & Related papers  (2020-02-06T20:40:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.