Related papers: LatticePolytopes: A package for computations with …
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
A program package, which facilitates computations in the framework of Analytic approach to QCD, is developed and described in details. The package includes the explicit expressions for relevant spectral functions calculated up to the…
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…
The package \textsf{clayton} is designed to be intuitive, user-friendly, and efficient. It offers a wide range of copula models, including Archimedean, Elliptical, and Extreme. The package is implemented in pure \textsf{Python}, making it…
In this paper we present an algorithm for computing a matrix representation for a surface in P^3 parametrized over a 2-dimensional toric variety T. This algorithm follows the ideas of [Botbol-Dickenstein-Dohm-09] and it was implemented in…
Symbolic powers are a classical commutative algebra topic that relates to primary decomposition, consisting, in some circumstances, of the functions that vanish up to a certain order on a given variety. However, these are notoriously…
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two…
A set of Maplev R.3 software routines, for plotting 2D/3D projections of Poincar\'e surfaces-of-section of Hamiltonian dynamical systems, is presented. The package consists of a plotting-command plus a set of facility-commands for a quick…
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…
We propose a homotopy method for solving mathematical programs with complementarity constraints (CCs). The indicator function of the CCs is relaxed by a Lasry-Lions double envelope, an extension of the Moreau envelope that enjoys an…
We present a computational toolkit for (local) Poisson-Nijenhuis calculus on manifolds. Our python module $\textsf{PoissonGeometry}$ implements our algorithms, and accompanies this paper. We include two examples of how our methods can be…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
We describe a C++ program that we have written and made available for calculating the evolution of interacting scalar fields in an expanding universe. The program is particularly useful for the study of reheating and thermalization after…
We are developing a Maple package of functions related to Rota's Umbral Calculus. A Mathematica version of this package is being developed in parallel.
Methods for the computation of invariants and symmetries of nonlinear evolution, wave, and lattice equations are presented. The algorithms are based on dimensional analysis, and can be implemented in any symbolic language, such as…
In this paper we provide a description of the package \textit{PolyominoIdeals} for \textit{Macaulay2} that allows to deal with collections of cells, polyominoes and related binomial ideals.
We present an improved version of our program package oneloop which -- written as a package for MAPLE -- solves one-loop Feynman integrals. The package is calculating one-, two- and three-point functions both algebraically and numerically…
In this and a set of companion whitepapers, the USQCD Collaboration lays out a program of science and computing for lattice gauge theory. These whitepapers describe how calculation using lattice QCD (and other gauge theories) can aid the…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…