S-matrix bootstrap in 3+1 dimensions: regularization and dual convex problem
Yifei He, Martin Kruczenski

TL;DR
This paper develops a dual convex optimization approach to the S-matrix bootstrap in 3+1 dimensions, providing a practical method to bound scattering amplitudes and explore physical theories, especially for scalar fields related to pion physics.
Contribution
It introduces a dual convex minimization framework for the 3+1 dimensional S-matrix bootstrap, enabling efficient bounds and analysis of scattering amplitudes with fewer variables.
Findings
The dual approach yields strict upper bounds on scattering amplitudes.
The method simplifies numerical computations by using a small number of dual partial waves.
Application to scalar fields relevant to pion physics demonstrates practical utility.
Abstract
The S-matrix bootstrap maps out the space of S-matrices allowed by analyticity, crossing, unitarity, and other constraints. For the scattering matrix such space is an infinite dimensional convex space whose boundary can be determined by maximizing linear functionals. On the boundary interesting theories can be found, many times at vertices of the space. Here we consider dimensional theories and focus on the equivalent dual convex minimization problem that provides strict upper bounds for the regularized primal problem and has interesting practical and physical advantages over the primal problem. Its variables are dual partial waves that are free variables, namely they do not have to obey any crossing, unitarity or other constraints. Nevertheless they are directly related to the partial waves , for which all crossing,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
