A pseudomonomial is a polynomial in K[x1,x2,...,xn] that can be written as a product of factors of the form (xi-ai)^ni, where ai is 0 or 1. The xi's in the product should be distinct. A square free pseudomonomial ideal is an ideal generated by pseudomonomials such that each ni=1.
This package finds the primary decomposition of square free pseudomonomial ideals. It also determines if an ideal is a pseudomonomial ideal.
For example, x1^2*(x3-1) is a pseudomonomial, but not square free. The polynomial x1*(x3-1) is a square free pseudomonomial. The ideal ideal(x1*(x3-1),(x1-1)*(x2-1)*x4,x1*x2*x3,(x1-1)*x2*(x5-1)) is a square free pseudomonomial ideal.
|
|
|
|
|
Version 0.3 of this package was accepted for publication in volume 12 of The Journal of Software for Algebra and Geometry on 18 July 2022, in the article Primary decomposition of squarefree pseudomonomial ideals (DOI: 10.2140/jsag.2022.12.27). That version can be obtained from the journal.
This documentation describes version 0.3 of PseudomonomialPrimaryDecomposition.
If you have used this package in your research, please cite it as follows:
|
The object PseudomonomialPrimaryDecomposition is a package, defined in PseudomonomialPrimaryDecomposition.m2.
The source of this document is in PseudomonomialPrimaryDecomposition.m2:446:0.