GenericInitialIdeal -- find the generic initial ideal of a given ideal

Description

GenericInitialIdeal is a package for computing generic initial ideals of ideals in a polynomial ring, that is, the monomial ideal of lead terms after a random change of coordinates. All of these routines are probabilistic: with high probability, they give the correct answer, but it could be the case that the choice of coordinates is too special.

Authors

Alexandra Seceleanu <[email protected]>
Nathaniel Stapleton <[email protected]>

Version

This documentation describes version 0.2 of GenericInitialIdeal.

Source code

The source code from which this documentation is derived is in the file GenericInitialIdeal.m2.

Exports

Functions and commands
- gin -- the generic initial ideal
- lexgin -- the generic initial ideal with respect to lexicographical order
Methods
- gin(Ideal) -- the generic initial ideal
- gin(QuotientRing) -- the generic initial ideal
- lexgin(Ideal) -- the generic initial ideal with respect to lexicographical order
- lexgin(QuotientRing) -- the generic initial ideal with respect to lexicographical order
Symbols

For the programmer

The object GenericInitialIdeal is a package.