The Slice Algorithm For Irreducible Decomposition of Monomial Ideals
Bjarke Hammersholt Roune
TL;DR
This paper introduces the Slice Algorithm, a new method for efficiently computing irreducible decompositions, Alexander duals, and socles of monomial ideals, with demonstrated practical performance.
Contribution
The paper presents the Slice Algorithm, a novel approach that improves the computation of irreducible decompositions and related structures of monomial ideals.
Findings
Good practical performance demonstrated
Efficient computation of irreducible decompositions
Applicable to various fields like biology and mathematics
Abstract
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.