Top
Back: irreddecMon
Forward: mprimdec_lib
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.16 primdecMon

Procedure from library monomialideal.lib (see monomialideal_lib).

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

Return:
list, the components in a minimal primary decomposition of 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 a minimal primary decomposition of I. One may call the procedure with different algorithms using the optional argument 'alg':
- the direct method for a primary decomposition following Vasconcelos' book (alg=vp),
- from the irreducible decomposition obtained via the direct method following Vasconcelos' book (alg=vi),
- from the irreducible decomposition obtained via the
Alexander dual and using doble dual (alg=add),
- from the irreducible decomposition obtained via the
Alexander dual and quotients following E. Miller (alg=ad), - from the irreducible decomposition obtained
via ........ (alg=for),
- from the irreducible decomposition obtained via the Scarf complex following Milowski (alg=mil),
- from the irreducible decomposition obtained using the label algorihtm of Roune (alg=lr),
- from the irreducible decomposition obtained using the algorithm of Gao-Zhu (alg=gz),
- from the irreducible decomposition obtained using the slice algorithm of Roune (alg=sr).

Example:
 

Top Back: irreddecMon Forward: mprimdec_lib 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.