Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Mesoprimary decomposition of binomial submodules (1511.00161v1)

Published 31 Oct 2015 in math.AC

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

We haven't generated a summary for this paper yet.