A new recursion relation for tree-level NLSM amplitudes based on hidden zeros
Xiaodi Li, Kang Zhou

TL;DR
This paper introduces a new recursion relation for tree-level NLSM amplitudes that leverages hidden zeros to simplify calculations and reproduce key amplitude features.
Contribution
It presents a novel BCFW-like recursion relation for NLSM amplitudes that avoids boundary term computations by exploiting hidden zeros.
Findings
Reproduces the Adler zero in NLSM amplitudes
Derives the $ ext{delta}$-shift construction from the recursion
Shows universal expansion into bi-adjoint scalar amplitudes
Abstract
In this note, we propose a novel BCFW-like recursion relation for tree-level non-linear sigma model (NLSM) amplitudes, which circumvents the computation of boundary terms by exploiting the recently discovered hidden zeros. Using this recursion, we reproduce three remarkable features of tree-level NLSM amplitudes: (i) the Adler zero, (ii) the -shift construction, which generates NLSM amplitudes from amplitudes, and (iii) the universal expansion of NLSM amplitudes into bi-adjoint scalar amplitudes. Our results demonstrate that the hidden zeros, combined with standard factorization on physical poles, uniquely determine all tree-level NLSM amplitudes.
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.
