Abstract
We find an explicit expression of the associated primes of monomial ideals as a colon by an element , using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to compute is given using Macaulay2 (Section 7). For squarefree monomial ideals the problem is related to the combinatorics of the underlying clutter or graph (Proposition 4.3). For ideals of Borel type the monomial takes a simpler form (Proposition 5.2). The authors classify when is unique (Proposition 6.2).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.