English
Related papers

Related papers: LOOL: Mathematica package for evaluating leading o…

200 papers

We consider the massless two-loop two-point function with arbitrary powers of the propagators and derive a representation, from which we can obtain the Laurent expansion to any desired order in the dimensional regularization parameter eps.…

High Energy Physics - Phenomenology · Physics 2009-11-10 Isabella Bierenbaum , Stefan Weinzierl

The focus of these lecture notes is on abstract models and basic ideas and results that relate to the operational semantics of programming languages largely conceived. The approach is to start with an abstract description of the computation…

Programming Languages · Computer Science 2025-10-15 Roberto M. Amadio

This paper concerns the development of metatheory for extensible languages. It uses as its starting point a view that programming languages tailored to specific application domains are to be constructed by composing components from an open…

Programming Languages · Computer Science 2023-12-25 Dawn Michaelson , Gopalan Nadathur , Eric Van Wyk

In this paper, we study systematically scalar one-loop two-, three-, and four-point Feynman integrals with complex internal masses. Our analytic results presented in this report are valid for both real and complex internal masses. The…

High Energy Physics - Phenomenology · Physics 2018-09-19 K. H. Phan , T. N. H. Pham

One-loop amplitudes are to a large extent determined by their unitarity cuts in four dimensions. We show that the remaining rational terms can be obtained from the ultraviolet behaviour of the amplitude, and determine universal form factors…

High Energy Physics - Phenomenology · Physics 2010-10-27 T. Binoth , J. Ph. Guillet , G. Heinrich

One-loop amplitudes may be expanded in a basis of scalar integrals multiplied by rational coefficients. We relate the coefficient of the one-point integral to the coefficients of higher-point integrals, by considering the effects of…

High Energy Physics - Theory · Physics 2011-01-18 Ruth Britto , Bo Feng

Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We…

Logic in Computer Science · Computer Science 2017-02-21 Amelia Harrison , Yuliya Lierler

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

Logic in Computer Science · Computer Science 2020-08-04 Michael J. Maher

Fine-tuning is the primary methodology for tailoring pre-trained large language models to specific tasks. As the model's scale and the diversity of tasks expand, parameter-efficient fine-tuning methods are of paramount importance. One of…

Machine Learning · Computer Science 2024-01-10 Wenhan Xia , Chengwei Qin , Elad Hazan

We apply the string inspired worldline formalism to the calculation of the higher derivative expansion of one-loop effective actions in non-Abelian gauge theory. For this purpose, we have completely computerized the method, using the…

High Energy Physics - Theory · Physics 2009-10-30 D. Fliegner , P. Haberl , M. G. Schmidt , C. Schubert

We present a review of the Bielefeld-Dubna activities on the multiloop calculations. In the first part a C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented, in the second part various…

High Energy Physics - Phenomenology · Physics 2011-04-15 J. Fleischer , M. Tentyukov , O. L. Veretin

We extend the maximal unitarity method at two loops to double-box basis integrals with up to three external massive legs. We use consistency equations based on the requirement that integrals of total derivatives vanish. We obtain unique…

High Energy Physics - Theory · Physics 2025-05-08 Henrik Johansson , David A. Kosower , Kasper J. Larsen

We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of…

Logic in Computer Science · Computer Science 2015-06-17 Martin Avanzini , Ugo Dal Lago , Georg Moser

We present a one-fits-all programmatic approach to reason about a plethora of objectives on probabilistic programs. The first ingredient is to add a reward-statement to the language. We then define a program transformation applying a…

Programming Languages · Computer Science 2026-03-04 Philipp Schröer , Joost-Pieter Katoen

We use functional methods to compute one-loop effects in Heavy Quark Effective Theory. The covariant derivative expansion technique facilitates the efficient extraction of matching coefficients and renormalization group evolution equations.…

High Energy Physics - Phenomenology · Physics 2020-07-15 Timothy Cohen , Marat Freytsis , Xiaochuan Lu

We describe a first attempt to calculate scalar 2-loop box-functions with arbitrary internal masses, applying a novel method proposed in hep-ph/9407234. Four of the eight integrals are accessible to integration by means of the residue…

High Energy Physics - Phenomenology · Physics 2011-09-13 R. Kreckel , D. Kreimer , K. Schilcher

We compare predictions of the quantum loop expansion to (essentially) infinite orders with (essentially) exact results in a simple quantum mechanical model.We find that there are exponentially small corrections to the loop expansion, which…

Mathematical Physics · Physics 2012-09-28 Amna Noreen , Kåre Olaussen

Higher order coefficients of the inverse mass expansion of one--loop effective actions are obtained from a one--dimensional path integral representation. For the evaluation of the path integral with Wick contractions a suitable Green…

High Energy Physics - Theory · Physics 2007-05-23 Denny Fliegner , Peter Haberl , Michael G. Schmidt , Christian Schubert

One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…

Logic · Mathematics 2024-11-27 Amirhossein Akbar Tabatabai

A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships between the values of variables, or program properties such…

Logic in Computer Science · Computer Science 2021-09-13 Bishoksan Kafle , John P. Gallagher , Manuel V. Hermenegildo , Maximiliano Klemen , Pedro López-García , José F. Morales