Next: Gefry Barad: Finding Eulerian Cycle Decompositions and
Up: TOME 51 (99), no. 1
Previous: D.D. Anderson and Muhammad Zafrullah: Almost Bezout Domains, III
Abstract:
We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I ⊂ 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.
Key Words: Stanley decomposition, squarefree Stanley decompo-sition, partition of a simplicial complex.
2000 Mathematics Subject Classification: Primary: 13P10, Secondary: 13H10, 13F20, 13C14.
Download the paper in pdf format here.