Related papers: Kira - A Feynman Integral Reduction Program
We present a new interface called FeynHelpers that connects FeynCalc, a Mathematica package for symbolic semi-automatic evaluation of Feynman diagrams and calculations in quantum field theory (QFT) to Package-X and FIRE. The former provides…
We present a program for the reduction of large systems of integrals to master integrals. The algorithm was first proposed by Laporta; in this paper, we implement it in MAPLE. We also develop two new features which keep the size of…
Systems of integration-by-parts identities play an important role in simplifying the higher-loop Feynman integrals that arise in quantum field theory. Solving these systems is equivalent to reducing integrals containing numerator products…
We present a new package for Mathematica system, called Libra. Its purpose is to provide convenient tools for the transformation of the first-order differential systems $\partial_i \boldsymbol j = M_i \boldsymbol j$ for one or several…
Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous…
Low-rank adaption (LoRA) is a widely used parameter-efficient finetuning method for LLM that reduces memory requirements. However, current LoRA optimizers lack transformation invariance, meaning the actual updates to the weights depends on…
Fine-tuning has proven to be highly effective in adapting pre-trained models to perform better on new desired tasks with minimal data samples. Among the most widely used approaches are reparameterization methods, which update a target…
We present OPITeR, a FORM program for the reduction of multi-loop tensor Feynman integrals. The program can handle tensors, including spinor indices, with rank of up to 20 and can deal with up to 8 independent external momenta. The…
One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep…
The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
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…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
The 4-th order Runge-Kutta method in the complex plane is proposed for numerically advancing the solutions of a system of first order differential equations in one external invariant satisfied by the master integrals related to a Feynman…
We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the Standard Model in dimensional regularization. After highlighting issues in the textbook treatment…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
We propose a method for performing software pipelining on quantum for-loop programs, exploiting parallelism in and across iterations. We redefine concepts that are useful in program optimization, including array aliasing, instruction…
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
The 4-th order Runge-Kutta method in the complex plane is proposed for numerically advancing the solutions of a system of first order differential equations in one external invariant satisfied by the master integrals related to a Feynman…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…