Abstract

A squarefree pseudomonomial in $K[x_1,x_2,\dots <!--FUNCTION\; APPLICATION-->,x_n]$ is a polynomial of the form $z_1{z}_2\cdots z_r$ such that $z_j\in \{x_{i_j},x_{i_j}-1\}$ for some $i_j\in \{1,\dots <!--FUNCTION\; APPLICATION-->,n\}$ and the $i_j$’s are distinct. A squarefree pseudomonomial ideal is an ideal generated by squarefree pseudomonomials. Here we present the package PseudomonomialPrimaryDecomposition for the computation of the primary decomposition of squarefree pseudomonomial ideals. Internally, the package performs computation using bitwise logical operations on integers.

Keywords

Mathematical Subject Classification 2010

Supplementary material

Macaulay2 package for primary decomposition of square free pseudonomial ideals

Milestones

Authors