A
squarefree pseudomonomial in
K[x1,x2,…,xn]
is a polynomial of the form
z1z2⋯zr
such that
zj∈{xij,xij−1}
for some
ij∈{1,…,n}
and the
ij’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.
