Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mesoprimary decomposition of binomial submodules

Published 31 Oct 2015 in math.AC | (1511.00161v1)

Abstract: Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary decompositions are highly combinatorial in nature, and are designed to parallel standard primary decomposition over Noetherean rings. In this paper, we generalize mesoprimary decomposition from binomial ideals to "binomial submodules" of certain graded modules over the corresponding monoid algebra, analogous to the way primary decomposition of ideals over a Noetherean ring $R$ generalizes to $R$-modules. The result is a combinatorial method of constructing primary decompositions that, when restricting to the special case of binomial ideals, coincides with the method introduced by Kahle and Miller.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.