Skip to search formSkip to main contentSkip to account menu

Macaulay2

Known as: Macaulay 
Macaulay2 is a free computer algebra system developed by Daniel Grayson (UIUC) and Michael Stillman (Cornell) for computation in commutative algebra… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Bernstein–Sato polynomialC++Computer algebra systemConway polynomial (finite fields)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Homotopy Continuation in Macaulay2
We describe the design and relationships of several Macaulay2 packages that use numerical polynomial homotopy continuation as… 
2018
2018
Divisor Package for Macaulay2
This note describes a Macaulay2 package for handling divisors. Group operations for divisors are included. There are methods for… 
2017
2017
A note on the simultaneous Waring rank of monomials
In this paper we study the complex simultaneous Waring rank for a collection of monomials. Our approach is algebraic and… 
2016
2016
Numerical Implicitization for Macaulay2
We present the Macaulay2 package NumericalImplicitization, which allows for user-friendly computation of the basic invariants of… 
2013
2013
Local Cohomology Using Macaulay2
Over the last 20 years there were many advances made in the computational theory of D-modules. Nowadays, the most common computer… 
2011
2011
A method to compute Segre classes of subschemes of projective space
We present a method to compute the degrees of the Segre classes of a subscheme of complex projective space. The method is based… 
2011
2011
PHCpack in Macaulay2
The Macaulay2 package PHCpack provides an interface to PHCpack, a generalpurpose polynomial system solver that uses homotopy… 
2010
2010
Effective Methods for the Computation of Bernstein-Sato polynomials for Hypersurfaces and Affine Varieties
This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We… 
2010
2010
Computations with equivariant toric vector bundles
The study of equivariant vector bundles on a toric variety can yield important geometric information about the underlying variety… 
2009
2009
An algorithm for constructing all non-isomorphic bipartite graphs
We give an algorithm to list all biadjacency matrices of bipartite graphs arranged in a lexicographic way and avoiding isomorphic… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)