Computing irredundant irreducible decompositions of large scale monomial ideals

Authors:
R. Alexander Milowski
Affiliations:
San Francisco State University, San Francisco, CA
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 4
Cited 4

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Computational methods in commutative algebra and algebraic geometry

Computational methods in commutative algebra and algebraic geometry
Generic and cogeneric monomial ideals

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Computing the integer programming gap

Combinatorica

Tropical convexity via cellular resolutions

Journal of Algebraic Combinatorics: An International Journal
Reverse search for monomial ideals

Journal of Symbolic Computation
monomialideal.lib

ACM Communications in Computer Algebra
Practical Gröbner basis computation

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper outlines two methods of computing irredundant irreducible decompositions of large scale monomial ideals with tens of thousands of minimal generators. Accomplishing this task is infeasible in current available software given the algorithms they use. In contrast, an implementation was built using the methods in this paper. This implementation was able to compute large decompositions as well as other currently infeasible computations.