Janet's Algorithm

zbMATH Open1164.13010arXiv0712.0068MaRDI QIDQ3603259FDOQ3603259

Authors: I. Anwar 

Publication date: 16 February 2009

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.

Full work available at URL: https://arxiv.org/abs/0712.0068

Recommendations

• Complementary decompositions of monomial ideals and involutive bases
• scientific article; zbMATH DE number 1684370
• Computation of Janet bases for toric ideals
• scientific article; zbMATH DE number 1684371
• On a conjecture of R. P. Stanley. I: Monomial ideals

zbMATH Keywords

monomial idealStanley decompositionpartition of a simplicial complex

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cited In (5)

• Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
• Stanley decompositions and polarization
• Untangling the Newman-Janis algorithm
• Stanley depth of monomial ideals with small number of generators
• Stanley depth of multigraded modules

This page was built for publication: Janet's Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603259)