Reverse search for monomial ideals

Authors:
Dave Bayer;Amelia Taylor
Affiliations:
Department of Mathematics, Barnard College, Columbia University, New York, NY 10027, USA;Department of Mathematics and Computer Science, Colorado College, Colorado Springs, CO 80903, USA
Venue:
Journal of Symbolic Computation
Year:
2009

Citing 5
Cited 2

Computation of Hilbert functions

Journal of Symbolic Computation
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Memory-efficient enumeration of constrained spanning trees

Information Processing Letters
A "Divide and Conquer" Algorithm for Hilbert-Poincaré Series, Multiplicity and Dimension of Monomial Ideals

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing irredundant irreducible decompositions of large scale monomial ideals

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing the support of monomial iterated mapping cones

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a set of multidegrees that support all the numerical information for a monomial ideal that can be reverse searched and hence is parallelizable and has space complexity that is polynomial in the size of the input. Our approach uses a new definition of closed sets for simplicial complexes that may be useful in other contexts.