The Core of 0-Dimensional Monomial Ideals
classification
🧮 math.AC
math.AG
keywords
coremonomialidealidealsadjointsalgorithmcasecoefficient
read the original abstract
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.