Numerical evaluations of 2-loop kites and 3-loop tadpoles
with several elliptic obstructions lead to remarkable
empirical evaluations in terms of polylogarithms, for which
proofs are very hard to find, notwithstanding intensive use
of packages such as HyperInt and MZIteratedIntegral. I
describe the efficient methods by which puzzlingly simple
results were obtained and hopes for demystifying them.
Polylogarithms from diagrams with elliptic obstructions
Full text:
pdf
Published on:
September 17, 2024
Abstract
DOI: https://doi.org/10.22323/1.467.0086
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.