Janet's Algorithm
Abstract
We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I in a polynomial ring S = K[x1,...,xn] 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.