Related papers: FORM Version 5.0
The Gaussian graphical model (GGM) incorporates an undirected graph to represent the conditional dependence between variables, with the precision matrix encoding partial correlation between pair of variables given the others. To achieve…
We describe and implement a symbolic algebra for scalar and vector-valued finite elements, enabling the computer generation of elements with tensor product structure on quadrilateral, hexahedral and triangular prismatic cells. The algebra…
We explain the construction of Forcer, a FORM program for the reduction of four-loop massless propagator-type integrals to master integrals. The resulting program performs parametric IBP reductions similar to the three-loop Mincer program.…
Graph Representation Learning (GRL) methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are…
We perform a complete analytical reduction of general one-loop Feynman integrals with five and six external legs for tensors up to rank R=3 and 4, respectively. An elegant formalism with extensive use of signed minors is developed for the…
Prompt engineering for large language models (LLMs) is often a manual time-intensive process that involves generating, evaluating, and refining prompts iteratively to ensure high-quality outputs. While there has been work on automating…
This paper presents a new text-guided technique for generating 3D shapes. The technique leverages a hybrid 3D shape representation, namely EXIM, combining the strengths of explicit and implicit representations. Specifically, the explicit…
Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…
Flow-based generative modeling is a powerful tool for solving inverse problems in physical sciences that can be used for sampling and likelihood evaluation with much lower inference times than traditional methods. We propose to refine flows…
A major new release of the Monte Carlo event generator Herwig++ (version 3.0) is now available. This release marks the end of distinguishing Herwig++ and HERWIG development and therefore constitutes the first major release of version 7 of…
Simflowny is an open platform which automatically generates efficient parallel code of scientific dynamical models for different simulation frameworks. Here we present major upgrades on this software to support simultaneously a quite…
This paper introduces a symbolic calculus-based approach for deriving closed-form expressions for the sums of arithmetic sequences. The method extends beyond constant-difference sequences to those with polynomially increasing steps,…
We briefly introduce new multiloop capabilities of the Mathematica package FeynCalc 10 and a collection of interfaces connecting FeynCalc to such popular tools as QGRAF, Fiesta, pySecDec, LoopTools, KIRA, FIRE or Fermat. In addition to…
The program FIESTA has been completely rewritten. Now it can be used not only as a tool to evaluate Feynman integrals numerically, but also to expand Feynman integrals automatically in limits of momenta and masses with the use of sector…
Modular graph forms are a class of non-holomorphic modular forms that arise in the low-energy expansion of genus-one closed string amplitudes. In this work, we introduce a systematic procedure to convert lattice-sum representations of…
We present new results on FeynOnium, an ongoing project to develop a general purpose software toolkit for semi-automatic symbolic calculations in nonrelativistic Effective Field Theories (EFTs). Building upon FeynCalc, an existing…
New developments concerning the extension of the Feynman diagram analyzer DIANA are presented. We discuss new graphic facilities, application of DIANA to processes with Majorana fermions and different approaches to automation of momenta…
We present the new version 2.0 of the Feynman integral reduction program Kira and describe the new features. The primary new feature is the reconstruction of the final coefficients in integration-by-parts reductions by means of finite field…
The FLAME methodology makes it possible to derive provably correct algorithms from a formal description of a linear algebra problem. So far, the methodology has been successfully used to automate the derivation of direct algorithms such as…
We introduce Lovelace, a tool for creating corpora of semantic graphs. The system uses graph expansion grammar as a representational language, thus allowing users to craft a grammar that describes a corpus with desired properties. When…