REVIEW 2 cited by
On The Equivalence of Soft and Zero-Bin Subtractions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Zero-bin subtractions are required to avoid double counting soft contributions in collinear loop integrals in Soft-Collinear Effective Theory (SCET). In traditional approaches to factorization, double counting is avoided by dividing jet functions by matrix elements of soft Wilson lines. In this paper, we compare the two approaches to double counting, studying the quark form factor and deep inelastic scattering (DIS) as x_B \to 1 as examples. We explain how the zero-bin subtractions in SCET are required to reproduce the well-established factorization theorem for DIS as x_B \to 1. We study one-loop virtual contributions to the quark form factor and real gluon emission diagrams in DIS. The two approaches to double counting are equivalent if dimensional regularization (DR) is used to regulate infrared (IR) divergences. We discuss in detail ambiguities in the calculation of one-loop scaleless integrals in DR in SCET and perturbative QCD. We also demonstrate a nontrivial check of the equivalence of the zero-bin subtraction and the soft Wilson line subtraction in the virtual two-loop Abelian contributions to the quark form factor.
Forward citations
Cited by 2 Pith papers
-
Soft background fields at next-to-leading power in transverse momentum dependent SIDIS with jets
New next-to-leading-power factorization for SIDIS with jets from a background-field method with explicit soft modes, including operator-level definitions of twist-3 TMDs free of rapidity and endpoint divergences.
-
Random Reshuffling-Based Distributed Nash Equilibrium Seeking
Random reshuffling yields distributed Nash-seeking algorithms that, under partial decision information, converge linearly to a neighborhood (constant steps) or exactly a.s./in mean square (diminishing steps), outperfo...
Discussion (0). Sign in to comment.