Computing irredundant irreducible decompositions of large scale monomial ideals

DOI10.1145/1005285.1005320zbMATH Open1134.13306OpenAlexW2103817842MaRDI QIDQ4657331FDOQ4657331

Authors R. Alexander Milowski

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005320

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Recommendations

• The slice algorithm for irreducible decomposition of monomial ideals
• Complementary decompositions of monomial ideals and involutive bases
• Monomial ideals and their decompositions
• ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS
• Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms

Cited in

(6)

• Tropical convexity via cellular resolutions
• Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
• Reverse-engineering of polynomial dynamical systems
• The slice algorithm for irreducible decomposition of monomial ideals
• Computing residue currents of monomial ideals using comparison formulas
• Reverse search for monomial ideals

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Computing irredundant irreducible decompositions of large scale monomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657331)