The slice algorithm for irreducible decomposition of monomial ideals

From MaRDI portal
Publication:1008570

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





Cites Work


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)