A geometric method of sector decomposition
read the original abstract
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method provides a deterministic algorithm and never falls into an infinite loop. The number of resulting sectors depends on the algorithm of triangulation. Our test implementation shows smaller number of sectors comparing with other existing methods with iterations.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Walking Sudakov: From Cusp to Octagon
In a novel scaling limit on the Coulomb branch of planar N=4 SYM, the Sudakov form factor and four-point amplitude exhibit double-logarithmic behavior governed by a walking anomalous dimension that interpolates betwee...
-
New algorithms for Feynman integral reduction and $\varepsilon$-factorised differential equations
A geometric order relation in IBP reduction yields a master-integral basis with Laurent-polynomial differential equations on the maximal cut that are then ε-factorized.
-
Five legs @ three loops: slightly off-shell dual conformal integrals
Three-loop five-point master integrals in N=4 SYM are evaluated via DCI-preserving regularization, cross-ratio factorization, and selective IBP/HyperInt reduction on 82 regions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.