The Slice Algorithm For Irreducible Decomposition of Monomial Ideals

Simple item page
dc.creatorRoune, Bjarke Hammersholt
dc.date2008-06-23
dc.date.accessioned2026-07-07T12:47:48Z
dc.date.available2026-07-07T12:47:48Z
dc.descriptionIrreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
dc.description25 pages, 8 figures. See http://www.broune.com/ for the data used
dc.identifierhttps://arxiv.org/abs/0806.3680
dc.identifierhttp://arxiv.org/abs/0806.3680
dc.identifierJournal of Symbolic Computation, Volume 44, Issue 4, April 2009, Pages 358-381
dc.identifierdoi:10.1016/j.jsc.2008.08.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221844
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13P99 (Primary) 05E99, 11Y99 (Secondary)
dc.titleThe Slice Algorithm For Irreducible Decomposition of Monomial Ideals
dc.typetext

Files

Collections

arXiv