Related papers: Presenting LiteRed: a tool for the Loop InTEgrals …
We introduce libdlr, a library implementing the recently introduced discrete Lehmann representation (DLR) of imaginary time Green's functions. The DLR basis consists of a collection of exponentials chosen by the interpolative decomposition…
Reduze is a computer program for reducing Feynman integrals to master integrals employing a variant of Laporta's reduction algorithm. This article describes version 2 of the program. New features include the distributed reduction of single…
LibRPA is a software package designed for efficient calculations of random phase approximation (RPA) electron correlation energies from first principles using numerical atomic orbital (NAOs). Leveraging a localized resolution of identity…
This paper develops a novel nested sequent proof-search methodology for intuitionistic tense logics (ITLs), supporting finite counter-model extraction. We introduce a new loop-checking method that detects repeating nested sequents using…
By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers…
Large Language Models (LLMs) are increasingly being adopted as tools for learning; however, most tools remain text-only, limiting their usefulness for domains where visualizations are essential, such as mathematics. Recent work shows that…
In mathematics, LaTeX is the de facto standard to prepare documents, e.g., scientific publications. While some formulae are still developed using pen and paper, more complicated mathematical expressions used more and more often with…
The Libopt environment is both a methodology and a set of tools that can be used for testing, comparing, and profiling solvers on problems belonging to various collections. These collections can be heterogeneous in the sense that their…
We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in…
This paper discusses the algorithms and implementations of three Mathematica packages for the study of integrability and the computation of closed-form solutions of nonlinear polynomial PDEs. The first package, PainleveTest.m, symbolically…
In this work we report on a new version of FeynCalc, a Mathematica package widely used in the particle physics community for manipulating quantum field theoretical expressions and calculating Feynman diagrams. Highlights of the new version…
Integer linear programming (ILP) encompasses a very important class of optimization problems that are of great interest to both academia and industry. Several algorithms are available that attempt to explore the solution space of this class…
Linear Programming (LP) is widely applied in industry and is a key component of various other mathematical problem-solving techniques. Recent work introduced an LP compiler translating polynomial-time, polynomial-space algorithms into…
Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid…
We report on the three Mathematica packages hexagon, CSectors, AMBRE. They are useful for the evaluation of one- and two-loop Feynman integrals with a dependence on several kinematical scales. These integrals are typically needed for LHC…
We present SuperTracer, a Mathematica package aimed at facilitating the functional matching procedure for generic UV models. This package automates the most tedious parts of one-loop functional matching computations. Namely, the…
For an easy use of model order reduction techniques in applications, software solutions are needed. In this paper, we describe the MORLAB, Model Order Reduction LABoratory, toolbox as an efficient implementation of model reduction…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…