The Slice Algorithm for irreducible decomposition of monomial ideals

Authors:
Bjarke Hammersholt Roune
Affiliations:
Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark
Venue:
Journal of Symbolic Computation
Year:
2009

Citing 8
Cited 6

Computation of Hilbert functions

Journal of Symbolic Computation
Generic and cogeneric monomial ideals

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
An improved equivalence algorithm

Communications of the ACM
A "Divide and Conquer" Algorithm for Hilbert-Poincaré Series, Multiplicity and Dimension of Monomial Ideals

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Irreducible decomposition of monomial ideals

ACM SIGSAM Bulletin
Tropical convexity via cellular resolutions

Journal of Algebraic Combinatorics: An International Journal
Solving thousand-digit Frobenius problems using Gröbner bases

Journal of Symbolic Computation
Computing the integer programming gap

Combinatorica

Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A slice algorithm for koszul simplicial complexes on the lcm lattice of monomial ideals

ACM Communications in Computer Algebra
A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing the support of monomial iterated mapping cones

Journal of Symbolic Computation
Complexity and algorithms for Euler characteristic of simplicial complexes

Journal of Symbolic Computation
monomialideal.lib

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

Irreducible 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.