REVIEW 4 cited by
Region analysis of QED massive fermion form factor
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
Region analysis of QED massive fermion form factor
read the original abstract
We perform an analysis of the one- and two-loop massive quark form factor in QED in a region expansion, up to next-to-leading power in the quark mass. This yields an extensive set of regional integrals, categorized into three topologies, against which factorization theorems at next-to-leading power could be tested. Our analysis reveals a number of subtle aspects involving rapidity regulators, as well as additional regions that manifest themselves only beyond one loop, at the level of single diagrams, but which cancel in the form factor.
Forward citations
Cited by 4 Pith papers
-
Analytical two-loop amplitudes of $e^{+} e^{-} \longrightarrow \boldsymbol{J} / \boldsymbol{\psi}+\boldsymbol{\eta}_c$ at $B$ factories
The authors present the first analytical two-loop NRQCD amplitude for e+e- to J/psi+eta_c as an expansion in m_c^2/s, with cross-section predictions consistent (within uncertainties) with B-factory data.
-
The Fate of Ultra-Collinear Modes in On-Shell Massive Sudakov Form Factors
Ultra-collinear modes cancel to all orders in on-shell massive Sudakov form factors by gauge invariance, preserving SCET_II factorization, with explicit two-loop soft and jet functions computed via eta regulator and N...
-
Random Reshuffling-Based Distributed Nash Equilibrium Seeking
Random reshuffling enables distributed Nash equilibrium seeking with linear convergence to a neighborhood under constant steps and exact almost-sure convergence under diminishing steps.
-
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 with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.