The slice algorithm for irreducible decomposition of monomial ideals

DOI10.1016/J.JSC.2008.08.002zbMATH Open1169.13020arXivmath/0702040OpenAlexW4242634013MaRDI QIDQ1008570FDOQ1008570

Bjarke Hammersholt Roune

Publication date: 30 March 2009

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

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.

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

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

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)

Cites Work

• Solving thousand-digit Frobenius problems using Gröbner bases
• Title not available (Why is that?)
• Combinatorial secant varieties
• Frobenius numbers by lattice point enumeration
• Combinatorial symbolic powers
• Computing the integer programming gap
• Computation of Hilbert functions
• Tropical convexity via cellular resolutions
• An improved equivalence algorithm
• Title not available (Why is that?)
• Generic and cogeneric monomial ideals
• Title not available (Why is that?)
• Computation of Hilbert-Poincaré series
• Computing irredundant irreducible decompositions of large scale monomial ideals

Cited In (8)

• A simple algorithm for principalization of monomial ideals
• Siphons in chemical reaction networks
• ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS
• Computing the support of monomial iterated mapping cones
• Primary decomposition of squarefree pseudomonomial ideals
• Decompositions of Monomial Ideals in Real Semigroup Rings
• Complementary decompositions of monomial ideals and involutive bases
• Computing irredundant irreducible decompositions of large scale monomial ideals

Uses Software

• Macaulay2
• 4ti2
• Frobby
• Monos

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)