An algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2
We give an algorithm to compute primary decomposition of monomial ideals equigenerated in degree 2 and establish connections with minimal vertex covers of a simple graph. We also describe an implementation in C++ of the algorithm.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Peloritana dei Pericolanti
2009-09-01
|
| Series: | Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali |
| Online Access: | http://dx.doi.org/10.1478/c1a0902004 |