The slice algorithm for irreducible decomposition of monomial ideals
DOI10.1016/J.JSC.2008.08.002zbMATH Open1169.13020arXivmath/0702040OpenAlexW4242634013MaRDI QIDQ1008570FDOQ1008570
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
monomial idealsocleirreducible decompositionFrobenius probleminteger programming gaplabel algorithmmaximal standard monomialslice algorithm
Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Computational aspects and applications of commutative rings (13P99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving thousand-digit Frobenius problems using Gröbner bases
- Combinatorial secant varieties
- Combinatorial symbolic powers
- Computing the integer programming gap
- Computation of Hilbert functions
- Tropical convexity via cellular resolutions
- An improved equivalence algorithm
- Generic and cogeneric monomial ideals
- Computation of Hilbert-Poincaré series
- Computing irredundant irreducible decompositions of large scale monomial ideals
Cited In (5)
Uses Software
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)