Mesoprimary decomposition of binomial submodules (Q524470): Difference between revisions

Let \(\mathrm{k}\) be a field and \(Q\) be a commutative monoid. A binomial ideal in the monoid algebra \(\mathrm{k}[Q]\) is an ideal \(I\) whose generators have at most two terms. The quotient \(\mathrm{k}[Q]/I\) by a binomial ideal identifies, up to a scalar multiple, any monomials appearing in the same binomial in \(I\). This induces a congruence \(\sim_I\) on the monoid \(Q\) and the quotient module \(\mathrm{k}[Q]/I\) is naturally graded with a decomposition into \(1\)-dimensional \(\mathrm{k}\)-vector spaces, at most one per \(\sim_I\)-class. In [Algebra Number Theory 8, No. 6, 1297--1364 (2014; Zbl 1341.20062)], \textit{T. Kahle} and \textit{E. Miller} introduce mesoprimary decompositions, which are combinatorial approximations of primary decompositions of \(I\) constructed from the congruence \(\sim_I\). In this paper, the author generalizes mesoprimary decompositions from binomial ideals to binomial submodules of certain graded modules over a monoid algebra, analogously to the way primary decomposition of ideals over a Noetherian 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 [loc.cit.].