The slice algorithm for irreducible decomposition of monomial ideals

DOI10.1016/J.JSC.2008.08.002MaRDI QIDQ1008570zbMATH OpenOpenAlexFDO

Authors Bjarke Hammersholt Roune

Publication date 30 March 2009

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.3680, https://arxiv.org/abs/math/0702040

zbMATH Keywords

monomial idealsocleirreducible decompositionFrobenius probleminteger programming gaplabel algorithmmaximal standard monomialslice algorithm

Mathematics Subject Classification ID

Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Computational aspects and applications of commutative rings (13P99)

Abstract: A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible decompositions and Hilbert functions are also presented.

Recommendations

• Computing irredundant irreducible decompositions of large scale monomial ideals
• ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS
• Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
• A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
• Monomial ideals and their decompositions

Cites work

• scientific article; zbMATH DE number 1693050 (Why is no real title available?)
• scientific article; zbMATH DE number 503187 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• An improved equivalence algorithm
• Combinatorial secant varieties
• Combinatorial symbolic powers
• Computation of Hilbert functions
• Computation of Hilbert-Poincaré series
• Computing irredundant irreducible decompositions of large scale monomial ideals
• Computing the integer programming gap
• Frobenius numbers by lattice point enumeration
• Generic and cogeneric monomial ideals
• Solving thousand-digit Frobenius problems using Gröbner bases
• Tropical convexity via cellular resolutions

Cited in

(11)

• A simple algorithm for principalization of monomial ideals
• Siphons in chemical reaction networks
• ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS
• Decompositions of monomial ideals in real semigroup rings
• Computing the support of monomial iterated mapping cones
• A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
• Primary decomposition of squarefree pseudomonomial ideals
• Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
• Complementary decompositions of monomial ideals and involutive bases
• Computing the Betti table of a monomial ideal: a reduction algorithm
• Computing irredundant irreducible decompositions of large scale monomial ideals

Describes a project that uses

Uses Software

• Monos
• Frobby
• 4ti2
• Macaulay2

This page was built for publication: The slice algorithm for irreducible decomposition of monomial ideals

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