Rationalizability of square roots

From MaRDI portal
Revision as of 18:45, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision β†’ (diff)

Publication:2028996

DOI10.1016/J.JSC.2020.12.002zbMATH Open1465.81075arXiv2006.07121OpenAlexW3119454125MaRDI QIDQ2028996FDOQ2028996

Marco Besier, Dino Festi

Publication date: 3 June 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2006.07121





Cites Work


Cited In (4)

Uses Software


Recommendations





This page was built for publication: Rationalizability of square roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028996)