Top
Back: dimMon
Forward: primdecMon
FastBack: modstd_lib
FastForward: mprimdec_lib
Up: monomialideal_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.11.15 irreddecMon

Procedure from library monomialideal.lib (see monomialideal_lib).

Usage:
irreddecMon (I[,alg]); I ideal, alg string.

Return:
list, the irreducible components of the monomial ideal I. (returns -1 if I is not a monomial ideal).

Assume:
I is a monomial ideal of the basering k[x(1)..x(n)].

Note:
This procesure returns the irreducible decomposition of I. One may call the procedure with different algorithms using the optional argument 'alg':
- the direct method following Vasconcelos' book (alg=vas) - via the Alexander dual and using doble dual (alg=add), - via the Alexander dual and quotients following E. Miller (alg=ad),
- the formula of irreducible components (alg=for),
- via the Scarf complex following Milowski (alg=mil),
- using the label algorihtm of Roune (alg=lr),
- using the algorithm of Gao-Zhu (alg=gz).
- using the slice algorithm of Roune (alg=sr).

Example:
 


Top Back: dimMon Forward: primdecMon FastBack: modstd_lib FastForward: mprimdec_lib Up: monomialideal_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.