Janet's Algorithm
classification
🧮 math.AC
keywords
algorithmjanetdecompositiongivesidealmonomialsquarefreestanley
read the original abstract
We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I in a polynomial ring S = K[x_1,...,x_n] and prove that Janet's algorithm gives the squarefree Stanley decomposition of S/I for a squarefree monomial ideal I. We have also shown that the Janet's algorithm gives a partition of a simplicial complex.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.