The Label Algorithm For Irreducible Decomposition of Monomial Ideals

TL;DR

This paper introduces the Label Algorithm for irreducible decomposition of monomial ideals, aiming to improve the computational process in algebraic geometry, though it is a preprint with limited citations and context.

Contribution

It presents the Label Algorithm as a novel method for decomposing monomial ideals, offering an alternative to existing algorithms.

Findings

The Label Algorithm provides a new approach to irreducible decomposition.

The paper discusses the algorithm's theoretical basis and potential advantages.

Further validation and comparison with other methods are needed.

Abstract

The paper that was here is a preprint that was never turned into a proper paper. In particular it does not have enough citations to the literature. The paper "The Slice Algorithm For Irreducible Decomposition of Monomial Ideals" contains a much better description of the Label algorithm than this preprint did. If you still wish to read the original preprint then access the arXiv's version 1 of this paper, instead of version 2 which is what you are reading now.