Related papers: A package for computations with sparse resultants
We present the Macaulay2 package Resultants, which provides commands for the effective computation of multivariate resultants, discriminants, and Chow forms. We provide some background for the algorithms implemented and show, with a few…
We present formulas for computing the resultant of sparse polynomials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous…
We introduce the Probability package for Macaulay2, which provides an interface for users to compute probabilities and generate random variates from a wide variety of univariate probability distributions.
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this…
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…
We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2. This package implements many data types, objects and algorithms which pertain to, among other things, filtered complexes,…
We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce…
We introduce the Macaulay2 package $\mathtt{LinearTruncations}$ for finding and studying the truncations of a multigraded module over a standard multigraded ring that have linear resolutions.
We introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.
We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.
The Macaulay2 package Cremona performs some computations on rational and birational maps between irreducible projective varieties. For instance, it provides methods to compute degrees and projective degrees of rational maps without any…
This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…
We shortly describe the algorithms behind some of the functions provided by the Macaulay2 package MultiprojectiveVarieties, a package for multi-projective varieties and rational maps between them.
We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…
We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.
In this article, we present FastMinors.m2, a package in Macaulay2 designed to introduce new methods focused on computations in function field linear algebra. Some key functionality that our package offers includes: finding a submatrix of a…
The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be…