The slice algorithm for irreducible decomposition of monomial ideals

DOI10.1016/j.jsc.2008.08.002zbMath1169.13020arXivmath/0702040MaRDI QIDQ1008570

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

zbMATH Keywords

monomial ideal; irreducible decomposition; Frobenius problem; socle; integer programming gap; label algorithm; maximal standard monomial; slice algorithm

Mathematics Subject Classification ID

13F55: Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes

13P99: Computational aspects and applications of commutative rings

Related Items

Siphons in chemical reaction networks, Computing the support of monomial iterated mapping cones

Uses Software

• Macaulay2
• 4ti2
• Frobby
• Monos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial secant varieties
• Computation of Hilbert functions
• Computation of Hilbert-Poincaré series
• Generic and cogeneric monomial ideals
• Computing the integer programming gap
• Combinatorial symbolic powers
• Solving thousand-digit Frobenius problems using Gröbner bases
• Tropical convexity via cellular resolutions
• Computing irredundant irreducible decompositions of large scale monomial ideals
• An improved equivalence algorithm