Pith. sign in

REVIEW

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

arxiv 2006.07121 v2 pith:KV3BOZXM submitted 2020-06-12 math.AG hep-thmath-phmath.MP

Rationalizability of square roots

classification math.AG hep-thmath-phmath.MP
keywords squarerootsrationalizabilitygivetermscomputationsenergyfeynman
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a solution in terms of these functions is to rationalize all occurring square roots by a suitable variable change. In this paper, we give a rigorous definition of rationalizability for square roots of ratios of polynomials. We show that the problem of deciding whether a single square root is rationalizable can be reformulated in geometrical terms. Using this approach, we give easy criteria to decide rationalizability in most cases of square roots in one and two variables. We also give partial results and strategies to prove or disprove rationalizability of sets of square roots. We apply the results to many examples from actual computations in high energy particle physics.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.