Related papers: FastMinors package for Macaulay2
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…
Functional data analysis can be seriously impaired by abnormal observations, which can be classified as either magnitude or shape outliers based on their way of deviating from the bulk of data. Identifying magnitude outliers is relatively…
MATLAB is a numerical computing platform used by scientists, engineers, mathematicians, and students which contains many mathematical functions, including isprime. MATLAB's isprime function determines which elements of an input array are…
Considering a 2D matrix of positive and negative numbers, how might one draw a rectangle within it whose contents sum higher than all other rectangles'? This fundamental problem, commonly known the maximum rectangle problem or subwindow…
Forward marginal effects have recently been introduced as a versatile and effective model-agnostic interpretation method particularly suited for non-linear and non-parametric prediction models. They provide comprehensible model explanations…
We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.
We present a complete reimplementation of the LinearSystem package of Magma, with substantial improvements in design and performance. The resulting efficiency enables computations that were previously out of reach. We briefly describe the…
In this work, we propose a framework in the form of a Python package, specifically designed for the analysis of Quantum Machine Learning models. This framework is based on the PennyLane simulator and facilitates the evaluation and training…
In Mixed Integer Linear Programming (MIP), a (strong) backdoor is a "small" subset of an instance's integer variables with the following property: in a branch-and-bound procedure, the instance can be solved to global optimality by branching…
We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in \~O(|A| + r^\omega) field operations, where |A| denotes the…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
This paper introduces two new algorithms for Lie algebras over finite fields and applies them to the investigate the known simple Lie algebras of dimension at most $20$ over the field $\mathbb{F}_2$ with two elements. The first algorithm is…
The Muon optimizer enjoys strong empirical performance and theoretical grounding. However, the super-linear cost of its orthonormalization step introduces increasing overhead with scale. To alleviate this cost, several works have attempted…
Recently Gouveia, Thomas and the authors introduced the slack realization space, a new model for the realization space of a polytope. It represents each polytope by its slack matrix, the matrix obtained by evaluating each facet inequality…
Molecular dynamics (MD) simulations play a crucial role in resolving the underlying conformational dynamics of molecular systems. However, their capability to correctly reproduce and predict dynamics in agreement with experiments is limited…
Using the geometric vertex decomposition property first defined by Knutson, Miller, and Yong, a recursive definition for geometrically vertex decomposable ideals was given by Klein and Rajchgot. We introduce the Macaulay2 package…
For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for dedicated, but sufficiently 'simple' numerical approaches. We elaborate two…
Marginal effects analysis is fundamental to interpreting statistical models, yet existing implementations face computational constraints that limit analysis at scale. We introduce two Julia packages that address this gap. Margins.jl…
In this paper we study ideals generated by quite general sets of 2-minors of an $m \times n$-matrix of indeterminates. The sets of 2-minors are defined by collections of cells and include 2-sided ladders. For convex collections of cells it…
Need for the efficient processing of neural networks has given rise to the development of hardware accelerators. The increased adoption of specialized hardware has highlighted the need for more agile design flows for hardware-software…